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_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:41:10,753 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:41:10,755 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:41:10,777 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:41:10,777 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:41:10,778 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:41:10,779 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:41:10,782 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:41:10,785 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:41:10,786 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:41:10,787 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:41:10,787 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:41:10,788 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:41:10,794 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:41:10,795 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:41:10,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:41:10,809 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:41:10,811 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:41:10,812 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:41:10,814 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:41:10,822 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:41:10,822 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:41:10,822 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:41:10,823 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:41:10,824 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:41:10,832 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:41:10,832 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:41:10,833 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:41:10,833 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:41:10,833 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:41:10,834 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:41:10,834 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_SS.epf [2018-01-31 08:41:10,865 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:41:10,865 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:41:10,866 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:41:10,866 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:41:10,866 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:41:10,866 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:41:10,867 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:41:10,867 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:41:10,868 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:41:10,868 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:41:10,868 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:41:10,868 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:41:10,868 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:41:10,868 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:41:10,869 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:41:10,869 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:41:10,869 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:41:10,869 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:41:10,869 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:41:10,869 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:41:10,870 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:41:10,870 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:41:10,870 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:41:10,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:41:10,870 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:41:10,871 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:41:10,871 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:41:10,871 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:41:10,871 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:41:10,871 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:41:10,871 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:41:10,872 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:41:10,873 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:41:10,873 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:41:10,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:41:10,947 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:41:10,951 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:41:10,953 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:41:10,954 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:41:10,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-01-31 08:41:11,093 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:41:11,105 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:41:11,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:41:11,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:41:11,114 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:41:11,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:41:11" (1/1) ... [2018-01-31 08:41:11,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44c0a7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:11, skipping insertion in model container [2018-01-31 08:41:11,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:41:11" (1/1) ... [2018-01-31 08:41:11,143 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:41:11,165 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:41:11,349 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:41:11,369 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:41:11,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:11 WrapperNode [2018-01-31 08:41:11,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:41:11,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:41:11,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:41:11,379 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:41:11,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:11" (1/1) ... [2018-01-31 08:41:11,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:11" (1/1) ... [2018-01-31 08:41:11,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:11" (1/1) ... [2018-01-31 08:41:11,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:11" (1/1) ... [2018-01-31 08:41:11,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:11" (1/1) ... [2018-01-31 08:41:11,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:11" (1/1) ... [2018-01-31 08:41:11,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:11" (1/1) ... [2018-01-31 08:41:11,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:41:11,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:41:11,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:41:11,423 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:41:11,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:11" (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-31 08:41:11,503 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:41:11,503 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:41:11,503 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 08:41:11,503 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:41:11,503 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:41:11,504 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:41:11,504 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:41:11,504 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:41:11,504 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:41:11,504 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 08:41:11,505 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:41:11,505 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:41:11,505 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:41:11,919 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:41:11,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:41:11 BoogieIcfgContainer [2018-01-31 08:41:11,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:41:11,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:41:11,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:41:11,944 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:41:11,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:41:11" (1/3) ... [2018-01-31 08:41:11,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1514193b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:41:11, skipping insertion in model container [2018-01-31 08:41:11,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:11" (2/3) ... [2018-01-31 08:41:11,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1514193b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:41:11, skipping insertion in model container [2018-01-31 08:41:11,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:41:11" (3/3) ... [2018-01-31 08:41:11,947 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-01-31 08:41:11,953 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:41:11,960 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-31 08:41:12,001 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:41:12,002 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:41:12,002 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:41:12,002 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:41:12,002 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:41:12,002 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:41:12,002 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:41:12,003 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:41:12,003 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:41:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-31 08:41:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-31 08:41:12,027 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:12,028 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:12,028 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:12,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1628091867, now seen corresponding path program 1 times [2018-01-31 08:41:12,038 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:12,038 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:12,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:12,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:12,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:12,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:12,362 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-31 08:41:12,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:41:12,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:41:12,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:41:12,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:41:12,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:41:12,387 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-01-31 08:41:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:12,590 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2018-01-31 08:41:12,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:41:12,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-31 08:41:12,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:12,604 INFO L225 Difference]: With dead ends: 133 [2018-01-31 08:41:12,605 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 08:41:12,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:41:12,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 08:41:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-01-31 08:41:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-31 08:41:12,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-01-31 08:41:12,764 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 13 [2018-01-31 08:41:12,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:12,765 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-01-31 08:41:12,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:41:12,765 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-01-31 08:41:12,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 08:41:12,766 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:12,766 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:12,766 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:12,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1198271325, now seen corresponding path program 1 times [2018-01-31 08:41:12,768 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:12,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:12,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:12,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:12,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:12,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:13,184 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-31 08:41:13,185 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:41:13,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:41:13,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:41:13,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:41:13,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:41:13,187 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 7 states. [2018-01-31 08:41:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:13,508 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2018-01-31 08:41:13,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:41:13,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-01-31 08:41:13,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:13,512 INFO L225 Difference]: With dead ends: 172 [2018-01-31 08:41:13,512 INFO L226 Difference]: Without dead ends: 121 [2018-01-31 08:41:13,514 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:41:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-31 08:41:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2018-01-31 08:41:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 08:41:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-01-31 08:41:13,527 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 22 [2018-01-31 08:41:13,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:13,527 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-01-31 08:41:13,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:41:13,527 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-01-31 08:41:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:41:13,528 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:13,528 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:13,528 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:13,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1508294640, now seen corresponding path program 1 times [2018-01-31 08:41:13,529 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:13,529 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:13,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:13,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:13,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:13,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:13,633 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-31 08:41:13,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:41:13,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:41:13,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:41:13,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:41:13,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:41:13,635 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 5 states. [2018-01-31 08:41:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:13,728 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-01-31 08:41:13,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:41:13,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-31 08:41:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:13,730 INFO L225 Difference]: With dead ends: 88 [2018-01-31 08:41:13,730 INFO L226 Difference]: Without dead ends: 87 [2018-01-31 08:41:13,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-31 08:41:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-31 08:41:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-31 08:41:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-31 08:41:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-01-31 08:41:13,742 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 23 [2018-01-31 08:41:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:13,743 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-01-31 08:41:13,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:41:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-01-31 08:41:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:41:13,744 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:13,744 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:13,744 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:13,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1508294641, now seen corresponding path program 1 times [2018-01-31 08:41:13,744 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:13,744 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:13,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:13,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:13,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:13,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:14,114 WARN L146 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 15 DAG size of output 11 [2018-01-31 08:41:14,116 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-31 08:41:14,116 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:41:14,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:41:14,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:41:14,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:41:14,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:41:14,117 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 6 states. [2018-01-31 08:41:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:14,401 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-01-31 08:41:14,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:41:14,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-31 08:41:14,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:14,404 INFO L225 Difference]: With dead ends: 101 [2018-01-31 08:41:14,404 INFO L226 Difference]: Without dead ends: 100 [2018-01-31 08:41:14,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:41:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-31 08:41:14,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2018-01-31 08:41:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-31 08:41:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-01-31 08:41:14,419 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 23 [2018-01-31 08:41:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:14,419 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-01-31 08:41:14,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:41:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-01-31 08:41:14,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 08:41:14,420 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:14,421 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:14,421 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:14,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1757973218, now seen corresponding path program 1 times [2018-01-31 08:41:14,421 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:14,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:14,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:14,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:14,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:14,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:41:14,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:14,549 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-31 08:41:14,564 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:14,604 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:41:14,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:41:14,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2018-01-31 08:41:14,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-31 08:41:14,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-31 08:41:14,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:41:14,790 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 14 states. [2018-01-31 08:41:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:15,216 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2018-01-31 08:41:15,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:41:15,216 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-01-31 08:41:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:15,218 INFO L225 Difference]: With dead ends: 166 [2018-01-31 08:41:15,218 INFO L226 Difference]: Without dead ends: 100 [2018-01-31 08:41:15,219 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:41:15,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-31 08:41:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2018-01-31 08:41:15,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-31 08:41:15,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-01-31 08:41:15,229 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 31 [2018-01-31 08:41:15,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:15,229 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-01-31 08:41:15,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-31 08:41:15,229 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-01-31 08:41:15,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 08:41:15,230 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:15,231 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:15,231 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:15,231 INFO L82 PathProgramCache]: Analyzing trace with hash 650265267, now seen corresponding path program 1 times [2018-01-31 08:41:15,231 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:15,231 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:15,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:15,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:15,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:15,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:15,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:41:15,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:15,429 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-31 08:41:15,440 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:15,473 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:41:15,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:41:15,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-01-31 08:41:15,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:41:15,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:41:15,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:41:15,604 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 8 states. [2018-01-31 08:41:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:15,692 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-01-31 08:41:15,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:41:15,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-01-31 08:41:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:15,693 INFO L225 Difference]: With dead ends: 125 [2018-01-31 08:41:15,693 INFO L226 Difference]: Without dead ends: 104 [2018-01-31 08:41:15,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:41:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-31 08:41:15,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-01-31 08:41:15,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-31 08:41:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-01-31 08:41:15,704 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 42 [2018-01-31 08:41:15,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:15,705 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-01-31 08:41:15,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:41:15,705 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-01-31 08:41:15,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:41:15,707 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:15,707 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 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, 1, 1, 1] [2018-01-31 08:41:15,707 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:15,707 INFO L82 PathProgramCache]: Analyzing trace with hash 952744944, now seen corresponding path program 1 times [2018-01-31 08:41:15,707 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:15,707 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:15,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:15,709 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:15,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:15,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-31 08:41:15,861 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:15,861 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-31 08:41:15,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:15,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-31 08:41:16,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:16,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-31 08:41:16,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:41:16,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:41:16,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:41:16,025 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 5 states. [2018-01-31 08:41:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:16,318 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-01-31 08:41:16,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:41:16,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-01-31 08:41:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:16,320 INFO L225 Difference]: With dead ends: 115 [2018-01-31 08:41:16,320 INFO L226 Difference]: Without dead ends: 114 [2018-01-31 08:41:16,320 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:41:16,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-31 08:41:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2018-01-31 08:41:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-31 08:41:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-01-31 08:41:16,330 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 60 [2018-01-31 08:41:16,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:16,330 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-01-31 08:41:16,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:41:16,331 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-01-31 08:41:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-31 08:41:16,332 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:16,333 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 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, 1, 1, 1] [2018-01-31 08:41:16,333 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:16,333 INFO L82 PathProgramCache]: Analyzing trace with hash -529677756, now seen corresponding path program 1 times [2018-01-31 08:41:16,333 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:16,333 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:16,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:16,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:16,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:16,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-31 08:41:16,670 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:16,670 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-31 08:41:16,682 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:16,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:16,741 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-31 08:41:16,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:16,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:16,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:41:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-31 08:41:16,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:16,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-01-31 08:41:16,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:41:16,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:41:16,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:41:16,975 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 9 states. [2018-01-31 08:41:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:17,189 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-31 08:41:17,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:41:17,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-01-31 08:41:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:17,191 INFO L225 Difference]: With dead ends: 114 [2018-01-31 08:41:17,191 INFO L226 Difference]: Without dead ends: 113 [2018-01-31 08:41:17,191 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:41:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-31 08:41:17,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2018-01-31 08:41:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-31 08:41:17,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2018-01-31 08:41:17,200 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 61 [2018-01-31 08:41:17,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:17,201 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2018-01-31 08:41:17,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:41:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2018-01-31 08:41:17,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 08:41:17,204 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:17,204 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2018-01-31 08:41:17,204 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:17,204 INFO L82 PathProgramCache]: Analyzing trace with hash 324897333, now seen corresponding path program 2 times [2018-01-31 08:41:17,204 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:17,205 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:17,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:17,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:17,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:17,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 37 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:41:17,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:17,516 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-31 08:41:17,521 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:41:17,534 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:17,553 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:17,556 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:41:17,560 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:41:17,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:17,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-01-31 08:41:17,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:41:17,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:41:17,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:41:17,747 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand 19 states. [2018-01-31 08:41:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:18,246 INFO L93 Difference]: Finished difference Result 214 states and 228 transitions. [2018-01-31 08:41:18,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:41:18,246 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-01-31 08:41:18,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:18,248 INFO L225 Difference]: With dead ends: 214 [2018-01-31 08:41:18,248 INFO L226 Difference]: Without dead ends: 152 [2018-01-31 08:41:18,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:41:18,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-31 08:41:18,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 133. [2018-01-31 08:41:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-31 08:41:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2018-01-31 08:41:18,263 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 69 [2018-01-31 08:41:18,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:18,264 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2018-01-31 08:41:18,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:41:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2018-01-31 08:41:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-31 08:41:18,266 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:18,266 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:18,266 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:18,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1411353499, now seen corresponding path program 1 times [2018-01-31 08:41:18,267 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:18,267 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:18,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:18,268 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:41:18,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:18,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-31 08:41:18,738 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:18,738 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-31 08:41:18,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:18,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:18,925 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 08:41:18,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:41:18,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2018-01-31 08:41:18,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:41:18,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:41:18,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:41:18,947 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 13 states. [2018-01-31 08:41:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:19,184 INFO L93 Difference]: Finished difference Result 226 states and 240 transitions. [2018-01-31 08:41:19,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:41:19,184 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2018-01-31 08:41:19,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:19,185 INFO L225 Difference]: With dead ends: 226 [2018-01-31 08:41:19,185 INFO L226 Difference]: Without dead ends: 158 [2018-01-31 08:41:19,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:41:19,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-31 08:41:19,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2018-01-31 08:41:19,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-31 08:41:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2018-01-31 08:41:19,199 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 70 [2018-01-31 08:41:19,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:19,200 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2018-01-31 08:41:19,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:41:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2018-01-31 08:41:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-01-31 08:41:19,204 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:19,204 INFO L351 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:19,204 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:19,205 INFO L82 PathProgramCache]: Analyzing trace with hash 134185155, now seen corresponding path program 3 times [2018-01-31 08:41:19,205 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:19,205 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:19,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:19,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:19,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:19,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 99 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-31 08:41:19,405 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:19,405 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-31 08:41:19,412 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:41:19,424 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:41:19,442 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:41:19,455 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:41:19,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 68 proven. 11 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-31 08:41:19,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:19,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-01-31 08:41:19,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:41:19,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:41:19,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:41:19,646 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand 19 states. [2018-01-31 08:41:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:20,794 INFO L93 Difference]: Finished difference Result 230 states and 239 transitions. [2018-01-31 08:41:20,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-31 08:41:20,794 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2018-01-31 08:41:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:20,795 INFO L225 Difference]: With dead ends: 230 [2018-01-31 08:41:20,795 INFO L226 Difference]: Without dead ends: 157 [2018-01-31 08:41:20,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=310, Invalid=1412, Unknown=0, NotChecked=0, Total=1722 [2018-01-31 08:41:20,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-31 08:41:20,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2018-01-31 08:41:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-31 08:41:20,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-01-31 08:41:20,808 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 98 [2018-01-31 08:41:20,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:20,809 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-01-31 08:41:20,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:41:20,809 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-01-31 08:41:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-31 08:41:20,810 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:20,810 INFO L351 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:20,811 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:20,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1058867732, now seen corresponding path program 2 times [2018-01-31 08:41:20,811 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:20,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:20,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:20,812 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:41:20,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:20,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:21,429 WARN L146 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 13 DAG size of output 9 [2018-01-31 08:41:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 88 proven. 17 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-01-31 08:41:21,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:21,537 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:41:21,542 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:41:21,553 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:21,564 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:21,566 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:41:21,570 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:21,580 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-31 08:41:21,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:21,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:21,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:41:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 88 proven. 17 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-01-31 08:41:21,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:21,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2018-01-31 08:41:21,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:41:21,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:41:21,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:41:21,760 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 11 states. [2018-01-31 08:41:22,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:22,205 INFO L93 Difference]: Finished difference Result 160 states and 165 transitions. [2018-01-31 08:41:22,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:41:22,218 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 108 [2018-01-31 08:41:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:22,219 INFO L225 Difference]: With dead ends: 160 [2018-01-31 08:41:22,219 INFO L226 Difference]: Without dead ends: 159 [2018-01-31 08:41:22,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 102 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:41:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-31 08:41:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2018-01-31 08:41:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-31 08:41:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 154 transitions. [2018-01-31 08:41:22,230 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 154 transitions. Word has length 108 [2018-01-31 08:41:22,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:22,230 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 154 transitions. [2018-01-31 08:41:22,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:41:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 154 transitions. [2018-01-31 08:41:22,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-01-31 08:41:22,232 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:22,232 INFO L351 BasicCegarLoop]: trace histogram [9, 7, 7, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:22,232 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:22,233 INFO L82 PathProgramCache]: Analyzing trace with hash 490350071, now seen corresponding path program 3 times [2018-01-31 08:41:22,233 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:22,233 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:22,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:22,234 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:41:22,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:22,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 139 proven. 6 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-01-31 08:41:22,595 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:22,595 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:41:22,602 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:41:22,613 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:41:22,618 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:41:22,619 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:41:22,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:22,626 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-31 08:41:22,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:22,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:22,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:41:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 139 proven. 6 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-01-31 08:41:23,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:23,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2018-01-31 08:41:23,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:41:23,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:41:23,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:41:23,049 INFO L87 Difference]: Start difference. First operand 149 states and 154 transitions. Second operand 21 states. [2018-01-31 08:41:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:23,425 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2018-01-31 08:41:23,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:41:23,425 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2018-01-31 08:41:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:23,426 INFO L225 Difference]: With dead ends: 149 [2018-01-31 08:41:23,426 INFO L226 Difference]: Without dead ends: 148 [2018-01-31 08:41:23,427 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=206, Invalid=606, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:41:23,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-31 08:41:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 128. [2018-01-31 08:41:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-31 08:41:23,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 131 transitions. [2018-01-31 08:41:23,435 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 131 transitions. Word has length 117 [2018-01-31 08:41:23,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:23,435 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 131 transitions. [2018-01-31 08:41:23,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:41:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2018-01-31 08:41:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-01-31 08:41:23,437 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:23,437 INFO L351 BasicCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:23,437 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:23,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1892081085, now seen corresponding path program 2 times [2018-01-31 08:41:23,437 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:23,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:23,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:23,438 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:41:23,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:23,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 76 proven. 15 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-31 08:41:24,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:24,138 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:41:24,143 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:41:24,154 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:24,154 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:41:24,157 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:24,187 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:41:24,189 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-31 08:41:24,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:24,191 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-31 08:41:24,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-31 08:41:24,387 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:41:24,388 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-31 08:41:24,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:24,389 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-31 08:41:24,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-31 08:41:24,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:41:24,436 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-31 08:41:24,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:24,437 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-31 08:41:24,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-31 08:41:24,509 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~3.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_~#mask~3.base| 0)) (= 0 (select |c_old(#valid)| |main_~#mask~3.base|)))) is different from true [2018-01-31 08:41:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-01-31 08:41:24,549 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:41:24,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2018-01-31 08:41:24,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 08:41:24,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 08:41:24,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=179, Unknown=1, NotChecked=26, Total=240 [2018-01-31 08:41:24,550 INFO L87 Difference]: Start difference. First operand 128 states and 131 transitions. Second operand 16 states. [2018-01-31 08:41:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:25,087 INFO L93 Difference]: Finished difference Result 202 states and 211 transitions. [2018-01-31 08:41:25,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 08:41:25,087 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2018-01-31 08:41:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:25,089 INFO L225 Difference]: With dead ends: 202 [2018-01-31 08:41:25,089 INFO L226 Difference]: Without dead ends: 138 [2018-01-31 08:41:25,090 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 109 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=1112, Unknown=1, NotChecked=70, Total=1406 [2018-01-31 08:41:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-31 08:41:25,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 129. [2018-01-31 08:41:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-31 08:41:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2018-01-31 08:41:25,099 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 117 [2018-01-31 08:41:25,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:25,100 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2018-01-31 08:41:25,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 08:41:25,100 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2018-01-31 08:41:25,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-01-31 08:41:25,102 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:25,102 INFO L351 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:25,102 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:25,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1724059608, now seen corresponding path program 1 times [2018-01-31 08:41:25,102 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:25,102 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:25,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:25,103 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:41:25,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:25,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-01-31 08:41:25,219 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:25,219 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:41:25,227 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:25,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 120 proven. 13 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-01-31 08:41:25,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:25,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14] total 17 [2018-01-31 08:41:25,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:41:25,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:41:25,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:41:25,416 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 17 states. [2018-01-31 08:41:25,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:25,769 INFO L93 Difference]: Finished difference Result 207 states and 213 transitions. [2018-01-31 08:41:25,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-31 08:41:25,769 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 128 [2018-01-31 08:41:25,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:25,770 INFO L225 Difference]: With dead ends: 207 [2018-01-31 08:41:25,770 INFO L226 Difference]: Without dead ends: 154 [2018-01-31 08:41:25,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 08:41:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-31 08:41:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 145. [2018-01-31 08:41:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-31 08:41:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2018-01-31 08:41:25,784 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 128 [2018-01-31 08:41:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:25,785 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-01-31 08:41:25,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:41:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2018-01-31 08:41:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-01-31 08:41:25,787 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:25,787 INFO L351 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-31 08:41:25,787 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:25,787 INFO L82 PathProgramCache]: Analyzing trace with hash -968519492, now seen corresponding path program 2 times [2018-01-31 08:41:25,787 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:25,787 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:25,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:25,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:25,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:25,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-01-31 08:41:25,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:25,953 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:41:25,958 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:41:25,968 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:25,983 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:25,985 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:41:25,987 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:26,064 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-01-31 08:41:26,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:26,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2018-01-31 08:41:26,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:41:26,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:41:26,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:41:26,084 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand 15 states. [2018-01-31 08:41:26,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:26,285 INFO L93 Difference]: Finished difference Result 183 states and 189 transitions. [2018-01-31 08:41:26,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 08:41:26,285 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 144 [2018-01-31 08:41:26,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:26,286 INFO L225 Difference]: With dead ends: 183 [2018-01-31 08:41:26,286 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 08:41:26,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:41:26,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 08:41:26,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 08:41:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 08:41:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 08:41:26,287 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 144 [2018-01-31 08:41:26,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:26,287 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 08:41:26,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:41:26,287 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 08:41:26,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 08:41:26,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 08:41:26,306 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:41:26,317 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:41:26,827 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 43 DAG size of output 1 [2018-01-31 08:41:27,247 WARN L146 SmtUtils]: Spent 419ms on a formula simplification. DAG size of input: 76 DAG size of output 51 [2018-01-31 08:41:27,310 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 37) no Hoare annotation was computed. [2018-01-31 08:41:27,310 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 37) no Hoare annotation was computed. [2018-01-31 08:41:27,310 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 37) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:41:27,310 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 37) no Hoare annotation was computed. [2018-01-31 08:41:27,310 INFO L399 ceAbstractionStarter]: For program point fooEXIT(lines 14 21) no Hoare annotation was computed. [2018-01-31 08:41:27,310 INFO L399 ceAbstractionStarter]: For program point L18'''(line 18) no Hoare annotation was computed. [2018-01-31 08:41:27,311 INFO L399 ceAbstractionStarter]: For program point L17'''''(line 17) no Hoare annotation was computed. [2018-01-31 08:41:27,311 INFO L399 ceAbstractionStarter]: For program point L17'''''''(lines 17 19) no Hoare annotation was computed. [2018-01-31 08:41:27,311 INFO L399 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 37) no Hoare annotation was computed. [2018-01-31 08:41:27,311 INFO L399 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 37) no Hoare annotation was computed. [2018-01-31 08:41:27,311 INFO L399 ceAbstractionStarter]: For program point L18''(line 18) no Hoare annotation was computed. [2018-01-31 08:41:27,311 INFO L399 ceAbstractionStarter]: For program point L17'(lines 17 19) no Hoare annotation was computed. [2018-01-31 08:41:27,311 INFO L399 ceAbstractionStarter]: For program point L17''''(line 17) no Hoare annotation was computed. [2018-01-31 08:41:27,311 INFO L399 ceAbstractionStarter]: For program point fooFINAL(lines 14 21) no Hoare annotation was computed. [2018-01-31 08:41:27,311 INFO L399 ceAbstractionStarter]: For program point L17'''(lines 17 19) no Hoare annotation was computed. [2018-01-31 08:41:27,311 INFO L402 ceAbstractionStarter]: At program point fooENTRY(lines 14 21) the Hoare annotation is: true [2018-01-31 08:41:27,311 INFO L399 ceAbstractionStarter]: For program point L14(lines 14 21) no Hoare annotation was computed. [2018-01-31 08:41:27,311 INFO L399 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-31 08:41:27,311 INFO L399 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-31 08:41:27,311 INFO L399 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-01-31 08:41:27,311 INFO L399 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-01-31 08:41:27,312 INFO L395 ceAbstractionStarter]: At program point L17''''''(lines 17 19) the Hoare annotation is: (let ((.cse0 (not (= 0 |foo_#in~b.offset|))) (.cse1 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse2 (not (= 32 (select |#length| |foo_#in~b.base|))))) (and (or .cse0 .cse1 (< 1 |foo_#in~size|) (and (<= foo_~size 1) (<= foo_~i~1 2)) .cse2) (let ((.cse3 (= (select |#length| foo_~b.base) 32)) (.cse4 (<= |foo_#in~size| foo_~size)) (.cse5 (= 1 (select |#valid| foo_~b.base))) (.cse6 (<= foo_~size 31)) (.cse7 (= foo_~b.offset 0))) (or (< 31 |foo_#in~size|) .cse0 .cse1 (and .cse3 .cse4 .cse5 .cse6 .cse7 (= foo_~i~1 0)) (and .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 foo_~i~1)) .cse2)) (or .cse0 (and (<= (+ foo_~i~1 |foo_#in~size|) (+ foo_~size 1)) (= foo_~size 0)) .cse1 (not (= 0 |foo_#in~size|)) .cse2))) [2018-01-31 08:41:27,312 INFO L399 ceAbstractionStarter]: For program point L18'(line 18) no Hoare annotation was computed. [2018-01-31 08:41:27,312 INFO L399 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 18) no Hoare annotation was computed. [2018-01-31 08:41:27,312 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 37) the Hoare annotation is: true [2018-01-31 08:41:27,312 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 37) no Hoare annotation was computed. [2018-01-31 08:41:27,312 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 37) the Hoare annotation is: true [2018-01-31 08:41:27,312 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 37) no Hoare annotation was computed. [2018-01-31 08:41:27,312 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 23 35) no Hoare annotation was computed. [2018-01-31 08:41:27,312 INFO L399 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 30) no Hoare annotation was computed. [2018-01-31 08:41:27,313 INFO L399 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-01-31 08:41:27,313 INFO L399 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-31 08:41:27,313 INFO L399 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-31 08:41:27,313 INFO L399 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2018-01-31 08:41:27,313 INFO L399 ceAbstractionStarter]: For program point L26''''''(lines 26 28) no Hoare annotation was computed. [2018-01-31 08:41:27,313 INFO L399 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-01-31 08:41:27,313 INFO L399 ceAbstractionStarter]: For program point L27''''(line 27) no Hoare annotation was computed. [2018-01-31 08:41:27,313 INFO L395 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3 (<= main_~i~3 31)) (and .cse0 .cse1 (= 0 main_~i~3) .cse2 .cse3))) [2018-01-31 08:41:27,313 INFO L399 ceAbstractionStarter]: For program point L27'''(line 27) no Hoare annotation was computed. [2018-01-31 08:41:27,313 INFO L399 ceAbstractionStarter]: For program point L29''''''(lines 29 33) no Hoare annotation was computed. [2018-01-31 08:41:27,313 INFO L399 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-31 08:41:27,313 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 23 35) no Hoare annotation was computed. [2018-01-31 08:41:27,313 INFO L399 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-31 08:41:27,313 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 23 35) no Hoare annotation was computed. [2018-01-31 08:41:27,314 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 23 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:41:27,314 INFO L399 ceAbstractionStarter]: For program point L29''''(line 29) no Hoare annotation was computed. [2018-01-31 08:41:27,314 INFO L399 ceAbstractionStarter]: For program point L26''(lines 26 28) no Hoare annotation was computed. [2018-01-31 08:41:27,314 INFO L399 ceAbstractionStarter]: For program point L26'''(line 26) no Hoare annotation was computed. [2018-01-31 08:41:27,314 INFO L399 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-01-31 08:41:27,314 INFO L399 ceAbstractionStarter]: For program point L25'''''(line 25) no Hoare annotation was computed. [2018-01-31 08:41:27,314 INFO L399 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 27) no Hoare annotation was computed. [2018-01-31 08:41:27,314 INFO L399 ceAbstractionStarter]: For program point L25'''(line 25) no Hoare annotation was computed. [2018-01-31 08:41:27,314 INFO L399 ceAbstractionStarter]: For program point L25'(line 25) no Hoare annotation was computed. [2018-01-31 08:41:27,314 INFO L399 ceAbstractionStarter]: For program point L29'''(line 29) no Hoare annotation was computed. [2018-01-31 08:41:27,314 INFO L399 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-01-31 08:41:27,314 INFO L399 ceAbstractionStarter]: For program point L26''''(line 26) no Hoare annotation was computed. [2018-01-31 08:41:27,314 INFO L399 ceAbstractionStarter]: For program point L25''(line 25) no Hoare annotation was computed. [2018-01-31 08:41:27,314 INFO L399 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-01-31 08:41:27,314 INFO L399 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-31 08:41:27,315 INFO L395 ceAbstractionStarter]: At program point L26'''''(lines 26 28) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-31 08:41:27,315 INFO L395 ceAbstractionStarter]: At program point L29'''''(lines 29 33) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-31 08:41:27,323 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,326 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,330 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,330 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,337 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,338 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,338 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,338 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,338 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,343 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,343 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,344 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,344 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,344 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,346 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,346 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,347 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,347 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:41:27 BoogieIcfgContainer [2018-01-31 08:41:27,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:41:27,354 INFO L168 Benchmark]: Toolchain (without parser) took 16258.73 ms. Allocated memory was 304.6 MB in the beginning and 596.6 MB in the end (delta: 292.0 MB). Free memory was 263.3 MB in the beginning and 431.3 MB in the end (delta: -168.0 MB). Peak memory consumption was 248.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:41:27,355 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.6 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:41:27,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.62 ms. Allocated memory is still 304.6 MB. Free memory was 261.3 MB in the beginning and 253.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:41:27,355 INFO L168 Benchmark]: Boogie Preprocessor took 43.39 ms. Allocated memory is still 304.6 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:41:27,356 INFO L168 Benchmark]: RCFGBuilder took 517.99 ms. Allocated memory is still 304.6 MB. Free memory was 251.4 MB in the beginning and 234.4 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:41:27,356 INFO L168 Benchmark]: TraceAbstraction took 15411.57 ms. Allocated memory was 304.6 MB in the beginning and 596.6 MB in the end (delta: 292.0 MB). Free memory was 234.4 MB in the beginning and 431.3 MB in the end (delta: -196.9 MB). Peak memory consumption was 219.3 MB. Max. memory is 5.3 GB. [2018-01-31 08:41:27,358 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.18 ms. Allocated memory is still 304.6 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 271.62 ms. Allocated memory is still 304.6 MB. Free memory was 261.3 MB in the beginning and 253.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.39 ms. Allocated memory is still 304.6 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 517.99 ms. Allocated memory is still 304.6 MB. Free memory was 251.4 MB in the beginning and 234.4 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 15411.57 ms. Allocated memory was 304.6 MB in the beginning and 596.6 MB in the end (delta: 292.0 MB). Free memory was 234.4 MB in the beginning and 431.3 MB in the end (delta: -196.9 MB). Peak memory consumption was 219.3 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 - 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: 18]: 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: 27]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 30]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant [2018-01-31 08:41:27,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((1 <= i && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) || ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - InvariantResult [Line: 17]: Loop Invariant [2018-01-31 08:41:27,366 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,366 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,366 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,366 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,366 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,369 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,369 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,369 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,369 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,370 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((!(0 == b) || !(\valid[b] == 1)) || 1 < \old(size)) || (size <= 1 && i <= 2)) || !(32 == unknown-#length-unknown[b])) && (((((31 < \old(size) || !(0 == b)) || !(\valid[b] == 1)) || (((((unknown-#length-unknown[b] == 32 && \old(size) <= size) && 1 == \valid[b]) && size <= 31) && b == 0) && i == 0)) || (((((unknown-#length-unknown[b] == 32 && \old(size) <= size) && 1 == \valid[b]) && size <= 31) && b == 0) && 1 <= i)) || !(32 == unknown-#length-unknown[b]))) && ((((!(0 == b) || (i + \old(size) <= size + 1 && size == 0)) || !(\valid[b] == 1)) || !(0 == \old(size))) || !(32 == unknown-#length-unknown[b])) - InvariantResult [Line: 29]: Loop Invariant [2018-01-31 08:41:27,371 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,371 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,372 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:41:27,372 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((1 <= i && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) || ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 6 error locations. SAFE Result, 15.3s OverallTime, 16 OverallIterations, 9 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 805 SDtfs, 1664 SDslu, 3959 SDs, 0 SdLazy, 2709 SolverSat, 218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1283 GetRequests, 973 SyntacticMatches, 21 SemanticMatches, 289 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 204 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 33 PreInvPairs, 60 NumberOfFragments, 281 HoareAnnotationTreeSize, 33 FomulaSimplifications, 1773 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 896 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2171 NumberOfCodeBlocks, 1963 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2143 ConstructedInterpolants, 181 QuantifiedInterpolants, 788392 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1716 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 28 InterpolantComputations, 8 PerfectInterpolantSequences, 2320/2510 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-41-27-378.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-41-27-378.csv Received shutdown request...