java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:17:01,891 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:17:01,893 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:17:01,910 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:17:01,911 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:17:01,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:17:01,913 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:17:01,915 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:17:01,917 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:17:01,918 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:17:01,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:17:01,919 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:17:01,920 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:17:01,922 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:17:01,923 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:17:01,925 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:17:01,928 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:17:01,930 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:17:01,931 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:17:01,933 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:17:01,935 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:17:01,935 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:17:01,935 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:17:01,937 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:17:01,937 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:17:01,939 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:17:01,939 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:17:01,940 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:17:01,940 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:17:01,940 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:17:01,941 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:17:01,941 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:17:01,951 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:17:01,951 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:17:01,952 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:17:01,952 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:17:01,953 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:17:01,953 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:17:01,953 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:17:01,954 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:17:01,954 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:17:01,954 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:17:01,954 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:17:01,954 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:17:01,954 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:17:01,955 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:17:01,955 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:17:01,955 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:17:01,955 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:17:01,955 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:17:01,956 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:17:01,956 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:17:01,956 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:17:01,956 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:17:01,956 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:17:01,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:17:01,957 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:17:01,957 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:17:01,957 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:17:01,957 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:17:01,957 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:17:01,958 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:17:01,958 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:17:01,958 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:17:01,959 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:17:01,959 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:17:01,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:17:02,008 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:17:02,012 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:17:02,014 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:17:02,014 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:17:02,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-01-24 12:17:02,145 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:17:02,149 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:17:02,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:17:02,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:17:02,156 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:17:02,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:17:02" (1/1) ... [2018-01-24 12:17:02,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b06dc45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:02, skipping insertion in model container [2018-01-24 12:17:02,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:17:02" (1/1) ... [2018-01-24 12:17:02,173 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:17:02,190 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:17:02,300 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:17:02,315 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:17:02,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:02 WrapperNode [2018-01-24 12:17:02,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:17:02,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:17:02,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:17:02,321 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:17:02,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:02" (1/1) ... [2018-01-24 12:17:02,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:02" (1/1) ... [2018-01-24 12:17:02,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:02" (1/1) ... [2018-01-24 12:17:02,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:02" (1/1) ... [2018-01-24 12:17:02,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:02" (1/1) ... [2018-01-24 12:17:02,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:02" (1/1) ... [2018-01-24 12:17:02,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:02" (1/1) ... [2018-01-24 12:17:02,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:17:02,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:17:02,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:17:02,356 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:17:02,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:02" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:17:02,404 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:17:02,404 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:17:02,404 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 12:17:02,404 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:17:02,404 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:17:02,405 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:17:02,405 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:17:02,405 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:17:02,405 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:17:02,405 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 12:17:02,405 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:17:02,406 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:17:02,406 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:17:02,591 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:17:02,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:17:02 BoogieIcfgContainer [2018-01-24 12:17:02,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:17:02,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:17:02,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:17:02,596 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:17:02,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:17:02" (1/3) ... [2018-01-24 12:17:02,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f185b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:17:02, skipping insertion in model container [2018-01-24 12:17:02,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:02" (2/3) ... [2018-01-24 12:17:02,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f185b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:17:02, skipping insertion in model container [2018-01-24 12:17:02,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:17:02" (3/3) ... [2018-01-24 12:17:02,601 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-01-24 12:17:02,610 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:17:02,618 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-24 12:17:02,656 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:17:02,656 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:17:02,657 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:17:02,657 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:17:02,657 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:17:02,657 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:17:02,657 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:17:02,657 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:17:02,658 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:17:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 12:17:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 12:17:02,681 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:02,683 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:02,683 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:02,687 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-01-24 12:17:02,689 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:02,690 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:02,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:02,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:02,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:02,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:02,855 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:02,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:17:02,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:17:02,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:17:02,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:17:02,877 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 12:17:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:02,956 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-01-24 12:17:02,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:17:02,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 12:17:02,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:02,964 INFO L225 Difference]: With dead ends: 101 [2018-01-24 12:17:02,964 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 12:17:02,967 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:17:03,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 12:17:03,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-01-24 12:17:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 12:17:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 12:17:03,062 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-01-24 12:17:03,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:03,062 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 12:17:03,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:17:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 12:17:03,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:17:03,063 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:03,063 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:03,063 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-01-24 12:17:03,063 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:03,063 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:03,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:03,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:03,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:03,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:03,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:03,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:17:03,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:17:03,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:17:03,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:17:03,170 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-01-24 12:17:03,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:03,280 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-01-24 12:17:03,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:17:03,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 12:17:03,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:03,282 INFO L225 Difference]: With dead ends: 95 [2018-01-24 12:17:03,282 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 12:17:03,284 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:03,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 12:17:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-01-24 12:17:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 12:17:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-24 12:17:03,291 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 16 [2018-01-24 12:17:03,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:03,291 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-24 12:17:03,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:17:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-24 12:17:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:17:03,293 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:03,293 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:03,293 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:03,293 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-01-24 12:17:03,293 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:03,294 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:03,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:03,295 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:03,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:03,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:03,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:03,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:17:03,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:17:03,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:17:03,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:17:03,394 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-01-24 12:17:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:03,552 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-01-24 12:17:03,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:17:03,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 12:17:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:03,554 INFO L225 Difference]: With dead ends: 57 [2018-01-24 12:17:03,554 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 12:17:03,555 INFO L525 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-24 12:17:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 12:17:03,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-01-24 12:17:03,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 12:17:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-01-24 12:17:03,562 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2018-01-24 12:17:03,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:03,563 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-01-24 12:17:03,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:17:03,563 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-01-24 12:17:03,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:17:03,564 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:03,564 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:03,564 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:03,564 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-01-24 12:17:03,564 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:03,564 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:03,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:03,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:03,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:03,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:03,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:03,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:17:03,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:17:03,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:17:03,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:17:03,623 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2018-01-24 12:17:03,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:03,707 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-01-24 12:17:03,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:17:03,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 12:17:03,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:03,708 INFO L225 Difference]: With dead ends: 53 [2018-01-24 12:17:03,708 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 12:17:03,709 INFO L525 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-24 12:17:03,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 12:17:03,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 12:17:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 12:17:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-24 12:17:03,714 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 17 [2018-01-24 12:17:03,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:03,714 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-24 12:17:03,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:17:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-24 12:17:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:17:03,715 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:03,715 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:03,715 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:03,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-01-24 12:17:03,715 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:03,715 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:03,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:03,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:03,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:03,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:03,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:03,796 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:03,804 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:03,834 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:03,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:03,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2018-01-24 12:17:03,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:17:03,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:17:03,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:17:03,893 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 10 states. [2018-01-24 12:17:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:04,176 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-01-24 12:17:04,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:17:04,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 12:17:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:04,178 INFO L225 Difference]: With dead ends: 103 [2018-01-24 12:17:04,178 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 12:17:04,179 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:17:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 12:17:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-01-24 12:17:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 12:17:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-24 12:17:04,189 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 22 [2018-01-24 12:17:04,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:04,190 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-24 12:17:04,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:17:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-24 12:17:04,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:17:04,191 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:04,191 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:04,191 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:04,191 INFO L82 PathProgramCache]: Analyzing trace with hash 180123030, now seen corresponding path program 1 times [2018-01-24 12:17:04,192 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:04,192 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:04,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:04,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:04,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:04,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:04,401 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:04,421 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:04,426 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:04,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:04,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:17:04,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:04,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:17:04,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:17:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:04,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:04,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-01-24 12:17:04,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:17:04,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:17:04,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:17:04,539 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 11 states. [2018-01-24 12:17:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:04,728 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-24 12:17:04,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:17:04,728 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-01-24 12:17:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:04,730 INFO L225 Difference]: With dead ends: 61 [2018-01-24 12:17:04,730 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 12:17:04,730 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:17:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 12:17:04,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-24 12:17:04,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 12:17:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-01-24 12:17:04,739 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 23 [2018-01-24 12:17:04,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:04,740 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-01-24 12:17:04,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:17:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-01-24 12:17:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 12:17:04,741 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:04,742 INFO L322 BasicCegarLoop]: trace histogram [4, 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-24 12:17:04,742 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:04,742 INFO L82 PathProgramCache]: Analyzing trace with hash 687601263, now seen corresponding path program 1 times [2018-01-24 12:17:04,742 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:04,743 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:04,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:04,744 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:04,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:04,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:04,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:04,895 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:04,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:04,924 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:05,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:05,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-01-24 12:17:05,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:17:05,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:17:05,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:17:05,014 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 12 states. [2018-01-24 12:17:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:05,186 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-01-24 12:17:05,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:17:05,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-01-24 12:17:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:05,187 INFO L225 Difference]: With dead ends: 122 [2018-01-24 12:17:05,187 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 12:17:05,188 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:17:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 12:17:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-01-24 12:17:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 12:17:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-01-24 12:17:05,196 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 41 [2018-01-24 12:17:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:05,197 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-01-24 12:17:05,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:17:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-01-24 12:17:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:17:05,199 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:05,199 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:05,199 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash 401816503, now seen corresponding path program 2 times [2018-01-24 12:17:05,199 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:05,199 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:05,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:05,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:05,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:05,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:05,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:05,607 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:05,619 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:17:05,631 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:05,640 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:05,642 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:05,645 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:05,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:05,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-01-24 12:17:05,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:17:05,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:17:05,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:17:05,767 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 14 states. [2018-01-24 12:17:05,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:05,921 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-01-24 12:17:05,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:17:05,922 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-01-24 12:17:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:05,923 INFO L225 Difference]: With dead ends: 134 [2018-01-24 12:17:05,923 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 12:17:05,924 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:17:05,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 12:17:05,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-01-24 12:17:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 12:17:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-01-24 12:17:05,932 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 47 [2018-01-24 12:17:05,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:05,933 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-01-24 12:17:05,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:17:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-01-24 12:17:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 12:17:05,934 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:05,934 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:05,934 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:05,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1604097281, now seen corresponding path program 3 times [2018-01-24 12:17:05,935 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:05,935 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:05,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:05,935 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:17:05,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:05,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 3 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:06,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:06,113 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:06,121 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:17:06,130 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:17:06,133 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:17:06,134 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:06,137 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:06,160 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-24 12:17:06,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:17:06,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2018-01-24 12:17:06,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:17:06,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:17:06,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:17:06,181 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 12 states. [2018-01-24 12:17:06,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:06,339 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2018-01-24 12:17:06,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:17:06,340 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-01-24 12:17:06,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:06,341 INFO L225 Difference]: With dead ends: 156 [2018-01-24 12:17:06,341 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 12:17:06,342 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:17:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 12:17:06,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2018-01-24 12:17:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 12:17:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-01-24 12:17:06,353 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 53 [2018-01-24 12:17:06,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:06,357 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-01-24 12:17:06,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:17:06,358 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-01-24 12:17:06,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-24 12:17:06,359 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:06,359 INFO L322 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 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-24 12:17:06,360 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:06,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1539416902, now seen corresponding path program 1 times [2018-01-24 12:17:06,360 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:06,360 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:06,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:06,361 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:17:06,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:06,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:06,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:06,567 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:06,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:06,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:06,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:06,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-01-24 12:17:06,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 12:17:06,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 12:17:06,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:17:06,737 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 18 states. [2018-01-24 12:17:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:07,019 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2018-01-24 12:17:07,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:17:07,019 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-01-24 12:17:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:07,020 INFO L225 Difference]: With dead ends: 151 [2018-01-24 12:17:07,020 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 12:17:07,021 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=471, Unknown=0, NotChecked=0, Total=650 [2018-01-24 12:17:07,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 12:17:07,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2018-01-24 12:17:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 12:17:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-01-24 12:17:07,028 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 67 [2018-01-24 12:17:07,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:07,028 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-01-24 12:17:07,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 12:17:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-01-24 12:17:07,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-24 12:17:07,029 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:07,030 INFO L322 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 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-24 12:17:07,030 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:07,030 INFO L82 PathProgramCache]: Analyzing trace with hash -330735986, now seen corresponding path program 2 times [2018-01-24 12:17:07,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:07,030 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:07,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:07,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:07,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:07,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:07,292 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 13 DAG size of output 12 [2018-01-24 12:17:07,425 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 13 DAG size of output 12 [2018-01-24 12:17:07,552 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 13 DAG size of output 12 [2018-01-24 12:17:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 2 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:07,702 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:07,702 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:07,720 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:17:07,729 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:07,730 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:07,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:07,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:07,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 12:17:07,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:07,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:17:07,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:17:07,893 WARN L1029 $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-24 12:17:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-01-24 12:17:07,943 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:17:07,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2018-01-24 12:17:07,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:17:07,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:17:07,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=129, Unknown=1, NotChecked=24, Total=210 [2018-01-24 12:17:07,944 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 15 states. [2018-01-24 12:17:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:08,314 INFO L93 Difference]: Finished difference Result 163 states and 171 transitions. [2018-01-24 12:17:08,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:17:08,314 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-01-24 12:17:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:08,314 INFO L225 Difference]: With dead ends: 163 [2018-01-24 12:17:08,314 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:17:08,315 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=187, Invalid=416, Unknown=1, NotChecked=46, Total=650 [2018-01-24 12:17:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:17:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:17:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:17:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:17:08,316 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2018-01-24 12:17:08,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:08,316 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:17:08,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:17:08,316 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:17:08,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:17:08,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:17:08,553 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 50 DAG size of output 34 [2018-01-24 12:17:08,619 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 34) no Hoare annotation was computed. [2018-01-24 12:17:08,619 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 34) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:17:08,619 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 34) no Hoare annotation was computed. [2018-01-24 12:17:08,619 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-01-24 12:17:08,619 INFO L401 ceAbstractionStarter]: For program point L15''''(lines 15 17) no Hoare annotation was computed. [2018-01-24 12:17:08,620 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-01-24 12:17:08,620 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 12 19) the Hoare annotation is: true [2018-01-24 12:17:08,620 INFO L401 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 34) no Hoare annotation was computed. [2018-01-24 12:17:08,620 INFO L397 ceAbstractionStarter]: At program point L15'''(lines 15 17) the Hoare annotation is: (let ((.cse2 (= foo_~size 32)) (.cse1 (select |#length| foo_~b.base)) (.cse0 (= 1 (select |#valid| foo_~b.base))) (.cse3 (= foo_~b.offset 0))) (or (not (= 0 |foo_#in~b.offset|)) (not (= (select |#valid| |foo_#in~b.base|) 1)) (and .cse0 (= .cse1 32) .cse2 .cse3 (<= 1 foo_~i~1)) (and .cse2 (= 32 .cse1) .cse0 .cse3 (= foo_~i~1 0)) (not (= 32 |foo_#in~size|)) (not (= 32 (select |#length| |foo_#in~b.base|))))) [2018-01-24 12:17:08,620 INFO L401 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-24 12:17:08,620 INFO L401 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2018-01-24 12:17:08,620 INFO L401 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 34) no Hoare annotation was computed. [2018-01-24 12:17:08,620 INFO L401 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-01-24 12:17:08,620 INFO L401 ceAbstractionStarter]: For program point L15''(lines 15 17) no Hoare annotation was computed. [2018-01-24 12:17:08,620 INFO L401 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-01-24 12:17:08,620 INFO L401 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 16) no Hoare annotation was computed. [2018-01-24 12:17:08,621 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 34) the Hoare annotation is: true [2018-01-24 12:17:08,621 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 34) no Hoare annotation was computed. [2018-01-24 12:17:08,621 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 34) the Hoare annotation is: true [2018-01-24 12:17:08,621 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 34) no Hoare annotation was computed. [2018-01-24 12:17:08,621 INFO L401 ceAbstractionStarter]: For program point L28''''(lines 28 32) no Hoare annotation was computed. [2018-01-24 12:17:08,621 INFO L401 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 26) no Hoare annotation was computed. [2018-01-24 12:17:08,621 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 21 34) no Hoare annotation was computed. [2018-01-24 12:17:08,621 INFO L401 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 29) no Hoare annotation was computed. [2018-01-24 12:17:08,621 INFO L401 ceAbstractionStarter]: For program point L25(lines 25 27) no Hoare annotation was computed. [2018-01-24 12:17:08,622 INFO L401 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-24 12:17:08,622 INFO L401 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-24 12:17:08,622 INFO L397 ceAbstractionStarter]: At program point L25'''(lines 25 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) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-24 12:17:08,622 INFO L401 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-01-24 12:17:08,622 INFO L401 ceAbstractionStarter]: For program point L28(lines 28 32) no Hoare annotation was computed. [2018-01-24 12:17:08,622 INFO L401 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-01-24 12:17:08,622 INFO L401 ceAbstractionStarter]: For program point L29'(lines 29 31) no Hoare annotation was computed. [2018-01-24 12:17:08,622 INFO L401 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-01-24 12:17:08,622 INFO L401 ceAbstractionStarter]: For program point L25''''(lines 25 27) no Hoare annotation was computed. [2018-01-24 12:17:08,622 INFO L401 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-24 12:17:08,622 INFO L401 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-01-24 12:17:08,623 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 21 34) no Hoare annotation was computed. [2018-01-24 12:17:08,623 INFO L401 ceAbstractionStarter]: For program point L25''(lines 25 27) no Hoare annotation was computed. [2018-01-24 12:17:08,623 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 21 34) no Hoare annotation was computed. [2018-01-24 12:17:08,623 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 21 34) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:17:08,623 INFO L401 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-01-24 12:17:08,623 INFO L397 ceAbstractionStarter]: At program point L26'(line 26) the Hoare annotation is: (and (= 32 (select |#length| |main_~#mask~3.base|)) (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|) (<= 0 main_~i~3) (= 0 (select |old(#valid)| |main_~#mask~3.base|)) (= 0 |main_~#mask~3.offset|)) [2018-01-24 12:17:08,623 INFO L401 ceAbstractionStarter]: For program point L28''(lines 28 32) no Hoare annotation was computed. [2018-01-24 12:17:08,624 INFO L401 ceAbstractionStarter]: For program point L26''(line 26) no Hoare annotation was computed. [2018-01-24 12:17:08,624 INFO L401 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-01-24 12:17:08,624 INFO L397 ceAbstractionStarter]: At program point L28'''(lines 28 32) 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-24 12:17:08,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,632 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,633 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,635 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,635 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,636 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:17:08 BoogieIcfgContainer [2018-01-24 12:17:08,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:17:08,650 INFO L168 Benchmark]: Toolchain (without parser) took 6504.22 ms. Allocated memory was 309.3 MB in the beginning and 543.2 MB in the end (delta: 233.8 MB). Free memory was 270.4 MB in the beginning and 515.1 MB in the end (delta: -244.7 MB). Peak memory consumption was 170.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:08,651 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 309.3 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:17:08,652 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.50 ms. Allocated memory is still 309.3 MB. Free memory was 269.4 MB in the beginning and 261.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:08,652 INFO L168 Benchmark]: Boogie Preprocessor took 33.67 ms. Allocated memory is still 309.3 MB. Free memory was 261.3 MB in the beginning and 259.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:08,652 INFO L168 Benchmark]: RCFGBuilder took 237.20 ms. Allocated memory is still 309.3 MB. Free memory was 259.3 MB in the beginning and 243.8 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:08,653 INFO L168 Benchmark]: TraceAbstraction took 6055.10 ms. Allocated memory was 309.3 MB in the beginning and 543.2 MB in the end (delta: 233.8 MB). Free memory was 243.8 MB in the beginning and 515.1 MB in the end (delta: -271.3 MB). Peak memory consumption was 144.2 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:08,654 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 309.3 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 171.50 ms. Allocated memory is still 309.3 MB. Free memory was 269.4 MB in the beginning and 261.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.67 ms. Allocated memory is still 309.3 MB. Free memory was 261.3 MB in the beginning and 259.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 237.20 ms. Allocated memory is still 309.3 MB. Free memory was 259.3 MB in the beginning and 243.8 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6055.10 ms. Allocated memory was 309.3 MB in the beginning and 543.2 MB in the end (delta: 233.8 MB). Free memory was 243.8 MB in the beginning and 515.1 MB in the end (delta: -271.3 MB). Peak memory consumption was 144.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: 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: 26]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 29]: 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: 28]: Loop Invariant [2018-01-24 12:17:08,659 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,659 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,660 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,660 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: 15]: Loop Invariant [2018-01-24 12:17:08,662 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,662 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,662 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,663 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,664 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,664 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(0 == b) || !(\valid[b] == 1)) || ((((1 == \valid[b] && unknown-#length-unknown[b] == 32) && size == 32) && b == 0) && 1 <= i)) || ((((size == 32 && 32 == unknown-#length-unknown[b]) && 1 == \valid[b]) && b == 0) && i == 0)) || !(32 == \old(size))) || !(32 == unknown-#length-unknown[b]) - InvariantResult [Line: 25]: Loop Invariant [2018-01-24 12:17:08,665 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,665 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,666 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:08,666 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, 46 locations, 6 error locations. SAFE Result, 5.9s OverallTime, 11 OverallIterations, 8 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 404 SDtfs, 609 SDslu, 2144 SDs, 0 SdLazy, 893 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 436 GetRequests, 304 SyntacticMatches, 2 SemanticMatches, 130 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 49 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 25 PreInvPairs, 38 NumberOfFragments, 188 HoareAnnotationTreeSize, 25 FomulaSimplifications, 445 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 229 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 713 NumberOfCodeBlocks, 629 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 695 ConstructedInterpolants, 50 QuantifiedInterpolants, 241837 SizeOfPredicates, 9 NumberOfNonLiveVariables, 629 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 238/800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-17-08-671.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-17-08-671.csv Received shutdown request...