java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:17:38,992 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:17:38,993 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:17:39,009 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:17:39,009 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:17:39,010 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:17:39,011 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:17:39,013 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:17:39,015 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:17:39,016 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:17:39,017 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:17:39,017 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:17:39,018 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:17:39,019 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:17:39,020 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:17:39,023 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:17:39,025 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:17:39,027 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:17:39,028 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:17:39,030 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:17:39,032 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:17:39,032 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:17:39,033 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:17:39,034 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:17:39,035 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:17:39,036 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:17:39,036 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:17:39,037 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:17:39,037 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:17:39,037 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:17:39,038 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:17:39,038 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 22:17:39,047 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:17:39,047 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:17:39,048 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:17:39,048 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:17:39,048 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:17:39,049 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:17:39,049 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:17:39,049 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:17:39,049 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:17:39,050 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:17:39,050 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:17:39,050 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:17:39,050 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:17:39,050 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:17:39,050 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:17:39,050 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:17:39,050 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:17:39,051 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:17:39,051 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:17:39,051 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:17:39,051 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:17:39,051 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:17:39,051 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:17:39,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:17:39,052 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:17:39,052 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:17:39,052 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:17:39,052 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:17:39,052 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:17:39,053 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:17:39,053 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:17:39,053 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:17:39,054 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:17:39,054 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:17:39,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:17:39,099 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:17:39,103 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:17:39,104 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:17:39,105 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:17:39,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-01-28 22:17:39,211 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:17:39,217 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:17:39,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:17:39,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:17:39,223 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:17:39,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:17:39" (1/1) ... [2018-01-28 22:17:39,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9ff68e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:17:39, skipping insertion in model container [2018-01-28 22:17:39,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:17:39" (1/1) ... [2018-01-28 22:17:39,240 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:17:39,254 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:17:39,369 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:17:39,384 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:17:39,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:17:39 WrapperNode [2018-01-28 22:17:39,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:17:39,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:17:39,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:17:39,392 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:17:39,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:17:39" (1/1) ... [2018-01-28 22:17:39,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:17:39" (1/1) ... [2018-01-28 22:17:39,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:17:39" (1/1) ... [2018-01-28 22:17:39,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:17:39" (1/1) ... [2018-01-28 22:17:39,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:17:39" (1/1) ... [2018-01-28 22:17:39,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:17:39" (1/1) ... [2018-01-28 22:17:39,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:17:39" (1/1) ... [2018-01-28 22:17:39,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:17:39,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:17:39,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:17:39,424 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:17:39,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:17:39" (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-28 22:17:39,470 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:17:39,470 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:17:39,470 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-28 22:17:39,470 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:17:39,470 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 22:17:39,470 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 22:17:39,470 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:17:39,470 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:17:39,471 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:17:39,471 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-28 22:17:39,471 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:17:39,471 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:17:39,471 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:17:39,664 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:17:39,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:17:39 BoogieIcfgContainer [2018-01-28 22:17:39,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:17:39,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:17:39,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:17:39,669 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:17:39,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:17:39" (1/3) ... [2018-01-28 22:17:39,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8f6f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:17:39, skipping insertion in model container [2018-01-28 22:17:39,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:17:39" (2/3) ... [2018-01-28 22:17:39,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8f6f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:17:39, skipping insertion in model container [2018-01-28 22:17:39,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:17:39" (3/3) ... [2018-01-28 22:17:39,673 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-01-28 22:17:39,681 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:17:39,686 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-01-28 22:17:39,730 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:17:39,730 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:17:39,730 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:17:39,731 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:17:39,731 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:17:39,731 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:17:39,731 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:17:39,731 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:17:39,732 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:17:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-28 22:17:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-28 22:17:39,753 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:39,754 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:39,754 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:39,760 INFO L82 PathProgramCache]: Analyzing trace with hash 514068382, now seen corresponding path program 1 times [2018-01-28 22:17:39,762 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:39,763 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:39,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:39,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:39,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:39,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:39,897 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-28 22:17:39,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:17:39,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:17:39,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-28 22:17:39,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-28 22:17:39,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-28 22:17:39,915 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-01-28 22:17:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:39,943 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-01-28 22:17:39,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-28 22:17:39,944 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-28 22:17:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:39,952 INFO L225 Difference]: With dead ends: 119 [2018-01-28 22:17:39,952 INFO L226 Difference]: Without dead ends: 61 [2018-01-28 22:17:39,955 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-28 22:17:39,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-28 22:17:39,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-28 22:17:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-28 22:17:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-01-28 22:17:39,986 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 14 [2018-01-28 22:17:39,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:39,987 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-01-28 22:17:39,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-28 22:17:39,987 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-01-28 22:17:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 22:17:39,988 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:39,988 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:39,988 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:39,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1745345203, now seen corresponding path program 1 times [2018-01-28 22:17:39,988 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:39,988 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:39,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:39,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:39,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:40,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:40,053 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-28 22:17:40,053 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:17:40,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:17:40,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:17:40,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:17:40,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:17:40,055 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 3 states. [2018-01-28 22:17:40,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:40,154 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-01-28 22:17:40,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:17:40,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-28 22:17:40,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:40,159 INFO L225 Difference]: With dead ends: 106 [2018-01-28 22:17:40,220 INFO L226 Difference]: Without dead ends: 86 [2018-01-28 22:17:40,221 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:17:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-28 22:17:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 65. [2018-01-28 22:17:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-28 22:17:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-01-28 22:17:40,236 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 15 [2018-01-28 22:17:40,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:40,236 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-01-28 22:17:40,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:17:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-01-28 22:17:40,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-28 22:17:40,237 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:40,237 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:40,237 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:40,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1619552690, now seen corresponding path program 1 times [2018-01-28 22:17:40,238 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:40,238 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:40,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:40,239 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:40,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:40,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:40,377 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-28 22:17:40,378 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:17:40,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:17:40,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:17:40,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:17:40,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:17:40,379 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 6 states. [2018-01-28 22:17:40,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:40,529 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2018-01-28 22:17:40,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:17:40,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-28 22:17:40,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:40,531 INFO L225 Difference]: With dead ends: 151 [2018-01-28 22:17:40,531 INFO L226 Difference]: Without dead ends: 97 [2018-01-28 22:17:40,532 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:17:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-28 22:17:40,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 77. [2018-01-28 22:17:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-28 22:17:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-01-28 22:17:40,542 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 21 [2018-01-28 22:17:40,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:40,542 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-01-28 22:17:40,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:17:40,543 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-01-28 22:17:40,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 22:17:40,544 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:40,544 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:40,544 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:40,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1332993157, now seen corresponding path program 1 times [2018-01-28 22:17:40,545 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:40,545 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:40,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:40,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:40,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:40,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:40,591 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-28 22:17:40,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:17:40,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:17:40,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:17:40,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:17:40,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:17:40,593 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 3 states. [2018-01-28 22:17:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:40,634 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-01-28 22:17:40,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:17:40,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-28 22:17:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:40,638 INFO L225 Difference]: With dead ends: 77 [2018-01-28 22:17:40,638 INFO L226 Difference]: Without dead ends: 75 [2018-01-28 22:17:40,638 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:17:40,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-28 22:17:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-28 22:17:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-28 22:17:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-01-28 22:17:40,645 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 25 [2018-01-28 22:17:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:40,645 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-01-28 22:17:40,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:17:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-01-28 22:17:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 22:17:40,646 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:40,646 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:40,646 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:40,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1332993158, now seen corresponding path program 1 times [2018-01-28 22:17:40,646 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:40,646 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:40,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:40,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:40,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:40,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:40,748 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-28 22:17:40,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:17:40,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:17:40,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:17:40,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:17:40,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:17:40,750 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 4 states. [2018-01-28 22:17:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:40,865 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-01-28 22:17:40,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:17:40,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-28 22:17:40,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:40,867 INFO L225 Difference]: With dead ends: 91 [2018-01-28 22:17:40,867 INFO L226 Difference]: Without dead ends: 89 [2018-01-28 22:17:40,868 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:17:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-28 22:17:40,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-01-28 22:17:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-28 22:17:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-01-28 22:17:40,876 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 25 [2018-01-28 22:17:40,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:40,877 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-01-28 22:17:40,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:17:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-01-28 22:17:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 22:17:40,878 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:40,879 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:40,879 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:40,879 INFO L82 PathProgramCache]: Analyzing trace with hash 852385009, now seen corresponding path program 1 times [2018-01-28 22:17:40,879 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:40,879 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:40,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:40,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:40,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:40,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 22:17:41,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:17:41,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:17:41,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:17:41,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:17:41,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:17:41,014 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 7 states. [2018-01-28 22:17:41,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:41,154 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-01-28 22:17:41,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:17:41,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-28 22:17:41,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:41,157 INFO L225 Difference]: With dead ends: 92 [2018-01-28 22:17:41,157 INFO L226 Difference]: Without dead ends: 91 [2018-01-28 22:17:41,157 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:17:41,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-28 22:17:41,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2018-01-28 22:17:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-28 22:17:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-01-28 22:17:41,167 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 41 [2018-01-28 22:17:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:41,168 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-01-28 22:17:41,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:17:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-01-28 22:17:41,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 22:17:41,169 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:41,170 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:41,170 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:41,170 INFO L82 PathProgramCache]: Analyzing trace with hash 654131555, now seen corresponding path program 1 times [2018-01-28 22:17:41,170 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:41,170 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:41,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:41,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:41,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:41,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:17:41,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:17:41,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:17:41,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:17:41,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:17:41,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:17:41,257 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 5 states. [2018-01-28 22:17:41,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:41,329 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-01-28 22:17:41,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:17:41,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-28 22:17:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:41,331 INFO L225 Difference]: With dead ends: 81 [2018-01-28 22:17:41,331 INFO L226 Difference]: Without dead ends: 80 [2018-01-28 22:17:41,331 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:17:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-28 22:17:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-28 22:17:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-28 22:17:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-01-28 22:17:41,340 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 42 [2018-01-28 22:17:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:41,341 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-01-28 22:17:41,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:17:41,341 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-01-28 22:17:41,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 22:17:41,342 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:41,342 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:41,343 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:41,343 INFO L82 PathProgramCache]: Analyzing trace with hash 654131556, now seen corresponding path program 1 times [2018-01-28 22:17:41,343 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:41,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:41,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:41,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:41,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:41,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 22:17:41,481 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:17:41,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:17:41,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:17:41,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:17:41,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:17:41,482 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 6 states. [2018-01-28 22:17:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:41,560 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-01-28 22:17:41,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:17:41,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-28 22:17:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:41,562 INFO L225 Difference]: With dead ends: 89 [2018-01-28 22:17:41,562 INFO L226 Difference]: Without dead ends: 88 [2018-01-28 22:17:41,562 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:17:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-28 22:17:41,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-01-28 22:17:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-28 22:17:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-01-28 22:17:41,568 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 42 [2018-01-28 22:17:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:41,568 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-01-28 22:17:41,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:17:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-01-28 22:17:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 22:17:41,569 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:41,570 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:41,570 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:41,570 INFO L82 PathProgramCache]: Analyzing trace with hash -737235937, now seen corresponding path program 1 times [2018-01-28 22:17:41,570 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:41,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:41,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:41,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:41,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:41,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:17:41,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:17:41,633 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-28 22:17:41,640 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:41,689 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:17:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:17:41,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:17:41,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-01-28 22:17:41,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:17:41,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:17:41,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:17:41,744 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 7 states. [2018-01-28 22:17:41,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:41,836 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-01-28 22:17:41,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:17:41,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-28 22:17:41,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:41,837 INFO L225 Difference]: With dead ends: 126 [2018-01-28 22:17:41,838 INFO L226 Difference]: Without dead ends: 104 [2018-01-28 22:17:41,838 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:17:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-28 22:17:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2018-01-28 22:17:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-28 22:17:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-01-28 22:17:41,846 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 41 [2018-01-28 22:17:41,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:41,846 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-01-28 22:17:41,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:17:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-01-28 22:17:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 22:17:41,847 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:41,847 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:41,847 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:41,847 INFO L82 PathProgramCache]: Analyzing trace with hash 921737641, now seen corresponding path program 1 times [2018-01-28 22:17:41,847 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:41,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:41,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:41,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:41,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:41,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 22:17:41,980 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:17:41,980 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-28 22:17:41,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:42,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:17:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 22:17:42,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:17:42,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 12 [2018-01-28 22:17:42,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 22:17:42,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 22:17:42,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:17:42,169 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 12 states. [2018-01-28 22:17:42,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:42,681 INFO L93 Difference]: Finished difference Result 162 states and 169 transitions. [2018-01-28 22:17:42,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 22:17:42,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-01-28 22:17:42,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:42,684 INFO L225 Difference]: With dead ends: 162 [2018-01-28 22:17:42,684 INFO L226 Difference]: Without dead ends: 103 [2018-01-28 22:17:42,685 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:17:42,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-28 22:17:42,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-01-28 22:17:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-28 22:17:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2018-01-28 22:17:42,693 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 45 [2018-01-28 22:17:42,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:42,693 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2018-01-28 22:17:42,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 22:17:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-01-28 22:17:42,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 22:17:42,694 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:42,694 INFO L330 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:42,695 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:42,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1964423637, now seen corresponding path program 1 times [2018-01-28 22:17:42,695 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:42,695 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:42,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:42,696 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:42,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:42,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:17:42,793 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:17:42,793 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-28 22:17:42,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:42,839 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:17:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:17:42,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:17:42,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-01-28 22:17:42,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-28 22:17:42,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-28 22:17:42,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:17:42,945 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 15 states. [2018-01-28 22:17:43,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:43,113 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-01-28 22:17:43,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 22:17:43,114 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-01-28 22:17:43,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:43,115 INFO L225 Difference]: With dead ends: 180 [2018-01-28 22:17:43,115 INFO L226 Difference]: Without dead ends: 124 [2018-01-28 22:17:43,116 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2018-01-28 22:17:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-28 22:17:43,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2018-01-28 22:17:43,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-28 22:17:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2018-01-28 22:17:43,123 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 50 [2018-01-28 22:17:43,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:43,124 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2018-01-28 22:17:43,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-28 22:17:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-01-28 22:17:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-28 22:17:43,125 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:43,125 INFO L330 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:43,125 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:43,126 INFO L82 PathProgramCache]: Analyzing trace with hash 842523789, now seen corresponding path program 1 times [2018-01-28 22:17:43,126 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:43,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:43,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:43,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:43,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:43,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-28 22:17:43,235 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:17:43,235 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-28 22:17:43,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:43,267 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:17:43,294 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-28 22:17:43,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:17:43,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:17:43,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 22:17:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-28 22:17:43,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:17:43,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-01-28 22:17:43,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:17:43,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:17:43,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:17:43,447 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 9 states. [2018-01-28 22:17:43,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:43,661 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2018-01-28 22:17:43,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:17:43,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-01-28 22:17:43,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:43,663 INFO L225 Difference]: With dead ends: 122 [2018-01-28 22:17:43,663 INFO L226 Difference]: Without dead ends: 121 [2018-01-28 22:17:43,664 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:17:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-28 22:17:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 110. [2018-01-28 22:17:43,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-28 22:17:43,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-01-28 22:17:43,671 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 54 [2018-01-28 22:17:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:43,671 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-01-28 22:17:43,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:17:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-01-28 22:17:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-28 22:17:43,673 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:43,673 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:43,673 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:43,674 INFO L82 PathProgramCache]: Analyzing trace with hash 845661734, now seen corresponding path program 1 times [2018-01-28 22:17:43,674 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:43,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:43,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:43,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:43,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:43,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-28 22:17:43,760 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:17:43,760 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-28 22:17:43,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:43,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:17:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-28 22:17:43,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:17:43,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-28 22:17:43,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:17:43,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:17:43,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:17:43,865 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 9 states. [2018-01-28 22:17:43,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:43,967 INFO L93 Difference]: Finished difference Result 155 states and 161 transitions. [2018-01-28 22:17:44,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:17:44,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-01-28 22:17:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:44,004 INFO L225 Difference]: With dead ends: 155 [2018-01-28 22:17:44,004 INFO L226 Difference]: Without dead ends: 133 [2018-01-28 22:17:44,004 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:17:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-28 22:17:44,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 116. [2018-01-28 22:17:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-28 22:17:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-01-28 22:17:44,012 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 70 [2018-01-28 22:17:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:44,012 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-01-28 22:17:44,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:17:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-01-28 22:17:44,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-28 22:17:44,013 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:44,013 INFO L330 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:44,014 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:44,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1314715566, now seen corresponding path program 2 times [2018-01-28 22:17:44,014 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:44,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:44,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:44,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:44,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:44,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-28 22:17:44,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:17:44,211 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-28 22:17:44,217 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:17:44,227 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:17:44,235 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:17:44,237 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:17:44,241 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:17:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-28 22:17:44,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:17:44,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-01-28 22:17:44,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-28 22:17:44,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-28 22:17:44,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-01-28 22:17:44,425 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 18 states. [2018-01-28 22:17:44,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:44,898 INFO L93 Difference]: Finished difference Result 138 states and 141 transitions. [2018-01-28 22:17:44,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 22:17:44,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2018-01-28 22:17:44,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:44,899 INFO L225 Difference]: With dead ends: 138 [2018-01-28 22:17:44,899 INFO L226 Difference]: Without dead ends: 137 [2018-01-28 22:17:44,900 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2018-01-28 22:17:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-28 22:17:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2018-01-28 22:17:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-28 22:17:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2018-01-28 22:17:44,909 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 79 [2018-01-28 22:17:44,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:44,909 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2018-01-28 22:17:44,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-28 22:17:44,910 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2018-01-28 22:17:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-28 22:17:44,911 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:44,911 INFO L330 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:44,911 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:44,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2101476935, now seen corresponding path program 1 times [2018-01-28 22:17:44,911 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:44,912 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:44,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:44,913 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:17:44,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:44,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:45,098 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-28 22:17:45,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:17:45,098 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-28 22:17:45,103 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:45,126 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:17:45,129 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-28 22:17:45,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:17:45,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:17:45,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 22:17:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-28 22:17:45,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:17:45,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-01-28 22:17:45,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:17:45,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:17:45,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:17:45,243 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand 9 states. [2018-01-28 22:17:45,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:45,343 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-01-28 22:17:45,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:17:45,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-01-28 22:17:45,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:45,344 INFO L225 Difference]: With dead ends: 132 [2018-01-28 22:17:45,345 INFO L226 Difference]: Without dead ends: 131 [2018-01-28 22:17:45,345 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:17:45,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-28 22:17:45,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 124. [2018-01-28 22:17:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-28 22:17:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2018-01-28 22:17:45,354 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 80 [2018-01-28 22:17:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:45,355 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2018-01-28 22:17:45,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:17:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2018-01-28 22:17:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-28 22:17:45,356 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:45,356 INFO L330 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:45,356 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:45,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1611238886, now seen corresponding path program 2 times [2018-01-28 22:17:45,356 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:45,356 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:45,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:45,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:45,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:45,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 39 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-28 22:17:45,562 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:17:45,562 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:17:45,576 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:17:45,589 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:17:45,601 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:17:45,604 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:17:45,607 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:17:45,688 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-28 22:17:45,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:17:45,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-01-28 22:17:45,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 22:17:45,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 22:17:45,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:17:45,710 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand 17 states. [2018-01-28 22:17:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:46,033 INFO L93 Difference]: Finished difference Result 207 states and 214 transitions. [2018-01-28 22:17:46,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 22:17:46,034 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 83 [2018-01-28 22:17:46,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:46,035 INFO L225 Difference]: With dead ends: 207 [2018-01-28 22:17:46,035 INFO L226 Difference]: Without dead ends: 140 [2018-01-28 22:17:46,036 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-01-28 22:17:46,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-28 22:17:46,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 124. [2018-01-28 22:17:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-28 22:17:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions. [2018-01-28 22:17:46,047 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 83 [2018-01-28 22:17:46,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:46,050 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 127 transitions. [2018-01-28 22:17:46,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 22:17:46,051 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2018-01-28 22:17:46,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-28 22:17:46,052 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:46,052 INFO L330 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:46,052 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:46,052 INFO L82 PathProgramCache]: Analyzing trace with hash 808358781, now seen corresponding path program 2 times [2018-01-28 22:17:46,052 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:46,053 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:46,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:46,053 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:17:46,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:46,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 53 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-28 22:17:46,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:17:46,191 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:17:46,199 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:17:46,210 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:17:46,218 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:17:46,220 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:17:46,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:17:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 63 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-28 22:17:46,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:17:46,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-01-28 22:17:46,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 22:17:46,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 22:17:46,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-01-28 22:17:46,343 INFO L87 Difference]: Start difference. First operand 124 states and 127 transitions. Second operand 21 states. [2018-01-28 22:17:46,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:46,605 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2018-01-28 22:17:46,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 22:17:46,605 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 89 [2018-01-28 22:17:46,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:46,606 INFO L225 Difference]: With dead ends: 234 [2018-01-28 22:17:46,606 INFO L226 Difference]: Without dead ends: 170 [2018-01-28 22:17:46,607 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2018-01-28 22:17:46,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-28 22:17:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 154. [2018-01-28 22:17:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-28 22:17:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 157 transitions. [2018-01-28 22:17:46,615 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 157 transitions. Word has length 89 [2018-01-28 22:17:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:46,615 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 157 transitions. [2018-01-28 22:17:46,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 22:17:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 157 transitions. [2018-01-28 22:17:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-28 22:17:46,616 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:46,616 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:46,616 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:46,616 INFO L82 PathProgramCache]: Analyzing trace with hash -110009104, now seen corresponding path program 3 times [2018-01-28 22:17:46,616 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:46,616 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:46,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:46,617 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:17:46,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:46,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-01-28 22:17:46,760 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:17:46,760 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:17:46,765 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 22:17:46,777 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:17:46,782 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:17:46,783 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:17:46,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:17:46,788 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-28 22:17:46,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:17:46,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:17:46,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 22:17:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 11 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-01-28 22:17:47,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:17:47,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-01-28 22:17:47,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-28 22:17:47,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-28 22:17:47,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-01-28 22:17:47,101 INFO L87 Difference]: Start difference. First operand 154 states and 157 transitions. Second operand 18 states. [2018-01-28 22:17:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:47,579 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2018-01-28 22:17:47,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-28 22:17:47,580 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 92 [2018-01-28 22:17:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:47,580 INFO L225 Difference]: With dead ends: 167 [2018-01-28 22:17:47,581 INFO L226 Difference]: Without dead ends: 166 [2018-01-28 22:17:47,581 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2018-01-28 22:17:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-28 22:17:47,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 153. [2018-01-28 22:17:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-28 22:17:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 156 transitions. [2018-01-28 22:17:47,589 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 156 transitions. Word has length 92 [2018-01-28 22:17:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:47,590 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 156 transitions. [2018-01-28 22:17:47,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-28 22:17:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 156 transitions. [2018-01-28 22:17:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-28 22:17:47,590 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:47,590 INFO L330 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:47,591 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:47,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2007883639, now seen corresponding path program 2 times [2018-01-28 22:17:47,591 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:47,591 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:47,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:47,592 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:17:47,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:47,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-28 22:17:47,809 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:17:47,809 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:17:47,815 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:17:47,826 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:17:47,832 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:17:47,835 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:17:47,912 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:17:47,915 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-28 22:17:47,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:17:47,917 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-28 22:17:47,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-28 22:17:47,957 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:17:47,961 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-28 22:17:47,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:17:47,965 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-28 22:17:47,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-28 22:17:47,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:17:47,995 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-28 22:17:47,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:17:47,997 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-28 22:17:47,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-28 22:17:48,028 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#b~3.base| Int)) (and (= (store |c_old(#valid)| |main_~#b~3.base| 0) |c_#valid|) (= 0 (select |c_old(#valid)| |main_~#b~3.base|)))) is different from true [2018-01-28 22:17:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-01-28 22:17:48,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:17:48,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2018-01-28 22:17:48,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:17:48,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:17:48,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2018-01-28 22:17:48,064 INFO L87 Difference]: Start difference. First operand 153 states and 156 transitions. Second operand 13 states. [2018-01-28 22:17:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:48,350 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2018-01-28 22:17:48,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 22:17:48,351 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2018-01-28 22:17:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:48,352 INFO L225 Difference]: With dead ends: 198 [2018-01-28 22:17:48,352 INFO L226 Difference]: Without dead ends: 162 [2018-01-28 22:17:48,352 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 101 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=442, Unknown=1, NotChecked=46, Total=650 [2018-01-28 22:17:48,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-28 22:17:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 152. [2018-01-28 22:17:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-28 22:17:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2018-01-28 22:17:48,366 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 108 [2018-01-28 22:17:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:48,367 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2018-01-28 22:17:48,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:17:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2018-01-28 22:17:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-01-28 22:17:48,368 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:48,368 INFO L330 BasicCegarLoop]: trace histogram [9, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:48,368 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:48,369 INFO L82 PathProgramCache]: Analyzing trace with hash 653779002, now seen corresponding path program 3 times [2018-01-28 22:17:48,369 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:48,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:48,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:48,370 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:17:48,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:48,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 108 proven. 14 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-01-28 22:17:48,684 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:17:48,684 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:17:48,690 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 22:17:48,700 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:17:48,705 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:17:48,706 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:17:48,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:17:48,713 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-28 22:17:48,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:17:48,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:17:48,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 22:17:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 114 proven. 4 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-01-28 22:17:48,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:17:48,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-01-28 22:17:48,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-28 22:17:48,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-28 22:17:48,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2018-01-28 22:17:48,950 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 23 states. [2018-01-28 22:17:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:49,306 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-01-28 22:17:49,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:17:49,307 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 127 [2018-01-28 22:17:49,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:49,308 INFO L225 Difference]: With dead ends: 156 [2018-01-28 22:17:49,308 INFO L226 Difference]: Without dead ends: 155 [2018-01-28 22:17:49,309 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 112 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2018-01-28 22:17:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-28 22:17:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2018-01-28 22:17:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-28 22:17:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 151 transitions. [2018-01-28 22:17:49,322 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 151 transitions. Word has length 127 [2018-01-28 22:17:49,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:49,323 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 151 transitions. [2018-01-28 22:17:49,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-28 22:17:49,323 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 151 transitions. [2018-01-28 22:17:49,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-01-28 22:17:49,324 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:49,324 INFO L330 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-28 22:17:49,325 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:49,325 INFO L82 PathProgramCache]: Analyzing trace with hash -930774613, now seen corresponding path program 1 times [2018-01-28 22:17:49,325 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:49,325 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:49,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:49,326 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:17:49,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:49,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-01-28 22:17:49,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:17:49,456 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:17:49,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:49,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:17:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 158 proven. 13 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-01-28 22:17:49,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:17:49,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2018-01-28 22:17:49,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-28 22:17:49,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-28 22:17:49,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-01-28 22:17:49,654 INFO L87 Difference]: Start difference. First operand 149 states and 151 transitions. Second operand 25 states. [2018-01-28 22:17:50,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:50,086 INFO L93 Difference]: Finished difference Result 237 states and 247 transitions. [2018-01-28 22:17:50,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-28 22:17:50,086 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 148 [2018-01-28 22:17:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:50,087 INFO L225 Difference]: With dead ends: 237 [2018-01-28 22:17:50,088 INFO L226 Difference]: Without dead ends: 183 [2018-01-28 22:17:50,088 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=373, Invalid=2177, Unknown=0, NotChecked=0, Total=2550 [2018-01-28 22:17:50,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-28 22:17:50,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 167. [2018-01-28 22:17:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-01-28 22:17:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 170 transitions. [2018-01-28 22:17:50,099 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 170 transitions. Word has length 148 [2018-01-28 22:17:50,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:50,099 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 170 transitions. [2018-01-28 22:17:50,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-28 22:17:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 170 transitions. [2018-01-28 22:17:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-01-28 22:17:50,102 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:50,102 INFO L330 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-28 22:17:50,103 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash -186583576, now seen corresponding path program 2 times [2018-01-28 22:17:50,103 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:50,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:50,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:50,104 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:17:50,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:50,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2018-01-28 22:17:50,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:17:50,377 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:17:50,382 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:17:50,393 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:17:50,415 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:17:50,419 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:17:50,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:17:50,629 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 330 proven. 33 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-01-28 22:17:50,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:17:50,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 31 [2018-01-28 22:17:50,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-28 22:17:50,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-28 22:17:50,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2018-01-28 22:17:50,650 INFO L87 Difference]: Start difference. First operand 167 states and 170 transitions. Second operand 31 states. [2018-01-28 22:17:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:51,407 INFO L93 Difference]: Finished difference Result 317 states and 330 transitions. [2018-01-28 22:17:51,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-28 22:17:51,410 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 204 [2018-01-28 22:17:51,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:51,412 INFO L225 Difference]: With dead ends: 317 [2018-01-28 22:17:51,412 INFO L226 Difference]: Without dead ends: 257 [2018-01-28 22:17:51,414 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=563, Invalid=3597, Unknown=0, NotChecked=0, Total=4160 [2018-01-28 22:17:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-01-28 22:17:51,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 223. [2018-01-28 22:17:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-28 22:17:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 228 transitions. [2018-01-28 22:17:51,436 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 228 transitions. Word has length 204 [2018-01-28 22:17:51,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:51,437 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 228 transitions. [2018-01-28 22:17:51,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-28 22:17:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 228 transitions. [2018-01-28 22:17:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-01-28 22:17:51,439 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:17:51,439 INFO L330 BasicCegarLoop]: trace histogram [20, 14, 14, 14, 14, 14, 14, 14, 14, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:17:51,439 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 22:17:51,439 INFO L82 PathProgramCache]: Analyzing trace with hash -129615679, now seen corresponding path program 3 times [2018-01-28 22:17:51,439 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:17:51,440 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:17:51,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:51,440 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:17:51,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:17:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:17:51,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:17:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-01-28 22:17:51,790 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:17:51,790 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:17:51,797 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 22:17:51,816 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:17:51,824 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:17:51,826 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:17:51,833 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:17:51,836 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-28 22:17:51,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:17:51,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:17:51,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 22:17:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1299 trivial. 0 not checked. [2018-01-28 22:17:52,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:17:52,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2018-01-28 22:17:52,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 22:17:52,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 22:17:52,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-01-28 22:17:52,314 INFO L87 Difference]: Start difference. First operand 223 states and 228 transitions. Second operand 21 states. [2018-01-28 22:17:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:17:52,784 INFO L93 Difference]: Finished difference Result 254 states and 263 transitions. [2018-01-28 22:17:52,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-28 22:17:52,785 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 269 [2018-01-28 22:17:52,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:17:52,785 INFO L225 Difference]: With dead ends: 254 [2018-01-28 22:17:52,785 INFO L226 Difference]: Without dead ends: 0 [2018-01-28 22:17:52,786 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 253 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=1695, Unknown=0, NotChecked=0, Total=2256 [2018-01-28 22:17:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-28 22:17:52,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-28 22:17:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-28 22:17:52,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-28 22:17:52,787 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 269 [2018-01-28 22:17:52,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:17:52,787 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-28 22:17:52,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 22:17:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-28 22:17:52,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-28 22:17:52,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-28 22:17:52,807 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 22:17:52,815 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 22:17:52,834 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 22:17:52,862 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 22:17:54,207 WARN L146 SmtUtils]: Spent 905ms on a formula simplification. DAG size of input: 133 DAG size of output 69 [2018-01-28 22:17:54,457 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 44 DAG size of output 21 [2018-01-28 22:17:54,460 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 31) no Hoare annotation was computed. [2018-01-28 22:17:54,479 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 31) no Hoare annotation was computed. [2018-01-28 22:17:54,480 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 22:17:54,480 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 31) no Hoare annotation was computed. [2018-01-28 22:17:54,480 INFO L399 ceAbstractionStarter]: For program point L14'''(lines 14 16) no Hoare annotation was computed. [2018-01-28 22:17:54,480 INFO L399 ceAbstractionStarter]: For program point L14'''''''(lines 14 16) no Hoare annotation was computed. [2018-01-28 22:17:54,480 INFO L399 ceAbstractionStarter]: For program point L14'''''(line 14) no Hoare annotation was computed. [2018-01-28 22:17:54,480 INFO L399 ceAbstractionStarter]: For program point fooEXIT(lines 12 18) no Hoare annotation was computed. [2018-01-28 22:17:54,480 INFO L399 ceAbstractionStarter]: For program point L14''''(line 14) no Hoare annotation was computed. [2018-01-28 22:17:54,481 INFO L399 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-28 22:17:54,481 INFO L399 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-28 22:17:54,481 INFO L399 ceAbstractionStarter]: For program point L15'(line 15) no Hoare annotation was computed. [2018-01-28 22:17:54,481 INFO L399 ceAbstractionStarter]: For program point L15''(line 15) no Hoare annotation was computed. [2018-01-28 22:17:54,481 INFO L399 ceAbstractionStarter]: For program point L13'(line 13) no Hoare annotation was computed. [2018-01-28 22:17:54,481 INFO L399 ceAbstractionStarter]: For program point fooFINAL(lines 12 18) no Hoare annotation was computed. [2018-01-28 22:17:54,481 INFO L402 ceAbstractionStarter]: At program point fooENTRY(lines 12 18) the Hoare annotation is: true [2018-01-28 22:17:54,481 INFO L399 ceAbstractionStarter]: For program point L12(lines 12 18) no Hoare annotation was computed. [2018-01-28 22:17:54,481 INFO L399 ceAbstractionStarter]: For program point L15'''(line 15) no Hoare annotation was computed. [2018-01-28 22:17:54,482 INFO L399 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-01-28 22:17:54,482 INFO L399 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-01-28 22:17:54,482 INFO L399 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-28 22:17:54,482 INFO L399 ceAbstractionStarter]: For program point L12'(lines 12 18) no Hoare annotation was computed. [2018-01-28 22:17:54,482 INFO L399 ceAbstractionStarter]: For program point L14'(lines 14 16) no Hoare annotation was computed. [2018-01-28 22:17:54,482 INFO L399 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 15) no Hoare annotation was computed. [2018-01-28 22:17:54,482 INFO L395 ceAbstractionStarter]: At program point L14''''''(lines 14 16) the Hoare annotation is: (let ((.cse13 (exists ((foo_~i~1 Int)) (and (<= 0 (+ (* 4 foo_~i~1) |foo_#in~b.offset|)) (<= (+ foo_~i~1 1) |foo_#in~size|))))) (let ((.cse8 (not .cse13)) (.cse6 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse7 (not (= 400 (select |#length| |foo_#in~b.base|)))) (.cse0 (<= 1 foo_~i~1)) (.cse10 (not (= 0 |foo_#in~b.offset|))) (.cse2 (<= |foo_#in~size| foo_~size)) (.cse3 (<= |foo_#in~size| foo_~n)) (.cse4 (= foo_~b.base |foo_#in~b.base|)) (.cse5 (= foo_~b.offset 0)) (.cse9 (= foo_~i~1 0)) (.cse11 (< |foo_#in~n| |foo_#in~size|))) (and (let ((.cse1 (<= foo_~size 1))) (or (and (<= foo_~i~1 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9) .cse10 (< 1 |foo_#in~size|) .cse11)) (or (and (= foo_~size 0) .cse3 .cse4 .cse5 .cse9) .cse6 .cse7 .cse10 (not (= 0 |foo_#in~size|)) .cse11) (or .cse6 .cse7 .cse8 (<= foo_~i~1 2) .cse10 (< 2 |foo_#in~size|) .cse11) (let ((.cse12 (<= foo_~size |foo_#in~size|)) (.cse14 (<= 2 foo_~n))) (or .cse6 .cse7 (and .cse12 .cse13 (and .cse2 .cse4 .cse14 .cse5 .cse0 (<= foo_~size foo_~n))) .cse10 (< |foo_#in~n| 2) (< 99 |foo_#in~size|) (and .cse12 .cse14 .cse2 .cse3 .cse4 .cse5 .cse9) .cse11))))) [2018-01-28 22:17:54,482 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 31) the Hoare annotation is: true [2018-01-28 22:17:54,483 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 31) no Hoare annotation was computed. [2018-01-28 22:17:54,483 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 31) the Hoare annotation is: true [2018-01-28 22:17:54,483 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 31) no Hoare annotation was computed. [2018-01-28 22:17:54,483 INFO L395 ceAbstractionStarter]: At program point L22'''''(lines 22 24) the Hoare annotation is: (let ((.cse0 (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1))) (.cse1 (= 0 |main_~#b~3.offset|)) (.cse2 (= (select |#length| |main_~#b~3.base|) 400)) (.cse3 (= 0 (select |old(#valid)| |main_~#b~3.base|)))) (or (and .cse0 .cse1 .cse2 (= main_~i~3 0) .cse3) (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3))) [2018-01-28 22:17:54,483 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-28 22:17:54,483 INFO L399 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-01-28 22:17:54,483 INFO L395 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1))) (.cse1 (= 0 |main_~#b~3.offset|)) (.cse2 (= (select |#length| |main_~#b~3.base|) 400)) (.cse3 (= 0 (select |old(#valid)| |main_~#b~3.base|)))) (or (and .cse0 .cse1 .cse2 (= main_~i~3 0) .cse3) (and .cse0 .cse1 .cse2 (<= 1 main_~i~3) .cse3 (<= main_~i~3 99)))) [2018-01-28 22:17:54,483 INFO L399 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2018-01-28 22:17:54,483 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-28 22:17:54,484 INFO L399 ceAbstractionStarter]: For program point L25(lines 25 29) no Hoare annotation was computed. [2018-01-28 22:17:54,484 INFO L399 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-28 22:17:54,484 INFO L399 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-28 22:17:54,484 INFO L399 ceAbstractionStarter]: For program point L23'''(line 23) no Hoare annotation was computed. [2018-01-28 22:17:54,484 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-28 22:17:54,484 INFO L399 ceAbstractionStarter]: For program point L23'(line 23) no Hoare annotation was computed. [2018-01-28 22:17:54,484 INFO L399 ceAbstractionStarter]: For program point L21'''''(line 21) no Hoare annotation was computed. [2018-01-28 22:17:54,484 INFO L399 ceAbstractionStarter]: For program point L22''''''(lines 22 24) no Hoare annotation was computed. [2018-01-28 22:17:54,484 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 20 31) no Hoare annotation was computed. [2018-01-28 22:17:54,484 INFO L399 ceAbstractionStarter]: For program point L22''(lines 22 24) no Hoare annotation was computed. [2018-01-28 22:17:54,484 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 20 31) no Hoare annotation was computed. [2018-01-28 22:17:54,485 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 20 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 22:17:54,485 INFO L399 ceAbstractionStarter]: For program point L22''''(line 22) no Hoare annotation was computed. [2018-01-28 22:17:54,485 INFO L399 ceAbstractionStarter]: For program point L22'''(line 22) no Hoare annotation was computed. [2018-01-28 22:17:54,485 INFO L399 ceAbstractionStarter]: For program point L26'(line 26) no Hoare annotation was computed. [2018-01-28 22:17:54,485 INFO L399 ceAbstractionStarter]: For program point L26''(line 26) no Hoare annotation was computed. [2018-01-28 22:17:54,485 INFO L399 ceAbstractionStarter]: For program point L21''''(line 21) no Hoare annotation was computed. [2018-01-28 22:17:54,485 INFO L399 ceAbstractionStarter]: For program point L26'''(line 26) no Hoare annotation was computed. [2018-01-28 22:17:54,485 INFO L395 ceAbstractionStarter]: At program point L25'''''(lines 25 29) the Hoare annotation is: (let ((.cse0 (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1))) (.cse1 (= 0 |main_~#b~3.offset|)) (.cse2 (= (select |#length| |main_~#b~3.base|) 400)) (.cse3 (= 0 (select |old(#valid)| |main_~#b~3.base|)))) (or (and .cse0 .cse1 .cse2 (= main_~i~3 0) .cse3) (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3))) [2018-01-28 22:17:54,485 INFO L399 ceAbstractionStarter]: For program point L25'''(line 25) no Hoare annotation was computed. [2018-01-28 22:17:54,486 INFO L399 ceAbstractionStarter]: For program point L25''''''(lines 25 29) no Hoare annotation was computed. [2018-01-28 22:17:54,486 INFO L399 ceAbstractionStarter]: For program point L21'''(line 21) no Hoare annotation was computed. [2018-01-28 22:17:54,486 INFO L399 ceAbstractionStarter]: For program point L21'(line 21) no Hoare annotation was computed. [2018-01-28 22:17:54,486 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-28 22:17:54,486 INFO L399 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-01-28 22:17:54,486 INFO L399 ceAbstractionStarter]: For program point L25''(lines 25 29) no Hoare annotation was computed. [2018-01-28 22:17:54,486 INFO L399 ceAbstractionStarter]: For program point L23''(line 23) no Hoare annotation was computed. [2018-01-28 22:17:54,486 INFO L399 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 20 31) no Hoare annotation was computed. [2018-01-28 22:17:54,486 INFO L399 ceAbstractionStarter]: For program point L21''(line 21) no Hoare annotation was computed. [2018-01-28 22:17:54,496 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,497 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,497 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,498 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,498 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,498 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,500 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,501 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,501 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,502 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,510 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,510 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,511 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,511 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,511 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,511 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,512 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,512 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,512 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,513 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,515 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,515 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,516 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,516 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,517 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,518 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,519 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,519 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:17:54 BoogieIcfgContainer [2018-01-28 22:17:54,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:17:54,522 INFO L168 Benchmark]: Toolchain (without parser) took 15309.60 ms. Allocated memory was 306.2 MB in the beginning and 658.5 MB in the end (delta: 352.3 MB). Free memory was 267.2 MB in the beginning and 471.4 MB in the end (delta: -204.2 MB). Peak memory consumption was 310.7 MB. Max. memory is 5.3 GB. [2018-01-28 22:17:54,523 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 306.2 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:17:54,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.70 ms. Allocated memory is still 306.2 MB. Free memory was 267.2 MB in the beginning and 257.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:17:54,524 INFO L168 Benchmark]: Boogie Preprocessor took 31.41 ms. Allocated memory is still 306.2 MB. Free memory is still 257.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:17:54,524 INFO L168 Benchmark]: RCFGBuilder took 241.48 ms. Allocated memory is still 306.2 MB. Free memory was 255.3 MB in the beginning and 238.7 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-28 22:17:54,524 INFO L168 Benchmark]: TraceAbstraction took 14855.35 ms. Allocated memory was 306.2 MB in the beginning and 658.5 MB in the end (delta: 352.3 MB). Free memory was 238.7 MB in the beginning and 471.4 MB in the end (delta: -232.7 MB). Peak memory consumption was 282.2 MB. Max. memory is 5.3 GB. [2018-01-28 22:17:54,526 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 306.2 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 173.70 ms. Allocated memory is still 306.2 MB. Free memory was 267.2 MB in the beginning and 257.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.41 ms. Allocated memory is still 306.2 MB. Free memory is still 257.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 241.48 ms. Allocated memory is still 306.2 MB. Free memory was 255.3 MB in the beginning and 238.7 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 14855.35 ms. Allocated memory was 306.2 MB in the beginning and 658.5 MB in the end (delta: 352.3 MB). Free memory was 238.7 MB in the beginning and 471.4 MB in the end (delta: -232.7 MB). Peak memory consumption was 282.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2018-01-28 22:17:54,531 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,532 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,532 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,532 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,533 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,533 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,537 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,537 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-28 22:17:54,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((i <= 1 && 1 <= i) && size <= 1) && \old(size) <= size) && \old(size) <= n) && b == b) && b == 0) || !(\valid[b] == 1)) || !(400 == unknown-#length-unknown[b])) || !(\exists foo_~i~1 : int :: 0 <= 4 * foo_~i~1 + b && foo_~i~1 + 1 <= \old(size))) || (((((size <= 1 && \old(size) <= size) && \old(size) <= n) && b == b) && b == 0) && i == 0)) || !(0 == b)) || 1 < \old(size)) || \old(n) < \old(size)) && (((((((((size == 0 && \old(size) <= n) && b == b) && b == 0) && i == 0) || !(\valid[b] == 1)) || !(400 == unknown-#length-unknown[b])) || !(0 == b)) || !(0 == \old(size))) || \old(n) < \old(size))) && ((((((!(\valid[b] == 1) || !(400 == unknown-#length-unknown[b])) || !(\exists foo_~i~1 : int :: 0 <= 4 * foo_~i~1 + b && foo_~i~1 + 1 <= \old(size))) || i <= 2) || !(0 == b)) || 2 < \old(size)) || \old(n) < \old(size))) && (((((((!(\valid[b] == 1) || !(400 == unknown-#length-unknown[b])) || ((size <= \old(size) && (\exists foo_~i~1 : int :: 0 <= 4 * foo_~i~1 + b && foo_~i~1 + 1 <= \old(size))) && ((((\old(size) <= size && b == b) && 2 <= n) && b == 0) && 1 <= i) && size <= n)) || !(0 == b)) || \old(n) < 2) || 99 < \old(size)) || ((((((size <= \old(size) && 2 <= n) && \old(size) <= size) && \old(size) <= n) && b == b) && b == 0) && i == 0)) || \old(n) < \old(size)) - InvariantResult [Line: 25]: Loop Invariant [2018-01-28 22:17:54,541 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,541 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,542 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,542 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((\valid == \old(\valid)[b := 1] && 0 == b) && unknown-#length-unknown[b] == 400) && i == 0) && 0 == \old(\valid)[b]) || ((((1 <= i && \valid == \old(\valid)[b := 1]) && 0 == b) && unknown-#length-unknown[b] == 400) && 0 == \old(\valid)[b]) - InvariantResult [Line: 22]: Loop Invariant [2018-01-28 22:17:54,543 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,543 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,544 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 22:17:54,544 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((\valid == \old(\valid)[b := 1] && 0 == b) && unknown-#length-unknown[b] == 400) && i == 0) && 0 == \old(\valid)[b]) || ((((1 <= i && \valid == \old(\valid)[b := 1]) && 0 == b) && unknown-#length-unknown[b] == 400) && 0 == \old(\valid)[b]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 8 error locations. SAFE Result, 14.7s OverallTime, 23 OverallIterations, 20 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1160 SDtfs, 2447 SDslu, 5878 SDs, 0 SdLazy, 4840 SolverSat, 341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1922 GetRequests, 1441 SyntacticMatches, 40 SemanticMatches, 441 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3752 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 286 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 39 PreInvPairs, 82 NumberOfFragments, 407 HoareAnnotationTreeSize, 39 FomulaSimplifications, 5566 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 3575 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 3303 NumberOfCodeBlocks, 2876 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3265 ConstructedInterpolants, 444 QuantifiedInterpolants, 1575537 SizeOfPredicates, 93 NumberOfNonLiveVariables, 2547 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 38 InterpolantComputations, 11 PerfectInterpolantSequences, 5472/6055 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-17-54-550.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-17-54-550.csv Received shutdown request...