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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memory-alloca/c.03-alloca_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:48:47,370 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:48:47,371 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:48:47,383 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:48:47,383 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:48:47,383 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:48:47,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:48:47,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:48:47,387 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:48:47,387 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:48:47,388 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:48:47,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:48:47,389 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:48:47,390 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:48:47,391 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:48:47,392 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:48:47,394 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:48:47,395 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:48:47,396 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:48:47,397 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:48:47,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:48:47,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:48:47,398 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:48:47,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:48:47,400 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:48:47,401 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:48:47,401 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:48:47,401 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:48:47,402 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:48:47,402 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:48:47,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:48:47,403 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 18:48:47,411 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:48:47,411 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:48:47,412 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:48:47,412 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:48:47,412 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:48:47,412 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:48:47,412 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:48:47,412 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:48:47,412 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:48:47,412 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:48:47,412 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:48:47,412 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:48:47,413 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:48:47,413 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:48:47,413 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:48:47,413 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:48:47,413 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:48:47,413 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:48:47,413 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:48:47,413 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:48:47,413 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:48:47,413 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:48:47,414 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:48:47,414 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:48:47,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:48:47,448 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:48:47,451 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:48:47,452 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:48:47,452 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:48:47,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memory-alloca/c.03-alloca_true-valid-memsafety.i [2018-02-04 18:48:47,593 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:48:47,594 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:48:47,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:48:47,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:48:47,600 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:48:47,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:48:47" (1/1) ... [2018-02-04 18:48:47,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2485bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:48:47, skipping insertion in model container [2018-02-04 18:48:47,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:48:47" (1/1) ... [2018-02-04 18:48:47,617 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:48:47,644 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:48:47,730 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:48:47,742 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:48:47,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:48:47 WrapperNode [2018-02-04 18:48:47,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:48:47,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:48:47,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:48:47,748 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:48:47,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:48:47" (1/1) ... [2018-02-04 18:48:47,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:48:47" (1/1) ... [2018-02-04 18:48:47,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:48:47" (1/1) ... [2018-02-04 18:48:47,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:48:47" (1/1) ... [2018-02-04 18:48:47,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:48:47" (1/1) ... [2018-02-04 18:48:47,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:48:47" (1/1) ... [2018-02-04 18:48:47,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:48:47" (1/1) ... [2018-02-04 18:48:47,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:48:47,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:48:47,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:48:47,767 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:48:47,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:48:47" (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-04 18:48:47,801 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:48:47,801 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:48:47,801 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-02-04 18:48:47,801 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:48:47,801 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 18:48:47,801 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 18:48:47,801 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:48:47,801 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:48:47,801 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:48:47,801 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 18:48:47,802 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-02-04 18:48:47,802 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:48:47,802 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:48:47,802 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:48:47,980 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:48:47,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:48:47 BoogieIcfgContainer [2018-02-04 18:48:47,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:48:47,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:48:47,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:48:47,983 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:48:47,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:48:47" (1/3) ... [2018-02-04 18:48:47,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf857d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:48:47, skipping insertion in model container [2018-02-04 18:48:47,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:48:47" (2/3) ... [2018-02-04 18:48:47,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf857d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:48:47, skipping insertion in model container [2018-02-04 18:48:47,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:48:47" (3/3) ... [2018-02-04 18:48:47,985 INFO L107 eAbstractionObserver]: Analyzing ICFG c.03-alloca_true-valid-memsafety.i [2018-02-04 18:48:47,990 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:48:47,994 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-02-04 18:48:48,015 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:48:48,015 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:48:48,015 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:48:48,015 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:48:48,016 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:48:48,016 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:48:48,016 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:48:48,016 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:48:48,016 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:48:48,026 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-02-04 18:48:48,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 18:48:48,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:48:48,034 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:48:48,034 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 18:48:48,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2127926480, now seen corresponding path program 1 times [2018-02-04 18:48:48,038 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:48:48,039 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:48:48,070 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:48:48,070 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:48:48,070 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:48:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:48:48,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:48:48,138 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:48:48,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:48:48,139 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:48:48,139 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:48:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:48:48,196 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:48:48,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:48:48,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:48,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:48:48,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:48:48,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:48:48,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:48:48,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 18:48:48,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:48,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:48:48,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 18:48:48,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:48:48,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:48:48,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:48:48,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-02-04 18:48:48,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:48,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:48:48,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:28 [2018-02-04 18:48:48,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-02-04 18:48:48,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:48,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:48:48,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:33 [2018-02-04 18:48:48,451 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-04 18:48:48,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:48:48,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:48:48,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:48:48,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:48:48,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:48:48,467 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 6 states. [2018-02-04 18:48:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:48:48,584 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-02-04 18:48:48,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:48:48,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 18:48:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:48:48,592 INFO L225 Difference]: With dead ends: 79 [2018-02-04 18:48:48,592 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 18:48:48,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:48:48,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 18:48:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-04 18:48:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 18:48:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-02-04 18:48:48,619 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 17 [2018-02-04 18:48:48,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:48:48,619 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-02-04 18:48:48,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:48:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-02-04 18:48:48,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 18:48:48,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:48:48,620 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:48:48,620 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 18:48:48,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2127926481, now seen corresponding path program 1 times [2018-02-04 18:48:48,620 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:48:48,620 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:48:48,621 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:48:48,621 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:48:48,621 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:48:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:48:48,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:48:48,643 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:48:48,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:48:48,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:48:48,644 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:48:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:48:48,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:48:48,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:48:48,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:48,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:48:48,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:48,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:48:48,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:48:48,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:48:48,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 18:48:48,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:48,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:48:48,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:48:48,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 18:48:48,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:48,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:48:48,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 18:48:48,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-04 18:48:48,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:48,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:48:48,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:23 [2018-02-04 18:48:48,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-04 18:48:48,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:48,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:48:48,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:23 [2018-02-04 18:48:48,779 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-04 18:48:48,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:48:48,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:48:48,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:48:48,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:48:48,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:48:48,781 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 5 states. [2018-02-04 18:48:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:48:48,896 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-02-04 18:48:48,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:48:48,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 18:48:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:48:48,898 INFO L225 Difference]: With dead ends: 71 [2018-02-04 18:48:48,898 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 18:48:48,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:48:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 18:48:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-04 18:48:48,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 18:48:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-02-04 18:48:48,903 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 17 [2018-02-04 18:48:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:48:48,903 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-02-04 18:48:48,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:48:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-02-04 18:48:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 18:48:48,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:48:48,904 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-04 18:48:48,905 INFO L371 AbstractCegarLoop]: === Iteration 3 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 18:48:48,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1541211425, now seen corresponding path program 1 times [2018-02-04 18:48:48,905 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:48:48,905 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:48:48,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:48:48,906 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:48:48,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:48:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:48:48,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:48:48,925 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:48:48,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:48:48,925 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:48:48,926 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:48:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:48:48,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:48:48,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:48:48,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:48,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:48:48,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:48,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:48:48,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:48:48,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:48:48,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:48:48,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 18:48:48,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:49,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 18:48:49,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:49,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:48:49,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 18:48:49,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-04 18:48:49,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:49,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:48:49,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:23 [2018-02-04 18:48:49,039 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-04 18:48:49,039 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:48:49,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:48:49,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:48:49,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:48:49,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:48:49,040 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 5 states. [2018-02-04 18:48:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:48:49,116 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-02-04 18:48:49,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:48:49,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 18:48:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:48:49,117 INFO L225 Difference]: With dead ends: 67 [2018-02-04 18:48:49,117 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 18:48:49,118 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:48:49,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 18:48:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 18:48:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 18:48:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-02-04 18:48:49,122 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 18 [2018-02-04 18:48:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:48:49,122 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-02-04 18:48:49,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:48:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-02-04 18:48:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 18:48:49,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:48:49,123 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:48:49,123 INFO L371 AbstractCegarLoop]: === Iteration 4 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 18:48:49,123 INFO L82 PathProgramCache]: Analyzing trace with hash 532913875, now seen corresponding path program 1 times [2018-02-04 18:48:49,123 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:48:49,123 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:48:49,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:48:49,124 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:48:49,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:48:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:48:49,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:48:49,138 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:48:49,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:48:49,138 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:48:49,139 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:48:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:48:49,169 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:48:49,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:48:49,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:49,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:48:49,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:48:49,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 18:48:49,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:49,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:48:49,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 18:48:49,189 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-04 18:48:49,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:48:49,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:48:49,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:48:49,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:48:49,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:48:49,190 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 4 states. [2018-02-04 18:48:49,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:48:49,230 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-02-04 18:48:49,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:48:49,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-04 18:48:49,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:48:49,231 INFO L225 Difference]: With dead ends: 63 [2018-02-04 18:48:49,231 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 18:48:49,231 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:48:49,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 18:48:49,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-04 18:48:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 18:48:49,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-02-04 18:48:49,233 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 19 [2018-02-04 18:48:49,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:48:49,234 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-02-04 18:48:49,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:48:49,234 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-02-04 18:48:49,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 18:48:49,234 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:48:49,234 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:48:49,234 INFO L371 AbstractCegarLoop]: === Iteration 5 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 18:48:49,234 INFO L82 PathProgramCache]: Analyzing trace with hash 532913876, now seen corresponding path program 1 times [2018-02-04 18:48:49,234 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:48:49,234 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:48:49,235 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:48:49,235 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:48:49,235 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:48:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:48:49,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:48:49,244 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:48:49,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:48:49,244 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:48:49,245 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:48:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:48:49,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:48:49,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:48:49,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:49,290 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:48:49,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:48:49,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:49,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:48:49,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-02-04 18:48:49,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:48:49,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 18:48:49,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:49,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:48:49,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:48:49,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 18:48:49,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:48:49,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:48:49,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 18:48:49,346 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-04 18:48:49,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:48:49,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:48:49,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:48:49,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:48:49,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:48:49,347 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 5 states. [2018-02-04 18:48:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:48:49,410 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-02-04 18:48:49,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:48:49,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 18:48:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:48:49,411 INFO L225 Difference]: With dead ends: 59 [2018-02-04 18:48:49,411 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 18:48:49,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-04 18:48:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 18:48:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 18:48:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 18:48:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-02-04 18:48:49,413 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 19 [2018-02-04 18:48:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:48:49,413 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-02-04 18:48:49,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:48:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-02-04 18:48:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 18:48:49,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:48:49,414 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] [2018-02-04 18:48:49,414 INFO L371 AbstractCegarLoop]: === Iteration 6 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 18:48:49,414 INFO L82 PathProgramCache]: Analyzing trace with hash -659539069, now seen corresponding path program 1 times [2018-02-04 18:48:49,414 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:48:49,414 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:48:49,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:48:49,414 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:48:49,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:48:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:48:49,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:48:49,436 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-04 18:48:49,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:48:49,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:48:49,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:48:49,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:48:49,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:48:49,437 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 4 states. [2018-02-04 18:48:49,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:48:49,471 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-02-04 18:48:49,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:48:49,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-04 18:48:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:48:49,471 INFO L225 Difference]: With dead ends: 55 [2018-02-04 18:48:49,472 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 18:48:49,472 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-04 18:48:49,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 18:48:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 18:48:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 18:48:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-02-04 18:48:49,474 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 20 [2018-02-04 18:48:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:48:49,474 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-02-04 18:48:49,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:48:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-02-04 18:48:49,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 18:48:49,475 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:48:49,475 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] [2018-02-04 18:48:49,475 INFO L371 AbstractCegarLoop]: === Iteration 7 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 18:48:49,475 INFO L82 PathProgramCache]: Analyzing trace with hash -659539068, now seen corresponding path program 1 times [2018-02-04 18:48:49,475 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:48:49,475 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:48:49,475 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:48:49,476 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:48:49,476 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:48:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:48:49,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:48:49,523 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-04 18:48:49,523 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:48:49,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:48:49,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:48:49,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:48:49,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:48:49,524 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 4 states. [2018-02-04 18:48:49,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:48:49,567 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-02-04 18:48:49,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:48:49,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-04 18:48:49,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:48:49,568 INFO L225 Difference]: With dead ends: 51 [2018-02-04 18:48:49,568 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 18:48:49,568 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-04 18:48:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 18:48:49,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 18:48:49,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 18:48:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-04 18:48:49,570 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 20 [2018-02-04 18:48:49,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:48:49,571 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-04 18:48:49,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:48:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-04 18:48:49,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 18:48:49,571 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:48:49,572 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, 1, 1, 1, 1, 1] [2018-02-04 18:48:49,572 INFO L371 AbstractCegarLoop]: === Iteration 8 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 18:48:49,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1501734176, now seen corresponding path program 1 times [2018-02-04 18:48:49,572 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:48:49,572 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:48:49,572 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:48:49,572 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:48:49,572 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:48:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:48:49,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:48:49,590 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:48:49,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:48:49,590 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:48:49,591 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:48:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:48:49,636 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:48:49,750 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|test_fun_#t~malloc2.base| Int) (|test_fun_#t~malloc0.base| Int) (|test_fun_#t~malloc1.base| Int)) (let ((.cse2 (store |c_old(#valid)| |test_fun_#t~malloc0.base| 1))) (let ((.cse0 (store .cse2 |test_fun_#t~malloc1.base| 1))) (let ((.cse1 (store .cse0 |test_fun_#t~malloc2.base| 1))) (and (= 0 (select .cse0 |test_fun_#t~malloc2.base|)) (= |c_#valid| (store (store (store (store .cse1 |c_test_fun_#t~malloc3.base| 1) |test_fun_#t~malloc0.base| 0) |test_fun_#t~malloc1.base| 0) |test_fun_#t~malloc2.base| 0)) (= 0 (select .cse1 |c_test_fun_#t~malloc3.base|)) (= (select |c_old(#valid)| |test_fun_#t~malloc0.base|) 0) (= (select .cse2 |test_fun_#t~malloc1.base|) 0)))))) is different from true [2018-02-04 18:48:49,759 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|test_fun_#t~malloc2.base| Int) (|test_fun_#t~malloc3.base| Int) (|test_fun_#t~malloc0.base| Int) (|test_fun_#t~malloc1.base| Int)) (let ((.cse2 (store |c_old(#valid)| |test_fun_#t~malloc0.base| 1))) (let ((.cse1 (store .cse2 |test_fun_#t~malloc1.base| 1))) (let ((.cse0 (store .cse1 |test_fun_#t~malloc2.base| 1))) (and (= |c_#valid| (store (store (store (store (store .cse0 |test_fun_#t~malloc3.base| 1) |test_fun_#t~malloc0.base| 0) |test_fun_#t~malloc1.base| 0) |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc3.base| 0)) (= 0 (select .cse1 |test_fun_#t~malloc2.base|)) (= 0 (select .cse0 |test_fun_#t~malloc3.base|)) (= (select |c_old(#valid)| |test_fun_#t~malloc0.base|) 0) (= (select .cse2 |test_fun_#t~malloc1.base|) 0)))))) is different from true [2018-02-04 18:48:49,779 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-04 18:48:49,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:48:49,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 18:48:49,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 18:48:49,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 18:48:49,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=55, Unknown=6, NotChecked=30, Total=110 [2018-02-04 18:48:49,780 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 11 states. [2018-02-04 18:48:50,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:48:50,000 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-02-04 18:48:50,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 18:48:50,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-02-04 18:48:50,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:48:50,001 INFO L225 Difference]: With dead ends: 50 [2018-02-04 18:48:50,001 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 18:48:50,001 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=55, Unknown=6, NotChecked=30, Total=110 [2018-02-04 18:48:50,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 18:48:50,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 18:48:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 18:48:50,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 18:48:50,002 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-02-04 18:48:50,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:48:50,002 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 18:48:50,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 18:48:50,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 18:48:50,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 18:48:50,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 06:48:50 BoogieIcfgContainer [2018-02-04 18:48:50,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 18:48:50,006 INFO L168 Benchmark]: Toolchain (without parser) took 2412.68 ms. Allocated memory was 394.8 MB in the beginning and 620.2 MB in the end (delta: 225.4 MB). Free memory was 349.9 MB in the beginning and 458.0 MB in the end (delta: -108.1 MB). Peak memory consumption was 117.3 MB. Max. memory is 5.3 GB. [2018-02-04 18:48:50,006 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 394.8 MB. Free memory is still 355.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:48:50,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.36 ms. Allocated memory is still 394.8 MB. Free memory was 348.6 MB in the beginning and 338.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:48:50,007 INFO L168 Benchmark]: Boogie Preprocessor took 18.48 ms. Allocated memory is still 394.8 MB. Free memory was 338.0 MB in the beginning and 336.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 18:48:50,007 INFO L168 Benchmark]: RCFGBuilder took 214.02 ms. Allocated memory is still 394.8 MB. Free memory was 336.7 MB in the beginning and 312.9 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-02-04 18:48:50,007 INFO L168 Benchmark]: TraceAbstraction took 2024.15 ms. Allocated memory was 394.8 MB in the beginning and 620.2 MB in the end (delta: 225.4 MB). Free memory was 311.6 MB in the beginning and 458.0 MB in the end (delta: -146.5 MB). Peak memory consumption was 79.0 MB. Max. memory is 5.3 GB. [2018-02-04 18:48:50,008 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.20 ms. Allocated memory is still 394.8 MB. Free memory is still 355.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.36 ms. Allocated memory is still 394.8 MB. Free memory was 348.6 MB in the beginning and 338.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 18.48 ms. Allocated memory is still 394.8 MB. Free memory was 338.0 MB in the beginning and 336.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 214.02 ms. Allocated memory is still 394.8 MB. Free memory was 336.7 MB in the beginning and 312.9 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2024.15 ms. Allocated memory was 394.8 MB in the beginning and 620.2 MB in the end (delta: 225.4 MB). Free memory was 311.6 MB in the beginning and 458.0 MB in the end (delta: -146.5 MB). Peak memory consumption was 79.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 31 error locations. SAFE Result, 1.9s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 274 SDtfs, 693 SDslu, 318 SDs, 0 SdLazy, 520 SolverSat, 48 SolverUnsat, 57 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 160 ConstructedInterpolants, 32 QuantifiedInterpolants, 68205 SizeOfPredicates, 25 NumberOfNonLiveVariables, 658 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/c.03-alloca_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-48-50-014.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/c.03-alloca_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_18-48-50-014.csv Received shutdown request...