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/list-ext-properties/960521-1_1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:37:35,586 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:37:35,588 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:37:35,602 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:37:35,602 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:37:35,603 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:37:35,604 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:37:35,605 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:37:35,607 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:37:35,608 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:37:35,608 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:37:35,608 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:37:35,609 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:37:35,610 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:37:35,611 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:37:35,613 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:37:35,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:37:35,616 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:37:35,617 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:37:35,618 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:37:35,620 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:37:35,620 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:37:35,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:37:35,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:37:35,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:37:35,623 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:37:35,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:37:35,623 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:37:35,624 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:37:35,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:37:35,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:37:35,625 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:37:35,634 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:37:35,634 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:37:35,635 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:37:35,635 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:37:35,635 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:37:35,636 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:37:35,636 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:37:35,636 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:37:35,636 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:37:35,636 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:37:35,636 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:37:35,636 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:37:35,636 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:37:35,637 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:37:35,637 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:37:35,637 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:37:35,637 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:37:35,637 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:37:35,637 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:37:35,638 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:37:35,638 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:37:35,638 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:37:35,638 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:37:35,638 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:37:35,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:37:35,675 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:37:35,678 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:37:35,680 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:37:35,680 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:37:35,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-free.i [2018-02-04 18:37:35,826 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:37:35,832 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:37:35,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:37:35,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:37:35,842 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:37:35,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:37:35" (1/1) ... [2018-02-04 18:37:35,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa21b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:35, skipping insertion in model container [2018-02-04 18:37:35,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:37:35" (1/1) ... [2018-02-04 18:37:35,859 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:37:35,912 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:37:36,001 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:37:36,015 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:37:36,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:36 WrapperNode [2018-02-04 18:37:36,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:37:36,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:37:36,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:37:36,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:37:36,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:36" (1/1) ... [2018-02-04 18:37:36,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:36" (1/1) ... [2018-02-04 18:37:36,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:36" (1/1) ... [2018-02-04 18:37:36,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:36" (1/1) ... [2018-02-04 18:37:36,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:36" (1/1) ... [2018-02-04 18:37:36,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:36" (1/1) ... [2018-02-04 18:37:36,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:36" (1/1) ... [2018-02-04 18:37:36,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:37:36,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:37:36,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:37:36,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:37:36,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:36" (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:37:36,083 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:37:36,083 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:37:36,083 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 18:37:36,084 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:37:36,084 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 18:37:36,084 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 18:37:36,084 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:37:36,084 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:37:36,084 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:37:36,084 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 18:37:36,084 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 18:37:36,084 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 18:37:36,084 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 18:37:36,084 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:37:36,084 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:37:36,084 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:37:36,236 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:37:36,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:37:36 BoogieIcfgContainer [2018-02-04 18:37:36,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:37:36,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:37:36,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:37:36,238 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:37:36,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:37:35" (1/3) ... [2018-02-04 18:37:36,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42568675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:37:36, skipping insertion in model container [2018-02-04 18:37:36,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:36" (2/3) ... [2018-02-04 18:37:36,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42568675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:37:36, skipping insertion in model container [2018-02-04 18:37:36,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:37:36" (3/3) ... [2018-02-04 18:37:36,241 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-free.i [2018-02-04 18:37:36,246 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:37:36,250 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 18:37:36,273 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:37:36,273 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:37:36,273 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:37:36,273 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:37:36,273 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:37:36,273 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:37:36,273 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:37:36,273 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:37:36,274 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:37:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-02-04 18:37:36,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 18:37:36,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:36,293 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:37:36,293 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 18:37:36,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1352732268, now seen corresponding path program 1 times [2018-02-04 18:37:36,299 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:36,299 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:36,341 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:36,342 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:36,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:36,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:36,411 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:37:36,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:37:36,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:37:36,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 18:37:36,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 18:37:36,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 18:37:36,424 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-02-04 18:37:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:36,438 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-02-04 18:37:36,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 18:37:36,439 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-02-04 18:37:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:36,445 INFO L225 Difference]: With dead ends: 56 [2018-02-04 18:37:36,445 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 18:37:36,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 18:37:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 18:37:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 18:37:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 18:37:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-02-04 18:37:36,533 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2018-02-04 18:37:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:36,534 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-02-04 18:37:36,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 18:37:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-02-04 18:37:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 18:37:36,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:36,535 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:37:36,535 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 18:37:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920166, now seen corresponding path program 1 times [2018-02-04 18:37:36,535 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:36,535 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:36,536 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:36,536 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:36,537 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:36,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:36,612 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:37:36,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:37:36,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:37:36,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:37:36,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:37:36,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:37:36,615 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2018-02-04 18:37:36,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:36,740 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-02-04 18:37:36,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:37:36,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 18:37:36,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:36,741 INFO L225 Difference]: With dead ends: 52 [2018-02-04 18:37:36,741 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 18:37:36,741 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:37:36,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 18:37:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 18:37:36,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 18:37:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-02-04 18:37:36,745 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 14 [2018-02-04 18:37:36,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:36,745 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-02-04 18:37:36,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:37:36,745 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-02-04 18:37:36,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 18:37:36,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:36,745 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:37:36,745 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 18:37:36,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920165, now seen corresponding path program 1 times [2018-02-04 18:37:36,746 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:36,746 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:36,746 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:36,747 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:36,747 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:36,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:36,817 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:37:36,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:37:36,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:37:36,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:37:36,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:37:36,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:37:36,818 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-02-04 18:37:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:36,895 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-02-04 18:37:36,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:37:36,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 18:37:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:36,896 INFO L225 Difference]: With dead ends: 51 [2018-02-04 18:37:36,896 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 18:37:36,896 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-04 18:37:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 18:37:36,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 18:37:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 18:37:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-02-04 18:37:36,900 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 14 [2018-02-04 18:37:36,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:36,900 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-02-04 18:37:36,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:37:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-02-04 18:37:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 18:37:36,900 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:36,901 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:37:36,901 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 18:37:36,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748963, now seen corresponding path program 1 times [2018-02-04 18:37:36,901 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:36,901 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:36,902 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:36,902 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:36,902 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:36,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:36,925 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:37:36,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:37:36,925 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:37:36,926 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:36,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:37:37,005 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:37:37,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:37,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:37,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:37:37,020 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:37:37,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:37,023 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:37:37,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 18:37:37,031 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:37:37,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:37:37,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:37:37,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:37:37,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:37:37,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:37:37,032 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 4 states. [2018-02-04 18:37:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:37,079 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-04 18:37:37,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:37:37,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-04 18:37:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:37,080 INFO L225 Difference]: With dead ends: 48 [2018-02-04 18:37:37,080 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 18:37:37,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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:37:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 18:37:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 18:37:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 18:37:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-02-04 18:37:37,084 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 20 [2018-02-04 18:37:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:37,084 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-02-04 18:37:37,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:37:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-02-04 18:37:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 18:37:37,085 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:37,085 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:37:37,085 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 18:37:37,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748962, now seen corresponding path program 1 times [2018-02-04 18:37:37,086 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:37,086 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:37,086 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:37,087 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:37,087 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:37,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:37,101 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:37:37,101 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:37:37,101 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:37:37,102 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:37,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:37:37,139 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 8 treesize of output 7 [2018-02-04 18:37:37,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:37,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:37,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 18:37:37,220 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 16 treesize of output 15 [2018-02-04 18:37:37,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:37,226 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:37:37,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-02-04 18:37:37,264 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:37:37,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:37:37,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 18:37:37,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:37:37,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:37:37,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:37:37,265 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 7 states. [2018-02-04 18:37:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:37,381 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-02-04 18:37:37,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:37:37,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-04 18:37:37,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:37,385 INFO L225 Difference]: With dead ends: 58 [2018-02-04 18:37:37,385 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 18:37:37,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:37:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 18:37:37,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-02-04 18:37:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 18:37:37,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 18:37:37,390 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 20 [2018-02-04 18:37:37,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:37,390 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 18:37:37,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:37:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 18:37:37,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 18:37:37,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:37,391 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:37:37,392 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 18:37:37,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1905865099, now seen corresponding path program 1 times [2018-02-04 18:37:37,392 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:37,392 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:37,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:37,393 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:37,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:37,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:37:37,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:37:37,465 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:37:37,466 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:37,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:37:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:37:37,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:37:37,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-02-04 18:37:37,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:37:37,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:37:37,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:37:37,517 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 9 states. [2018-02-04 18:37:37,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:37,619 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-02-04 18:37:37,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:37:37,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-04 18:37:37,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:37,622 INFO L225 Difference]: With dead ends: 86 [2018-02-04 18:37:37,622 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 18:37:37,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:37:37,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 18:37:37,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2018-02-04 18:37:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 18:37:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-02-04 18:37:37,626 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 24 [2018-02-04 18:37:37,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:37,626 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-02-04 18:37:37,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:37:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-02-04 18:37:37,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 18:37:37,626 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:37,626 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:37:37,626 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 18:37:37,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1500155222, now seen corresponding path program 1 times [2018-02-04 18:37:37,627 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:37,627 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:37,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:37,627 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:37,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:37,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:37,643 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:37:37,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:37:37,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:37:37,644 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:37,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:37:37,679 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 8 treesize of output 7 [2018-02-04 18:37:37,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:37,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:37,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 18:37:37,700 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 16 treesize of output 15 [2018-02-04 18:37:37,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:37,706 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:37:37,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-02-04 18:37:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:37:37,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:37:37,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 18:37:37,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 18:37:37,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 18:37:37,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:37:37,801 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 10 states. [2018-02-04 18:37:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:38,074 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-02-04 18:37:38,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 18:37:38,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-02-04 18:37:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:38,075 INFO L225 Difference]: With dead ends: 97 [2018-02-04 18:37:38,075 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 18:37:38,075 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-02-04 18:37:38,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 18:37:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 77. [2018-02-04 18:37:38,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 18:37:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-02-04 18:37:38,078 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 27 [2018-02-04 18:37:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:38,078 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-02-04 18:37:38,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 18:37:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-02-04 18:37:38,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 18:37:38,079 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:38,079 INFO L351 BasicCegarLoop]: trace histogram [2, 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:37:38,079 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 18:37:38,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964650, now seen corresponding path program 1 times [2018-02-04 18:37:38,079 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:38,079 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:38,080 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:38,080 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:38,080 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:38,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 18:37:38,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:37:38,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:37:38,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:37:38,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:37:38,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:37:38,116 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 4 states. [2018-02-04 18:37:38,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:38,142 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-02-04 18:37:38,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:37:38,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 18:37:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:38,143 INFO L225 Difference]: With dead ends: 75 [2018-02-04 18:37:38,143 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 18:37:38,143 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:37:38,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 18:37:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-04 18:37:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 18:37:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-02-04 18:37:38,150 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 29 [2018-02-04 18:37:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:38,150 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-02-04 18:37:38,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:37:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-02-04 18:37:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 18:37:38,151 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:38,151 INFO L351 BasicCegarLoop]: trace histogram [2, 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:37:38,151 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 18:37:38,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964651, now seen corresponding path program 1 times [2018-02-04 18:37:38,151 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:38,152 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:38,152 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:38,152 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:38,152 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:38,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 18:37:38,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:37:38,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 18:37:38,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:37:38,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:37:38,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:37:38,275 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 7 states. [2018-02-04 18:37:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:38,362 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-02-04 18:37:38,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:37:38,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-04 18:37:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:38,363 INFO L225 Difference]: With dead ends: 71 [2018-02-04 18:37:38,363 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 18:37:38,363 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:37:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 18:37:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-04 18:37:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 18:37:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-02-04 18:37:38,368 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 29 [2018-02-04 18:37:38,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:38,368 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-02-04 18:37:38,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:37:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-02-04 18:37:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 18:37:38,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:38,369 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:37:38,369 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 18:37:38,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1546437503, now seen corresponding path program 2 times [2018-02-04 18:37:38,369 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:38,370 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:38,370 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:38,370 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:38,371 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:38,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:37:38,454 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:37:38,454 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:37:38,455 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:37:38,478 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:37:38,478 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:37:38,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:37:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:37:38,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:37:38,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-02-04 18:37:38,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 18:37:38,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 18:37:38,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:37:38,513 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 12 states. [2018-02-04 18:37:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:38,705 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-02-04 18:37:38,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 18:37:38,705 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-02-04 18:37:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:38,706 INFO L225 Difference]: With dead ends: 122 [2018-02-04 18:37:38,707 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 18:37:38,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:37:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 18:37:38,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2018-02-04 18:37:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 18:37:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-02-04 18:37:38,713 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 31 [2018-02-04 18:37:38,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:38,714 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-02-04 18:37:38,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 18:37:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-02-04 18:37:38,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 18:37:38,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:38,715 INFO L351 BasicCegarLoop]: trace histogram [2, 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:37:38,715 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 18:37:38,715 INFO L82 PathProgramCache]: Analyzing trace with hash -979522942, now seen corresponding path program 1 times [2018-02-04 18:37:38,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:38,716 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:38,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:38,716 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:37:38,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:38,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:38,733 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:37:38,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:37:38,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:37:38,734 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:38,756 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:37:38,758 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:37:38,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:38,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:38,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:37:38,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:38,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 18:37:38,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:38,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:38,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2018-02-04 18:37:38,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:38,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:38,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:38,799 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:37:38,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:38,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:38,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-02-04 18:37:38,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:37:38,835 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 8 treesize of output 7 [2018-02-04 18:37:38,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:38,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:38,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:37:38,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-02-04 18:37:38,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-02-04 18:37:38,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-02-04 18:37:38,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:38,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:38,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:38,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2018-02-04 18:37:38,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-02-04 18:37:38,933 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 12 treesize of output 11 [2018-02-04 18:37:38,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:38,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:38,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:37:38,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:47 [2018-02-04 18:37:38,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-02-04 18:37:38,987 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:37:38,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-04 18:37:38,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:38,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 1 [2018-02-04 18:37:38,993 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:38,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:39,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:37:39,004 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:61, output treesize:23 [2018-02-04 18:37:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:37:39,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:37:39,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 18:37:39,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 18:37:39,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 18:37:39,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=90, Unknown=4, NotChecked=0, Total=132 [2018-02-04 18:37:39,025 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 12 states. [2018-02-04 18:37:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:39,437 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-02-04 18:37:39,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 18:37:39,437 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-02-04 18:37:39,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:39,438 INFO L225 Difference]: With dead ends: 106 [2018-02-04 18:37:39,438 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 18:37:39,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=290, Unknown=13, NotChecked=0, Total=420 [2018-02-04 18:37:39,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 18:37:39,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-02-04 18:37:39,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 18:37:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2018-02-04 18:37:39,442 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 32 [2018-02-04 18:37:39,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:39,443 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2018-02-04 18:37:39,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 18:37:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2018-02-04 18:37:39,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 18:37:39,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:39,444 INFO L351 BasicCegarLoop]: trace histogram [2, 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:37:39,444 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 18:37:39,444 INFO L82 PathProgramCache]: Analyzing trace with hash -979514998, now seen corresponding path program 1 times [2018-02-04 18:37:39,444 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:39,444 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:39,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:39,445 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:39,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 18:37:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 18:37:39,478 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 18:37:39,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 06:37:39 BoogieIcfgContainer [2018-02-04 18:37:39,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 18:37:39,509 INFO L168 Benchmark]: Toolchain (without parser) took 3678.17 ms. Allocated memory was 397.9 MB in the beginning and 662.2 MB in the end (delta: 264.2 MB). Free memory was 354.6 MB in the beginning and 494.4 MB in the end (delta: -139.7 MB). Peak memory consumption was 124.5 MB. Max. memory is 5.3 GB. [2018-02-04 18:37:39,510 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 397.9 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:37:39,510 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.64 ms. Allocated memory is still 397.9 MB. Free memory was 354.6 MB in the beginning and 343.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 18:37:39,510 INFO L168 Benchmark]: Boogie Preprocessor took 23.71 ms. Allocated memory is still 397.9 MB. Free memory was 343.9 MB in the beginning and 342.6 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:37:39,510 INFO L168 Benchmark]: RCFGBuilder took 190.77 ms. Allocated memory is still 397.9 MB. Free memory was 342.6 MB in the beginning and 322.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-04 18:37:39,510 INFO L168 Benchmark]: TraceAbstraction took 3271.79 ms. Allocated memory was 397.9 MB in the beginning and 662.2 MB in the end (delta: 264.2 MB). Free memory was 322.7 MB in the beginning and 494.4 MB in the end (delta: -171.6 MB). Peak memory consumption was 92.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:37:39,511 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.15 ms. Allocated memory is still 397.9 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 188.64 ms. Allocated memory is still 397.9 MB. Free memory was 354.6 MB in the beginning and 343.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.71 ms. Allocated memory is still 397.9 MB. Free memory was 343.9 MB in the beginning and 342.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 190.77 ms. Allocated memory is still 397.9 MB. Free memory was 342.6 MB in the beginning and 322.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3271.79 ms. Allocated memory was 397.9 MB in the beginning and 662.2 MB in the end (delta: 264.2 MB). Free memory was 322.7 MB in the beginning and 494.4 MB in the end (delta: -171.6 MB). Peak memory consumption was 92.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L619] int *a, *b; [L620] int n; VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=0] [L632] n = 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=1] [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc(n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, n=1] [L636] a = malloc(n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, n=1] [L637] EXPR, FCALL malloc(n * sizeof(*b)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L637] b = malloc(n * sizeof(*b)) [L638] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L638] FCALL *b++ = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L639] CALL foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, n=1] [L624] int i; [L625] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L626] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L625] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L627] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L627] COND FALSE, RET !(i < n - 1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L639] foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L640] FCALL b[-1] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b[-1]=0, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L640] COND FALSE !(b[-1]) [L643] FCALL free(a) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L643] FCALL free(b) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 17 error locations. UNSAFE Result, 3.2s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 430 SDtfs, 731 SDslu, 876 SDs, 0 SdLazy, 898 SolverSat, 126 SolverUnsat, 23 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=11, 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 68 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 438 NumberOfCodeBlocks, 438 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 294 ConstructedInterpolants, 32 QuantifiedInterpolants, 56353 SizeOfPredicates, 25 NumberOfNonLiveVariables, 815 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 26/44 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-37-39-517.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_18-37-39-517.csv Received shutdown request...