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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:17:28,633 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:17:28,635 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:17:28,649 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:17:28,650 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:17:28,650 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:17:28,652 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:17:28,653 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:17:28,656 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:17:28,656 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:17:28,657 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:17:28,657 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:17:28,658 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:17:28,660 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:17:28,661 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:17:28,663 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:17:28,666 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:17:28,668 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:17:28,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:17:28,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:17:28,673 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:17:28,673 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:17:28,673 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:17:28,674 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:17:28,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:17:28,676 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:17:28,676 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:17:28,677 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:17:28,677 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:17:28,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:17:28,678 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:17:28,678 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:17:28,688 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:17:28,689 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:17:28,690 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:17:28,690 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:17:28,690 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:17:28,691 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:17:28,691 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:17:28,691 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:17:28,692 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:17:28,692 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:17:28,692 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:17:28,692 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:17:28,693 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:17:28,693 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:17:28,693 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:17:28,693 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:17:28,693 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:17:28,694 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:17:28,694 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:17:28,695 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:17:28,695 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:17:28,695 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:17:28,695 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:17:28,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:17:28,696 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:17:28,696 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:17:28,696 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:17:28,696 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:17:28,697 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:17:28,697 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:17:28,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:17:28,697 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:17:28,698 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:17:28,698 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:17:28,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:17:28,748 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:17:28,752 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:17:28,754 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:17:28,754 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:17:28,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-01-24 12:17:28,900 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:17:28,907 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:17:28,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:17:28,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:17:28,915 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:17:28,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:17:28" (1/1) ... [2018-01-24 12:17:28,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a75d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:28, skipping insertion in model container [2018-01-24 12:17:28,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:17:28" (1/1) ... [2018-01-24 12:17:28,935 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:17:28,952 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:17:29,062 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:17:29,079 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:17:29,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:29 WrapperNode [2018-01-24 12:17:29,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:17:29,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:17:29,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:17:29,086 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:17:29,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:29" (1/1) ... [2018-01-24 12:17:29,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:29" (1/1) ... [2018-01-24 12:17:29,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:29" (1/1) ... [2018-01-24 12:17:29,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:29" (1/1) ... [2018-01-24 12:17:29,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:29" (1/1) ... [2018-01-24 12:17:29,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:29" (1/1) ... [2018-01-24 12:17:29,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:29" (1/1) ... [2018-01-24 12:17:29,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:17:29,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:17:29,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:17:29,118 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:17:29,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:29" (1/1) ... No working directory specified, using /storage/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-01-24 12:17:29,164 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:17:29,164 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:17:29,164 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 12:17:29,164 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:17:29,164 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:17:29,165 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:17:29,165 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:17:29,165 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:17:29,165 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:17:29,165 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 12:17:29,165 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:17:29,165 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:17:29,165 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:17:29,399 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:17:29,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:17:29 BoogieIcfgContainer [2018-01-24 12:17:29,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:17:29,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:17:29,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:17:29,405 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:17:29,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:17:28" (1/3) ... [2018-01-24 12:17:29,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2dfb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:17:29, skipping insertion in model container [2018-01-24 12:17:29,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:29" (2/3) ... [2018-01-24 12:17:29,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2dfb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:17:29, skipping insertion in model container [2018-01-24 12:17:29,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:17:29" (3/3) ... [2018-01-24 12:17:29,410 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-01-24 12:17:29,418 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:17:29,425 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-01-24 12:17:29,465 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:17:29,465 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:17:29,465 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:17:29,465 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:17:29,465 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:17:29,466 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:17:29,466 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:17:29,466 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:17:29,467 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:17:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-24 12:17:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 12:17:29,491 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:29,492 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:29,492 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:29,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1202729229, now seen corresponding path program 1 times [2018-01-24 12:17:29,501 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:29,502 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:29,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:29,553 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:29,554 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:29,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:29,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:29,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:17:29,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 12:17:29,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 12:17:29,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 12:17:29,648 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-24 12:17:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:29,672 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-01-24 12:17:29,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 12:17:29,673 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-24 12:17:29,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:29,681 INFO L225 Difference]: With dead ends: 90 [2018-01-24 12:17:29,681 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 12:17:29,685 INFO L525 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-01-24 12:17:29,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 12:17:29,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 12:17:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 12:17:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-24 12:17:29,718 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2018-01-24 12:17:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:29,719 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-24 12:17:29,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 12:17:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-24 12:17:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:17:29,719 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:29,719 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:29,720 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:29,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1812590093, now seen corresponding path program 1 times [2018-01-24 12:17:29,720 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:29,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:29,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:29,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:29,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:29,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:29,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:29,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:17:29,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:17:29,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:17:29,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:17:29,779 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 3 states. [2018-01-24 12:17:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:29,919 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-01-24 12:17:29,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:17:29,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-24 12:17:29,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:29,923 INFO L225 Difference]: With dead ends: 83 [2018-01-24 12:17:29,923 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 12:17:29,924 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:17:29,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 12:17:29,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-01-24 12:17:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 12:17:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-24 12:17:29,934 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 14 [2018-01-24 12:17:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:29,935 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-24 12:17:29,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:17:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-24 12:17:29,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:17:29,936 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:29,936 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:29,936 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:29,936 INFO L82 PathProgramCache]: Analyzing trace with hash -267768884, now seen corresponding path program 1 times [2018-01-24 12:17:29,936 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:29,936 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:29,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:29,938 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:29,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:29,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:30,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:30,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:17:30,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:17:30,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:17:30,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:17:30,044 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2018-01-24 12:17:30,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:30,168 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2018-01-24 12:17:30,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:17:30,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 12:17:30,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:30,170 INFO L225 Difference]: With dead ends: 113 [2018-01-24 12:17:30,171 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 12:17:30,172 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 12:17:30,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-01-24 12:17:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 12:17:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-24 12:17:30,181 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 15 [2018-01-24 12:17:30,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:30,181 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-24 12:17:30,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:17:30,182 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-24 12:17:30,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:17:30,182 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:30,183 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:30,183 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:30,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181562, now seen corresponding path program 1 times [2018-01-24 12:17:30,183 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:30,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:30,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:30,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:30,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:30,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:30,235 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:30,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:17:30,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:17:30,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:17:30,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:17:30,237 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states. [2018-01-24 12:17:30,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:30,263 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-01-24 12:17:30,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:17:30,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-01-24 12:17:30,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:30,266 INFO L225 Difference]: With dead ends: 57 [2018-01-24 12:17:30,266 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 12:17:30,267 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:17:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 12:17:30,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-24 12:17:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 12:17:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-24 12:17:30,275 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 19 [2018-01-24 12:17:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:30,275 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-24 12:17:30,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:17:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-24 12:17:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:17:30,276 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:30,277 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:30,277 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:30,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181563, now seen corresponding path program 1 times [2018-01-24 12:17:30,277 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:30,277 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:30,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:30,278 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:30,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:30,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:30,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:30,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:17:30,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:17:30,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:17:30,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:17:30,382 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-01-24 12:17:30,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:30,475 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-24 12:17:30,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:17:30,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-24 12:17:30,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:30,477 INFO L225 Difference]: With dead ends: 67 [2018-01-24 12:17:30,477 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 12:17:30,478 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:17:30,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 12:17:30,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-01-24 12:17:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 12:17:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-01-24 12:17:30,487 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 19 [2018-01-24 12:17:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:30,488 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-01-24 12:17:30,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:17:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-01-24 12:17:30,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:17:30,489 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:30,489 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:30,489 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:30,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2060273317, now seen corresponding path program 1 times [2018-01-24 12:17:30,489 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:30,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:30,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:30,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:30,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:30,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:17:30,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:30,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:17:30,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:17:30,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:17:30,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:17:30,558 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-01-24 12:17:30,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:30,651 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-01-24 12:17:30,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:17:30,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-24 12:17:30,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:30,653 INFO L225 Difference]: With dead ends: 70 [2018-01-24 12:17:30,653 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 12:17:30,654 INFO L525 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-01-24 12:17:30,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 12:17:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-01-24 12:17:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 12:17:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-24 12:17:30,662 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 28 [2018-01-24 12:17:30,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:30,663 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-24 12:17:30,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:17:30,663 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-24 12:17:30,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:17:30,664 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:30,665 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:30,665 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:30,665 INFO L82 PathProgramCache]: Analyzing trace with hash 556036660, now seen corresponding path program 1 times [2018-01-24 12:17:30,665 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:30,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:30,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:30,667 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:30,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:30,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:30,851 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:30,851 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:30,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:30,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:30,941 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-01-24 12:17:30,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:30,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:17:30,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:17:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:17:31,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:17:31,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-01-24 12:17:31,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:17:31,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:17:31,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:17:31,026 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 10 states. [2018-01-24 12:17:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:31,261 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2018-01-24 12:17:31,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:17:31,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-01-24 12:17:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:31,264 INFO L225 Difference]: With dead ends: 134 [2018-01-24 12:17:31,264 INFO L226 Difference]: Without dead ends: 115 [2018-01-24 12:17:31,265 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:17:31,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-24 12:17:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 70. [2018-01-24 12:17:31,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 12:17:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-24 12:17:31,276 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 29 [2018-01-24 12:17:31,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:31,276 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-24 12:17:31,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:17:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-24 12:17:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:17:31,278 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:31,278 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:31,278 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:31,279 INFO L82 PathProgramCache]: Analyzing trace with hash 556036659, now seen corresponding path program 1 times [2018-01-24 12:17:31,279 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:31,279 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:31,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:31,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:31,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:31,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:31,331 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:31,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:17:31,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:17:31,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:17:31,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:17:31,333 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 5 states. [2018-01-24 12:17:31,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:31,431 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-01-24 12:17:31,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:17:31,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 12:17:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:31,433 INFO L225 Difference]: With dead ends: 70 [2018-01-24 12:17:31,433 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 12:17:31,434 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:31,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 12:17:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-24 12:17:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-24 12:17:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-01-24 12:17:31,444 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 29 [2018-01-24 12:17:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:31,444 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-01-24 12:17:31,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:17:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-01-24 12:17:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 12:17:31,446 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:31,446 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:31,446 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:31,446 INFO L82 PathProgramCache]: Analyzing trace with hash -848422454, now seen corresponding path program 1 times [2018-01-24 12:17:31,446 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:31,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:31,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:31,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:31,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:31,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:17:31,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:31,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:17:31,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:17:31,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:17:31,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:31,660 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 6 states. [2018-01-24 12:17:31,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:31,733 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-01-24 12:17:31,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:17:31,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-24 12:17:31,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:31,734 INFO L225 Difference]: With dead ends: 72 [2018-01-24 12:17:31,734 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 12:17:31,735 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:31,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 12:17:31,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-01-24 12:17:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 12:17:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-24 12:17:31,744 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 32 [2018-01-24 12:17:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:31,744 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-24 12:17:31,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:17:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-24 12:17:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:17:31,746 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:31,746 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:31,746 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:31,746 INFO L82 PathProgramCache]: Analyzing trace with hash -736270445, now seen corresponding path program 1 times [2018-01-24 12:17:31,746 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:31,746 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:31,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:31,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:31,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:31,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:31,885 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:31,885 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:31,894 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:31,917 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:32,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:32,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-01-24 12:17:32,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:17:32,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:17:32,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:17:32,009 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 14 states. [2018-01-24 12:17:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:32,154 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-01-24 12:17:32,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:17:32,155 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-01-24 12:17:32,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:32,155 INFO L225 Difference]: With dead ends: 144 [2018-01-24 12:17:32,156 INFO L226 Difference]: Without dead ends: 100 [2018-01-24 12:17:32,156 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:17:32,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-24 12:17:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2018-01-24 12:17:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 12:17:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-01-24 12:17:32,164 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 34 [2018-01-24 12:17:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:32,165 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-01-24 12:17:32,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:17:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-01-24 12:17:32,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 12:17:32,166 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:32,166 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:32,166 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:32,166 INFO L82 PathProgramCache]: Analyzing trace with hash 733800956, now seen corresponding path program 1 times [2018-01-24 12:17:32,166 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:32,166 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:32,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:32,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:32,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:32,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:17:32,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:32,232 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:32,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:32,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 12:17:32,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:17:32,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-01-24 12:17:32,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:17:32,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:17:32,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:17:32,308 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 9 states. [2018-01-24 12:17:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:32,464 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2018-01-24 12:17:32,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:17:32,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-01-24 12:17:32,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:32,465 INFO L225 Difference]: With dead ends: 166 [2018-01-24 12:17:32,465 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 12:17:32,466 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:17:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 12:17:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 91. [2018-01-24 12:17:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-24 12:17:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-01-24 12:17:32,476 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 45 [2018-01-24 12:17:32,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:32,477 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-01-24 12:17:32,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:17:32,477 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-01-24 12:17:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 12:17:32,478 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:32,478 INFO L322 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:32,478 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:32,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1268780948, now seen corresponding path program 2 times [2018-01-24 12:17:32,478 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:32,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:32,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:32,479 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:32,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:32,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 12:17:32,582 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:32,582 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:32,591 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:17:32,604 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:32,616 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:32,618 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:32,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 12:17:32,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:32,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2018-01-24 12:17:32,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:17:32,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:17:32,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:17:32,682 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 9 states. [2018-01-24 12:17:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:32,826 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-01-24 12:17:32,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:17:32,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-01-24 12:17:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:32,828 INFO L225 Difference]: With dead ends: 93 [2018-01-24 12:17:32,828 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 12:17:32,829 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:17:32,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 12:17:32,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-01-24 12:17:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-24 12:17:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-01-24 12:17:32,838 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 53 [2018-01-24 12:17:32,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:32,839 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-01-24 12:17:32,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:17:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-01-24 12:17:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 12:17:32,841 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:32,841 INFO L322 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:32,841 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:32,841 INFO L82 PathProgramCache]: Analyzing trace with hash -677503677, now seen corresponding path program 1 times [2018-01-24 12:17:32,841 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:32,841 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:32,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:32,842 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:17:32,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:32,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-24 12:17:33,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:33,050 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:33,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:33,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:33,094 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-01-24 12:17:33,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:33,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:17:33,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:17:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 12:17:33,264 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:33,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-01-24 12:17:33,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:17:33,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:17:33,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:17:33,265 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 13 states. [2018-01-24 12:17:33,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:33,488 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-01-24 12:17:33,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:17:33,488 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-01-24 12:17:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:33,489 INFO L225 Difference]: With dead ends: 106 [2018-01-24 12:17:33,489 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 12:17:33,490 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:17:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 12:17:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2018-01-24 12:17:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-24 12:17:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-01-24 12:17:33,499 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 54 [2018-01-24 12:17:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:33,500 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-01-24 12:17:33,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:17:33,500 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-01-24 12:17:33,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-24 12:17:33,501 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:33,501 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:33,501 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:33,502 INFO L82 PathProgramCache]: Analyzing trace with hash 24418059, now seen corresponding path program 1 times [2018-01-24 12:17:33,502 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:33,502 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:33,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:33,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:33,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:33,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-24 12:17:33,591 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:33,591 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:33,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:33,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-24 12:17:33,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:33,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-01-24 12:17:33,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:17:33,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:17:33,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:17:33,736 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 12 states. [2018-01-24 12:17:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:34,013 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2018-01-24 12:17:34,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:17:34,013 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-01-24 12:17:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:34,014 INFO L225 Difference]: With dead ends: 185 [2018-01-24 12:17:34,014 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 12:17:34,015 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:17:34,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 12:17:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2018-01-24 12:17:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-24 12:17:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-01-24 12:17:34,025 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 70 [2018-01-24 12:17:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:34,026 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-01-24 12:17:34,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:17:34,026 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-01-24 12:17:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-24 12:17:34,029 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:34,029 INFO L322 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:34,029 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:34,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1595099556, now seen corresponding path program 2 times [2018-01-24 12:17:34,029 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:34,029 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:34,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:34,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:34,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:34,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-01-24 12:17:34,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:34,143 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:34,153 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:17:34,164 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:34,165 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:34,169 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:34,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:34,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 12:17:34,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:34,196 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-01-24 12:17:34,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:17:34,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:34,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 12:17:34,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:34,220 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-01-24 12:17:34,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:17:34,250 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:34,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 12:17:34,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:34,252 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-01-24 12:17:34,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:17:34,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:34,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 12:17:34,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:34,282 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-01-24 12:17:34,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:17:34,324 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_~#b~3.base| Int)) (and (= (store |c_old(#valid)| |main_~#b~3.base| 0) |c_#valid|) (= 0 (select |c_old(#valid)| |main_~#b~3.base|)))) is different from true [2018-01-24 12:17:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-01-24 12:17:34,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:17:34,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2018-01-24 12:17:34,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:17:34,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:17:34,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=63, Unknown=1, NotChecked=16, Total=110 [2018-01-24 12:17:34,383 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 11 states. [2018-01-24 12:17:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:34,639 INFO L93 Difference]: Finished difference Result 176 states and 194 transitions. [2018-01-24 12:17:34,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:17:34,639 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 101 [2018-01-24 12:17:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:34,640 INFO L225 Difference]: With dead ends: 176 [2018-01-24 12:17:34,640 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:17:34,641 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=338, Unknown=1, NotChecked=40, Total=506 [2018-01-24 12:17:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:17:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:17:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:17:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:17:34,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2018-01-24 12:17:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:34,642 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:17:34,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:17:34,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:17:34,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:17:34,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:17:34,666 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 12:17:34,681 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 12:17:34,685 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 12:17:34,986 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 37 DAG size of output 23 [2018-01-24 12:17:35,249 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 37 DAG size of output 21 [2018-01-24 12:17:35,771 WARN L146 SmtUtils]: Spent 515ms on a formula simplification. DAG size of input: 85 DAG size of output 54 [2018-01-24 12:17:35,828 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 31) no Hoare annotation was computed. [2018-01-24 12:17:35,828 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:17:35,829 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 31) no Hoare annotation was computed. [2018-01-24 12:17:35,829 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 12 18) no Hoare annotation was computed. [2018-01-24 12:17:35,829 INFO L397 ceAbstractionStarter]: At program point L14'''(lines 14 16) the Hoare annotation is: (let ((.cse6 (<= |foo_#in~size| foo_~size)) (.cse0 (not (= 0 |foo_#in~b.offset|))) (.cse1 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse4 (= foo_~i~1 0)) (.cse2 (not (= 400 (select |#length| |foo_#in~b.base|)))) (.cse5 (< |foo_#in~n| |foo_#in~size|))) (and (let ((.cse3 (<= foo_~size 1))) (or .cse0 .cse1 .cse2 (< 1 |foo_#in~size|) (and .cse3 .cse4) .cse5 (and .cse3 .cse6 (= 1 foo_~i~1)))) (let ((.cse8 (= 1 (select |#valid| foo_~b.base))) (.cse9 (= (select |#length| foo_~b.base) 400)) (.cse7 (<= foo_~size 99)) (.cse10 (= foo_~b.offset 0)) (.cse11 (<= foo_~size foo_~n))) (or (< 99 |foo_#in~size|) .cse0 .cse1 (and .cse7 .cse6 .cse8 .cse9 (= 0 foo_~i~1) .cse10 .cse11) .cse2 .cse5 (and .cse8 .cse9 .cse7 .cse10 (<= 1 foo_~i~1) .cse11))) (or .cse0 .cse1 (not (= 0 |foo_#in~size|)) (and (= foo_~size 0) .cse4) .cse2 .cse5))) [2018-01-24 12:17:35,829 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 12 18) no Hoare annotation was computed. [2018-01-24 12:17:35,829 INFO L401 ceAbstractionStarter]: For program point L14''(lines 14 16) no Hoare annotation was computed. [2018-01-24 12:17:35,829 INFO L401 ceAbstractionStarter]: For program point L14''''(lines 14 16) no Hoare annotation was computed. [2018-01-24 12:17:35,829 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 12 18) the Hoare annotation is: true [2018-01-24 12:17:35,829 INFO L401 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 12:17:35,829 INFO L401 ceAbstractionStarter]: For program point L14(lines 14 16) no Hoare annotation was computed. [2018-01-24 12:17:35,829 INFO L401 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-24 12:17:35,829 INFO L401 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 12:17:35,829 INFO L401 ceAbstractionStarter]: For program point L15'(line 15) no Hoare annotation was computed. [2018-01-24 12:17:35,830 INFO L401 ceAbstractionStarter]: For program point L15''(line 15) no Hoare annotation was computed. [2018-01-24 12:17:35,830 INFO L401 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 15) no Hoare annotation was computed. [2018-01-24 12:17:35,830 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 31) the Hoare annotation is: true [2018-01-24 12:17:35,830 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 31) no Hoare annotation was computed. [2018-01-24 12:17:35,830 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 31) the Hoare annotation is: true [2018-01-24 12:17:35,830 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 31) no Hoare annotation was computed. [2018-01-24 12:17:35,830 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 12:17:35,830 INFO L401 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-01-24 12:17:35,830 INFO L397 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1)) (= 0 |main_~#b~3.offset|) (= (select |#length| |main_~#b~3.base|) 400) (= 0 (select |old(#valid)| |main_~#b~3.base|)) (<= main_~i~3 99) (<= 0 (+ (* 4 main_~i~3) |main_~#b~3.offset|))) [2018-01-24 12:17:35,830 INFO L401 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2018-01-24 12:17:35,830 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 12:17:35,830 INFO L401 ceAbstractionStarter]: For program point L25(lines 25 29) no Hoare annotation was computed. [2018-01-24 12:17:35,830 INFO L401 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-24 12:17:35,830 INFO L401 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-24 12:17:35,831 INFO L401 ceAbstractionStarter]: For program point L23'''(line 23) no Hoare annotation was computed. [2018-01-24 12:17:35,831 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 12:17:35,831 INFO L401 ceAbstractionStarter]: For program point L23'(line 23) no Hoare annotation was computed. [2018-01-24 12:17:35,831 INFO L401 ceAbstractionStarter]: For program point L21'''''(line 21) no Hoare annotation was computed. [2018-01-24 12:17:35,831 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 20 31) no Hoare annotation was computed. [2018-01-24 12:17:35,831 INFO L401 ceAbstractionStarter]: For program point L22''(lines 22 24) no Hoare annotation was computed. [2018-01-24 12:17:35,831 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 20 31) no Hoare annotation was computed. [2018-01-24 12:17:35,831 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 20 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:17:35,831 INFO L401 ceAbstractionStarter]: For program point L22''''(lines 22 24) no Hoare annotation was computed. [2018-01-24 12:17:35,831 INFO L397 ceAbstractionStarter]: At program point L22'''(lines 22 24) the Hoare annotation is: (and (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1)) (= 0 |main_~#b~3.offset|) (= (select |#length| |main_~#b~3.base|) 400) (= 0 (select |old(#valid)| |main_~#b~3.base|)) (<= 0 (+ (* 4 main_~i~3) |main_~#b~3.offset|))) [2018-01-24 12:17:35,832 INFO L401 ceAbstractionStarter]: For program point L26'(line 26) no Hoare annotation was computed. [2018-01-24 12:17:35,832 INFO L401 ceAbstractionStarter]: For program point L21''''(line 21) no Hoare annotation was computed. [2018-01-24 12:17:35,832 INFO L397 ceAbstractionStarter]: At program point L25'''(lines 25 29) the Hoare annotation is: (and (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1)) (= 0 |main_~#b~3.offset|) (= (select |#length| |main_~#b~3.base|) 400) (= 0 (select |old(#valid)| |main_~#b~3.base|)) (<= 0 (+ (* 4 main_~i~3) |main_~#b~3.offset|))) [2018-01-24 12:17:35,832 INFO L401 ceAbstractionStarter]: For program point L21'''(line 21) no Hoare annotation was computed. [2018-01-24 12:17:35,832 INFO L401 ceAbstractionStarter]: For program point L21'(line 21) no Hoare annotation was computed. [2018-01-24 12:17:35,832 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 12:17:35,832 INFO L401 ceAbstractionStarter]: For program point L25''''(lines 25 29) no Hoare annotation was computed. [2018-01-24 12:17:35,832 INFO L401 ceAbstractionStarter]: For program point L25''(lines 25 29) no Hoare annotation was computed. [2018-01-24 12:17:35,832 INFO L401 ceAbstractionStarter]: For program point L23''(line 23) no Hoare annotation was computed. [2018-01-24 12:17:35,832 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 20 31) no Hoare annotation was computed. [2018-01-24 12:17:35,832 INFO L401 ceAbstractionStarter]: For program point L21''(line 21) no Hoare annotation was computed. [2018-01-24 12:17:35,839 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,841 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,845 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,845 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,850 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,850 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,850 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,850 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:17:35 BoogieIcfgContainer [2018-01-24 12:17:35,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:17:35,856 INFO L168 Benchmark]: Toolchain (without parser) took 6954.82 ms. Allocated memory was 303.0 MB in the beginning and 542.6 MB in the end (delta: 239.6 MB). Free memory was 264.1 MB in the beginning and 467.4 MB in the end (delta: -203.3 MB). Peak memory consumption was 189.5 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:35,857 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:17:35,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.09 ms. Allocated memory is still 303.0 MB. Free memory was 264.1 MB in the beginning and 255.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:35,858 INFO L168 Benchmark]: Boogie Preprocessor took 31.14 ms. Allocated memory is still 303.0 MB. Free memory was 255.0 MB in the beginning and 254.0 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. [2018-01-24 12:17:35,858 INFO L168 Benchmark]: RCFGBuilder took 283.30 ms. Allocated memory is still 303.0 MB. Free memory was 254.0 MB in the beginning and 237.3 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:35,858 INFO L168 Benchmark]: TraceAbstraction took 6453.29 ms. Allocated memory was 303.0 MB in the beginning and 542.6 MB in the end (delta: 239.6 MB). Free memory was 237.3 MB in the beginning and 467.4 MB in the end (delta: -230.1 MB). Peak memory consumption was 162.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:35,860 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.24 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 177.09 ms. Allocated memory is still 303.0 MB. Free memory was 264.1 MB in the beginning and 255.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.14 ms. Allocated memory is still 303.0 MB. Free memory was 255.0 MB in the beginning and 254.0 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. * RCFGBuilder took 283.30 ms. Allocated memory is still 303.0 MB. Free memory was 254.0 MB in the beginning and 237.3 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6453.29 ms. Allocated memory was 303.0 MB in the beginning and 542.6 MB in the end (delta: 239.6 MB). Free memory was 237.3 MB in the beginning and 467.4 MB in the end (delta: -230.1 MB). Peak memory consumption was 162.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant [2018-01-24 12:17:35,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((\valid == \old(\valid)[b := 1] && 0 == b) && unknown-#length-unknown[b] == 400) && 0 == \old(\valid)[b]) && 0 <= 4 * i + b - InvariantResult [Line: 14]: Loop Invariant [2018-01-24 12:17:35,867 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,868 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,868 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,868 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,868 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,871 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,871 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,871 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,872 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,872 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((!(0 == b) || !(\valid[b] == 1)) || !(400 == unknown-#length-unknown[b])) || 1 < \old(size)) || (size <= 1 && i == 0)) || \old(n) < \old(size)) || ((size <= 1 && \old(size) <= size) && 1 == i)) && ((((((99 < \old(size) || !(0 == b)) || !(\valid[b] == 1)) || ((((((size <= 99 && \old(size) <= size) && 1 == \valid[b]) && unknown-#length-unknown[b] == 400) && 0 == i) && b == 0) && size <= n)) || !(400 == unknown-#length-unknown[b])) || \old(n) < \old(size)) || (((((1 == \valid[b] && unknown-#length-unknown[b] == 400) && size <= 99) && b == 0) && 1 <= i) && size <= n))) && (((((!(0 == b) || !(\valid[b] == 1)) || !(0 == \old(size))) || (size == 0 && i == 0)) || !(400 == unknown-#length-unknown[b])) || \old(n) < \old(size)) - InvariantResult [Line: 25]: Loop Invariant [2018-01-24 12:17:35,873 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:35,874 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((\valid == \old(\valid)[b := 1] && 0 == b) && unknown-#length-unknown[b] == 400) && 0 == \old(\valid)[b]) && 0 <= 4 * i + b - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 8 error locations. SAFE Result, 6.3s OverallTime, 15 OverallIterations, 9 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 547 SDtfs, 1121 SDslu, 1411 SDs, 0 SdLazy, 1386 SolverSat, 190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 500 GetRequests, 367 SyntacticMatches, 15 SemanticMatches, 118 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=14, 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, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 193 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 29 PreInvPairs, 58 NumberOfFragments, 242 HoareAnnotationTreeSize, 29 FomulaSimplifications, 2560 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1303 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 941 NumberOfCodeBlocks, 859 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 919 ConstructedInterpolants, 80 QuantifiedInterpolants, 209069 SizeOfPredicates, 17 NumberOfNonLiveVariables, 928 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 22 InterpolantComputations, 11 PerfectInterpolantSequences, 662/773 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-17-35-880.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-17-35-880.csv Received shutdown request...