java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-token_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:50:05,479 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:50:05,481 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:50:05,493 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:50:05,493 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:50:05,494 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:50:05,495 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:50:05,496 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:50:05,497 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:50:05,498 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:50:05,499 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:50:05,499 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:50:05,500 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:50:05,501 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:50:05,502 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:50:05,503 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:50:05,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:50:05,507 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:50:05,508 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:50:05,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:50:05,510 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:50:05,511 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:50:05,511 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:50:05,512 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:50:05,512 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:50:05,513 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:50:05,513 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:50:05,514 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:50:05,514 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:50:05,514 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:50:05,514 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:50:05,515 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:50:05,524 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:50:05,524 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:50:05,525 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:50:05,525 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:50:05,526 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:50:05,526 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:50:05,526 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:50:05,526 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:50:05,526 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:50:05,526 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:50:05,526 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:50:05,526 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:50:05,526 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:50:05,526 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:50:05,527 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:50:05,527 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:50:05,527 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:50:05,527 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:50:05,527 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:50:05,527 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:50:05,527 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:50:05,527 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:50:05,527 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:50:05,528 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:50:05,556 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:50:05,565 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:50:05,567 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:50:05,568 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:50:05,569 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:50:05,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-token_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:50:05,701 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:50:05,702 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:50:05,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:50:05,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:50:05,707 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:50:05,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:50:05" (1/1) ... [2018-02-02 10:50:05,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a9d1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:50:05, skipping insertion in model container [2018-02-02 10:50:05,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:50:05" (1/1) ... [2018-02-02 10:50:05,721 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:50:05,755 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:50:05,853 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:50:05,868 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:50:05,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:50:05 WrapperNode [2018-02-02 10:50:05,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:50:05,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:50:05,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:50:05,876 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:50:05,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:50:05" (1/1) ... [2018-02-02 10:50:05,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:50:05" (1/1) ... [2018-02-02 10:50:05,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:50:05" (1/1) ... [2018-02-02 10:50:05,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:50:05" (1/1) ... [2018-02-02 10:50:05,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:50:05" (1/1) ... [2018-02-02 10:50:05,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:50:05" (1/1) ... [2018-02-02 10:50:05,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:50:05" (1/1) ... [2018-02-02 10:50:05,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:50:05,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:50:05,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:50:05,904 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:50:05,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:50:05" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:50:05,939 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:50:05,939 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:50:05,939 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:50:05,939 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:50:05,939 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:50:05,940 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:50:05,940 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:50:05,940 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:50:05,940 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:50:05,940 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:50:05,940 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:50:05,940 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:50:05,940 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:50:05,940 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:50:05,940 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:50:05,940 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:50:05,940 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:50:06,271 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:50:06,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:50:06 BoogieIcfgContainer [2018-02-02 10:50:06,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:50:06,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:50:06,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:50:06,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:50:06,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:50:05" (1/3) ... [2018-02-02 10:50:06,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f368d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:50:06, skipping insertion in model container [2018-02-02 10:50:06,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:50:05" (2/3) ... [2018-02-02 10:50:06,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f368d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:50:06, skipping insertion in model container [2018-02-02 10:50:06,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:50:06" (3/3) ... [2018-02-02 10:50:06,277 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-token_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:50:06,285 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:50:06,291 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-02-02 10:50:06,324 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:50:06,325 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:50:06,325 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:50:06,325 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:50:06,325 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:50:06,325 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:50:06,325 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:50:06,325 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:50:06,326 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:50:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-02-02 10:50:06,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:50:06,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:50:06,344 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:50:06,344 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:50:06,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1807775718, now seen corresponding path program 1 times [2018-02-02 10:50:06,399 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:50:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:50:06,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:50:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:06,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:50:06,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:50:06,499 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:50:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:06,500 INFO L182 omatonBuilderFactory]: Interpolants [117#true, 118#false, 119#(= 1 (select |#valid| |main_#t~malloc0.base|)), 120#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 10:50:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:06,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:50:06,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:50:06,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:50:06,515 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 4 states. [2018-02-02 10:50:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:50:06,758 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2018-02-02 10:50:06,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:50:06,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:50:06,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:50:06,769 INFO L225 Difference]: With dead ends: 136 [2018-02-02 10:50:06,769 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 10:50:06,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:50:06,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 10:50:06,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109. [2018-02-02 10:50:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 10:50:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2018-02-02 10:50:06,809 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 8 [2018-02-02 10:50:06,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:50:06,810 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-02-02 10:50:06,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:50:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-02-02 10:50:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:50:06,811 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:50:06,811 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:50:06,811 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:50:06,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1807775717, now seen corresponding path program 1 times [2018-02-02 10:50:06,812 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:50:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:50:06,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:50:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:06,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:50:06,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:50:06,874 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:50:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:06,875 INFO L182 omatonBuilderFactory]: Interpolants [368#true, 369#false, 370#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 371#(and (= (select |#length| main_~head~0.base) 8) (= main_~head~0.offset 0))] [2018-02-02 10:50:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:06,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:50:06,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:50:06,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:50:06,881 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 4 states. [2018-02-02 10:50:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:50:06,968 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-02-02 10:50:06,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:50:06,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:50:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:50:06,969 INFO L225 Difference]: With dead ends: 131 [2018-02-02 10:50:06,969 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 10:50:06,970 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:50:06,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 10:50:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107. [2018-02-02 10:50:06,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 10:50:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-02-02 10:50:06,977 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 8 [2018-02-02 10:50:06,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:50:06,978 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-02-02 10:50:06,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:50:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-02-02 10:50:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:50:06,978 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:50:06,978 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:50:06,979 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:50:06,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1410075710, now seen corresponding path program 1 times [2018-02-02 10:50:06,980 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:50:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:50:06,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:50:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:07,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:50:07,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:50:07,026 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:50:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:07,027 INFO L182 omatonBuilderFactory]: Interpolants [612#true, 613#false, 614#(= 1 (select |#valid| main_~head~0.base)), 615#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:50:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:07,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:50:07,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:50:07,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:50:07,028 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 4 states. [2018-02-02 10:50:07,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:50:07,124 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2018-02-02 10:50:07,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:50:07,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 10:50:07,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:50:07,126 INFO L225 Difference]: With dead ends: 111 [2018-02-02 10:50:07,126 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 10:50:07,126 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:50:07,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 10:50:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2018-02-02 10:50:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 10:50:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2018-02-02 10:50:07,132 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 14 [2018-02-02 10:50:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:50:07,132 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2018-02-02 10:50:07,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:50:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-02-02 10:50:07,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:50:07,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:50:07,132 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:50:07,132 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:50:07,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1410075709, now seen corresponding path program 1 times [2018-02-02 10:50:07,133 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:50:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:50:07,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:50:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:07,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:50:07,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:50:07,211 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:50:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:07,212 INFO L182 omatonBuilderFactory]: Interpolants [827#true, 828#false, 829#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 830#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 831#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))] [2018-02-02 10:50:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:07,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:50:07,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:50:07,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:50:07,213 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 5 states. [2018-02-02 10:50:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:50:07,374 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2018-02-02 10:50:07,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:50:07,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:50:07,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:50:07,375 INFO L225 Difference]: With dead ends: 166 [2018-02-02 10:50:07,375 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 10:50:07,376 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:50:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 10:50:07,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 131. [2018-02-02 10:50:07,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-02 10:50:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-02-02 10:50:07,383 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 14 [2018-02-02 10:50:07,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:50:07,383 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-02-02 10:50:07,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:50:07,383 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-02-02 10:50:07,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:50:07,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:50:07,384 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:50:07,384 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:50:07,384 INFO L82 PathProgramCache]: Analyzing trace with hash -444857017, now seen corresponding path program 1 times [2018-02-02 10:50:07,385 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:50:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:50:07,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:50:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:07,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:50:07,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:50:07,453 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:50:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:07,453 INFO L182 omatonBuilderFactory]: Interpolants [1136#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 1137#(and (= |main_#t~mem11.offset| 0) (= (select |#length| |main_#t~mem11.base|) 8)), 1133#true, 1134#false, 1135#(and (= 0 |main_#t~malloc9.offset|) (= 8 (select |#length| |main_#t~malloc9.base|)))] [2018-02-02 10:50:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:07,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:50:07,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:50:07,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:50:07,454 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 5 states. [2018-02-02 10:50:07,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:50:07,590 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-02-02 10:50:07,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:50:07,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:50:07,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:50:07,592 INFO L225 Difference]: With dead ends: 130 [2018-02-02 10:50:07,592 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 10:50:07,592 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:50:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 10:50:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-02-02 10:50:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 10:50:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2018-02-02 10:50:07,598 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 18 [2018-02-02 10:50:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:50:07,598 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2018-02-02 10:50:07,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:50:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2018-02-02 10:50:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:50:07,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:50:07,599 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:50:07,599 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:50:07,599 INFO L82 PathProgramCache]: Analyzing trace with hash -444857018, now seen corresponding path program 1 times [2018-02-02 10:50:07,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:50:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:50:07,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:50:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:07,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:50:07,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:50:07,641 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:50:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:07,641 INFO L182 omatonBuilderFactory]: Interpolants [1408#(= 1 (select |#valid| |main_#t~mem11.base|)), 1404#true, 1405#false, 1406#(= 1 (select |#valid| |main_#t~malloc9.base|)), 1407#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 10:50:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:07,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:50:07,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:50:07,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:50:07,642 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 5 states. [2018-02-02 10:50:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:50:07,761 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2018-02-02 10:50:07,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:50:07,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:50:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:50:07,763 INFO L225 Difference]: With dead ends: 131 [2018-02-02 10:50:07,763 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 10:50:07,763 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:50:07,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 10:50:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-02-02 10:50:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 10:50:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-02-02 10:50:07,768 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 18 [2018-02-02 10:50:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:50:07,768 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-02-02 10:50:07,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:50:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-02-02 10:50:07,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:50:07,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:50:07,769 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:50:07,769 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:50:07,769 INFO L82 PathProgramCache]: Analyzing trace with hash -418196060, now seen corresponding path program 1 times [2018-02-02 10:50:07,770 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:50:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:50:07,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:50:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:07,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:50:07,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:50:07,818 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:50:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:07,819 INFO L182 omatonBuilderFactory]: Interpolants [1680#(= 1 (select |#valid| main_~x~0.base)), 1675#true, 1676#false, 1677#(= 1 (select |#valid| |main_#t~malloc4.base|)), 1678#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 1679#(= 1 (select |#valid| |main_#t~mem6.base|))] [2018-02-02 10:50:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:07,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:50:07,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:50:07,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:50:07,819 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 6 states. [2018-02-02 10:50:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:50:08,003 INFO L93 Difference]: Finished difference Result 188 states and 199 transitions. [2018-02-02 10:50:08,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:50:08,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:50:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:50:08,004 INFO L225 Difference]: With dead ends: 188 [2018-02-02 10:50:08,004 INFO L226 Difference]: Without dead ends: 188 [2018-02-02 10:50:08,004 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:50:08,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-02 10:50:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 128. [2018-02-02 10:50:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 10:50:08,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-02-02 10:50:08,009 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 18 [2018-02-02 10:50:08,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:50:08,009 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-02-02 10:50:08,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:50:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-02-02 10:50:08,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:50:08,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:50:08,010 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:50:08,010 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:50:08,010 INFO L82 PathProgramCache]: Analyzing trace with hash -418196059, now seen corresponding path program 1 times [2018-02-02 10:50:08,011 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:50:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:50:08,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:50:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:08,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:50:08,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:50:08,068 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:50:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:08,069 INFO L182 omatonBuilderFactory]: Interpolants [2004#true, 2005#false, 2006#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 2007#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2008#(and (= 0 |main_#t~mem6.offset|) (= 8 (select |#length| |main_#t~mem6.base|))), 2009#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))] [2018-02-02 10:50:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:50:08,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:50:08,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:50:08,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:50:08,069 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 6 states. [2018-02-02 10:50:08,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:50:08,223 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2018-02-02 10:50:08,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:50:08,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:50:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:50:08,224 INFO L225 Difference]: With dead ends: 210 [2018-02-02 10:50:08,224 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 10:50:08,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:50:08,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 10:50:08,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 112. [2018-02-02 10:50:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:50:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-02-02 10:50:08,228 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 18 [2018-02-02 10:50:08,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:50:08,228 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-02-02 10:50:08,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:50:08,228 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-02-02 10:50:08,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:50:08,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:50:08,229 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:50:08,229 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:50:08,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1163379848, now seen corresponding path program 1 times [2018-02-02 10:50:08,230 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:50:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:50:08,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:50:08,254 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:50:08,257 INFO L168 Benchmark]: Toolchain (without parser) took 2554.86 ms. Allocated memory was 401.6 MB in the beginning and 626.5 MB in the end (delta: 224.9 MB). Free memory was 358.3 MB in the beginning and 476.8 MB in the end (delta: -118.5 MB). Peak memory consumption was 106.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:50:08,257 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:50:08,258 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.15 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 346.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:50:08,258 INFO L168 Benchmark]: Boogie Preprocessor took 28.21 ms. Allocated memory is still 401.6 MB. Free memory was 346.4 MB in the beginning and 345.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:50:08,258 INFO L168 Benchmark]: RCFGBuilder took 367.44 ms. Allocated memory is still 401.6 MB. Free memory was 345.1 MB in the beginning and 311.9 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:50:08,258 INFO L168 Benchmark]: TraceAbstraction took 1984.35 ms. Allocated memory was 401.6 MB in the beginning and 626.5 MB in the end (delta: 224.9 MB). Free memory was 311.9 MB in the beginning and 476.8 MB in the end (delta: -164.9 MB). Peak memory consumption was 60.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:50:08,259 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 172.15 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 346.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.21 ms. Allocated memory is still 401.6 MB. Free memory was 346.4 MB in the beginning and 345.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 367.44 ms. Allocated memory is still 401.6 MB. Free memory was 345.1 MB in the beginning and 311.9 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1984.35 ms. Allocated memory was 401.6 MB in the beginning and 626.5 MB in the end (delta: 224.9 MB). Free memory was 311.9 MB in the beginning and 476.8 MB in the end (delta: -164.9 MB). Peak memory consumption was 60.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-token_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-50-08-264.csv Received shutdown request...