java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:16:59,295 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:16:59,296 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:16:59,312 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:16:59,312 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:16:59,313 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:16:59,314 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:16:59,316 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:16:59,318 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:16:59,319 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:16:59,320 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:16:59,320 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:16:59,321 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:16:59,322 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:16:59,323 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:16:59,326 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:16:59,328 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:16:59,330 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:16:59,331 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:16:59,333 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:16:59,335 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:16:59,335 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:16:59,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:16:59,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:16:59,337 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:16:59,338 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:16:59,339 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:16:59,339 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:16:59,340 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:16:59,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:16:59,340 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:16:59,341 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:16:59,349 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:16:59,349 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:16:59,350 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:16:59,350 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:16:59,350 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:16:59,350 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:16:59,350 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:16:59,351 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:16:59,351 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:16:59,351 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:16:59,351 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:16:59,351 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:16:59,351 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:16:59,352 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:16:59,352 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:16:59,352 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:16:59,352 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:16:59,352 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:16:59,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:16:59,352 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:16:59,352 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:16:59,353 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:16:59,353 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:16:59,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:16:59,353 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:16:59,354 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:16:59,354 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:16:59,354 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:16:59,354 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:16:59,354 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:16:59,354 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:16:59,354 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:16:59,355 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:16:59,355 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:16:59,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:16:59,398 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:16:59,402 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:16:59,403 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:16:59,404 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:16:59,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c [2018-01-24 12:16:59,514 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:16:59,519 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:16:59,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:16:59,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:16:59,525 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:16:59,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:16:59" (1/1) ... [2018-01-24 12:16:59,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@766fd1ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:16:59, skipping insertion in model container [2018-01-24 12:16:59,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:16:59" (1/1) ... [2018-01-24 12:16:59,543 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:16:59,558 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:16:59,676 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:16:59,695 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:16:59,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:16:59 WrapperNode [2018-01-24 12:16:59,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:16:59,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:16:59,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:16:59,703 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:16:59,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:16:59" (1/1) ... [2018-01-24 12:16:59,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:16:59" (1/1) ... [2018-01-24 12:16:59,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:16:59" (1/1) ... [2018-01-24 12:16:59,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:16:59" (1/1) ... [2018-01-24 12:16:59,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:16:59" (1/1) ... [2018-01-24 12:16:59,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:16:59" (1/1) ... [2018-01-24 12:16:59,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:16:59" (1/1) ... [2018-01-24 12:16:59,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:16:59,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:16:59,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:16:59,737 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:16:59,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:16:59" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:16:59,785 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:16:59,785 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:16:59,785 INFO L136 BoogieDeclarations]: Found implementation of procedure bar [2018-01-24 12:16:59,786 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 12:16:59,786 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:16:59,786 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:16:59,786 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:16:59,786 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:16:59,786 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:16:59,786 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:16:59,786 INFO L128 BoogieDeclarations]: Found specification of procedure bar [2018-01-24 12:16:59,786 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 12:16:59,786 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:16:59,787 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:16:59,787 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:17:00,018 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:17:00,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:17:00 BoogieIcfgContainer [2018-01-24 12:17:00,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:17:00,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:17:00,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:17:00,022 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:17:00,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:16:59" (1/3) ... [2018-01-24 12:17:00,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d7d82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:17:00, skipping insertion in model container [2018-01-24 12:17:00,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:16:59" (2/3) ... [2018-01-24 12:17:00,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d7d82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:17:00, skipping insertion in model container [2018-01-24 12:17:00,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:17:00" (3/3) ... [2018-01-24 12:17:00,026 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-01-24 12:17:00,032 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:17:00,038 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-24 12:17:00,083 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:17:00,083 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:17:00,083 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:17:00,083 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:17:00,084 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:17:00,084 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:17:00,084 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:17:00,084 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:17:00,085 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:17:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-01-24 12:17:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 12:17:00,115 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:00,116 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:00,116 INFO L371 AbstractCegarLoop]: === Iteration 1 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:00,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1613294992, now seen corresponding path program 1 times [2018-01-24 12:17:00,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:00,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:00,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:00,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:00,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:00,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:00,244 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:00,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:17:00,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 12:17:00,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 12:17:00,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 12:17:00,259 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-01-24 12:17:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:00,283 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2018-01-24 12:17:00,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 12:17:00,285 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-24 12:17:00,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:00,294 INFO L225 Difference]: With dead ends: 128 [2018-01-24 12:17:00,295 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 12:17:00,299 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 12:17:00,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 12:17:00,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-24 12:17:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 12:17:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-01-24 12:17:00,329 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 13 [2018-01-24 12:17:00,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:00,330 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-01-24 12:17:00,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 12:17:00,330 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-01-24 12:17:00,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:17:00,331 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:00,331 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:00,331 INFO L371 AbstractCegarLoop]: === Iteration 2 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:00,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1969953325, now seen corresponding path program 1 times [2018-01-24 12:17:00,331 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:00,331 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:00,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:00,333 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:00,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:00,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:00,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:00,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:17:00,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:17:00,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:17:00,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:17:00,465 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 3 states. [2018-01-24 12:17:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:00,532 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-01-24 12:17:00,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:17:00,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-24 12:17:00,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:00,537 INFO L225 Difference]: With dead ends: 86 [2018-01-24 12:17:00,538 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 12:17:00,539 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:17:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 12:17:00,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-01-24 12:17:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 12:17:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-01-24 12:17:00,553 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 14 [2018-01-24 12:17:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:00,553 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-01-24 12:17:00,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:17:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-01-24 12:17:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:17:00,554 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:00,554 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:00,554 INFO L371 AbstractCegarLoop]: === Iteration 3 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:00,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1297061679, now seen corresponding path program 1 times [2018-01-24 12:17:00,555 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:00,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:00,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:00,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:00,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:00,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:00,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:00,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:17:00,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:17:00,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:17:00,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:00,694 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-01-24 12:17:00,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:00,847 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2018-01-24 12:17:00,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:17:00,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-24 12:17:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:00,849 INFO L225 Difference]: With dead ends: 139 [2018-01-24 12:17:00,849 INFO L226 Difference]: Without dead ends: 85 [2018-01-24 12:17:00,850 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:17:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-24 12:17:00,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-01-24 12:17:00,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 12:17:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-24 12:17:00,858 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2018-01-24 12:17:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:00,858 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-24 12:17:00,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:17:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-24 12:17:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 12:17:00,859 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:00,859 INFO L322 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-24 12:17:00,859 INFO L371 AbstractCegarLoop]: === Iteration 4 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:00,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184185, now seen corresponding path program 1 times [2018-01-24 12:17:00,860 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:00,860 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:00,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:00,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:00,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:00,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:00,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:00,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:17:00,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:17:00,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:17:00,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:17:00,923 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-01-24 12:17:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:00,994 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-01-24 12:17:00,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:17:00,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-24 12:17:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:00,997 INFO L225 Difference]: With dead ends: 79 [2018-01-24 12:17:00,998 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 12:17:00,998 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:00,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 12:17:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-24 12:17:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 12:17:01,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-01-24 12:17:01,009 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 21 [2018-01-24 12:17:01,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:01,009 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-01-24 12:17:01,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:17:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-01-24 12:17:01,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 12:17:01,010 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:01,010 INFO L322 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-24 12:17:01,010 INFO L371 AbstractCegarLoop]: === Iteration 5 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:01,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184184, now seen corresponding path program 1 times [2018-01-24 12:17:01,011 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:01,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:01,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:01,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:01,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:01,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:01,086 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:01,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:17:01,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:17:01,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:17:01,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:17:01,088 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 7 states. [2018-01-24 12:17:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:01,218 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-01-24 12:17:01,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:17:01,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-24 12:17:01,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:01,220 INFO L225 Difference]: With dead ends: 149 [2018-01-24 12:17:01,220 INFO L226 Difference]: Without dead ends: 89 [2018-01-24 12:17:01,221 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:17:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-24 12:17:01,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-01-24 12:17:01,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 12:17:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-01-24 12:17:01,231 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-01-24 12:17:01,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:01,231 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-01-24 12:17:01,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:17:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-01-24 12:17:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:17:01,232 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:01,232 INFO L322 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, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:01,233 INFO L371 AbstractCegarLoop]: === Iteration 6 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:01,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1759981910, now seen corresponding path program 1 times [2018-01-24 12:17:01,233 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:01,233 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:01,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:01,234 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:01,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:01,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:01,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:01,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:17:01,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:17:01,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:17:01,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:17:01,293 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 5 states. [2018-01-24 12:17:01,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:01,322 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2018-01-24 12:17:01,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:17:01,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-24 12:17:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:01,324 INFO L225 Difference]: With dead ends: 147 [2018-01-24 12:17:01,324 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 12:17:01,325 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 12:17:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-01-24 12:17:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 12:17:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-24 12:17:01,335 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 31 [2018-01-24 12:17:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:01,335 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-24 12:17:01,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:17:01,336 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-24 12:17:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:17:01,337 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:01,337 INFO L322 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, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:01,337 INFO L371 AbstractCegarLoop]: === Iteration 7 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:01,338 INFO L82 PathProgramCache]: Analyzing trace with hash 216183673, now seen corresponding path program 1 times [2018-01-24 12:17:01,338 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:01,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:01,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:01,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:01,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:01,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:01,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:01,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:01,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:17:01,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:17:01,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:17:01,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:17:01,466 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 5 states. [2018-01-24 12:17:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:01,627 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-01-24 12:17:01,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:17:01,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-24 12:17:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:01,628 INFO L225 Difference]: With dead ends: 88 [2018-01-24 12:17:01,628 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 12:17:01,629 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 12:17:01,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-24 12:17:01,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-24 12:17:01,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-01-24 12:17:01,641 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 31 [2018-01-24 12:17:01,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:01,642 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-01-24 12:17:01,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:17:01,642 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-01-24 12:17:01,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:17:01,643 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:01,643 INFO L322 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, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:01,643 INFO L371 AbstractCegarLoop]: === Iteration 8 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:01,644 INFO L82 PathProgramCache]: Analyzing trace with hash 216183674, now seen corresponding path program 1 times [2018-01-24 12:17:01,644 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:01,644 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:01,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:01,645 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:01,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:01,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:01,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:01,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:17:01,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:17:01,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:17:01,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:17:01,826 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 8 states. [2018-01-24 12:17:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:02,122 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-01-24 12:17:02,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:17:02,122 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-24 12:17:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:02,123 INFO L225 Difference]: With dead ends: 103 [2018-01-24 12:17:02,123 INFO L226 Difference]: Without dead ends: 101 [2018-01-24 12:17:02,124 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:17:02,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-24 12:17:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-01-24 12:17:02,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 12:17:02,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-01-24 12:17:02,136 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 31 [2018-01-24 12:17:02,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:02,136 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-01-24 12:17:02,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:17:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-01-24 12:17:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:17:02,138 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:02,138 INFO L322 BasicCegarLoop]: trace histogram [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-24 12:17:02,138 INFO L371 AbstractCegarLoop]: === Iteration 9 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:02,138 INFO L82 PathProgramCache]: Analyzing trace with hash -231887552, now seen corresponding path program 1 times [2018-01-24 12:17:02,139 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:02,139 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:02,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:02,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:02,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:02,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:02,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:02,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:17:02,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:17:02,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:17:02,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:17:02,225 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 5 states. [2018-01-24 12:17:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:02,317 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-01-24 12:17:02,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:17:02,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-24 12:17:02,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:02,319 INFO L225 Difference]: With dead ends: 97 [2018-01-24 12:17:02,320 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 12:17:02,320 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 12:17:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-24 12:17:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 12:17:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-01-24 12:17:02,332 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 42 [2018-01-24 12:17:02,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:02,333 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-01-24 12:17:02,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:17:02,333 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-01-24 12:17:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:17:02,334 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:02,335 INFO L322 BasicCegarLoop]: trace histogram [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-24 12:17:02,335 INFO L371 AbstractCegarLoop]: === Iteration 10 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:02,335 INFO L82 PathProgramCache]: Analyzing trace with hash -231887551, now seen corresponding path program 1 times [2018-01-24 12:17:02,335 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:02,335 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:02,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:02,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:02,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:02,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:02,579 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:02,579 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:02,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:02,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:02,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:17:02,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:02,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:17:02,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:02,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:17:02,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 12:17:02,721 WARN L1029 $PredicateComparison]: unable to prove that (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) is different from true [2018-01-24 12:17:02,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 12:17:02,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:02,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:17:02,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:02,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:17:02,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-24 12:17:04,619 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (= (* 4 v_prenex_1) (select |c_#length| v_prenex_2)))) is different from true [2018-01-24 12:17:04,647 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:04,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:04,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:17:04,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:04,668 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 14 treesize of output 17 [2018-01-24 12:17:04,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:04,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 12:17:04,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:34, output treesize:27 [2018-01-24 12:17:04,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:04,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-24 12:17:04,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-24 12:17:04,912 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:04,913 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:04,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:17:04,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:04,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 12:17:04,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:38, output treesize:52 [2018-01-24 12:17:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-24 12:17:05,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:05,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2018-01-24 12:17:05,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 12:17:05,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 12:17:05,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=321, Unknown=3, NotChecked=74, Total=462 [2018-01-24 12:17:05,068 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 22 states. [2018-01-24 12:17:06,124 WARN L146 SmtUtils]: Spent 577ms on a formula simplification. DAG size of input: 46 DAG size of output 38 [2018-01-24 12:17:06,874 WARN L146 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 38 DAG size of output 34 [2018-01-24 12:17:07,142 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (= (* 4 foo_~n) (select |c_#length| |foo_~#a~3.base|)))) is different from true [2018-01-24 12:17:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:08,407 INFO L93 Difference]: Finished difference Result 246 states and 282 transitions. [2018-01-24 12:17:08,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-24 12:17:08,408 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-01-24 12:17:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:08,409 INFO L225 Difference]: With dead ends: 246 [2018-01-24 12:17:08,409 INFO L226 Difference]: Without dead ends: 234 [2018-01-24 12:17:08,411 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=391, Invalid=2150, Unknown=21, NotChecked=300, Total=2862 [2018-01-24 12:17:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-01-24 12:17:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 178. [2018-01-24 12:17:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-24 12:17:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 207 transitions. [2018-01-24 12:17:08,434 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 207 transitions. Word has length 42 [2018-01-24 12:17:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:08,435 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 207 transitions. [2018-01-24 12:17:08,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 12:17:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 207 transitions. [2018-01-24 12:17:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:17:08,436 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:08,436 INFO L322 BasicCegarLoop]: trace histogram [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, 1] [2018-01-24 12:17:08,436 INFO L371 AbstractCegarLoop]: === Iteration 11 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:08,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1401420489, now seen corresponding path program 1 times [2018-01-24 12:17:08,436 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:08,436 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:08,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:08,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:08,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:08,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:17:08,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:08,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:17:08,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:17:08,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:17:08,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:17:08,589 INFO L87 Difference]: Start difference. First operand 178 states and 207 transitions. Second operand 8 states. [2018-01-24 12:17:08,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:08,738 INFO L93 Difference]: Finished difference Result 178 states and 207 transitions. [2018-01-24 12:17:08,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:17:08,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-01-24 12:17:08,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:08,740 INFO L225 Difference]: With dead ends: 178 [2018-01-24 12:17:08,741 INFO L226 Difference]: Without dead ends: 177 [2018-01-24 12:17:08,741 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:17:08,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-24 12:17:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-01-24 12:17:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-24 12:17:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 204 transitions. [2018-01-24 12:17:08,769 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 204 transitions. Word has length 43 [2018-01-24 12:17:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:08,769 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 204 transitions. [2018-01-24 12:17:08,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:17:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 204 transitions. [2018-01-24 12:17:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 12:17:08,770 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:08,770 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 12:17:08,770 INFO L371 AbstractCegarLoop]: === Iteration 12 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:08,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1644784265, now seen corresponding path program 1 times [2018-01-24 12:17:08,771 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:08,771 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:08,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:08,772 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:08,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:08,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:08,855 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:08,855 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:08,868 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:08,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:08,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:17:08,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-01-24 12:17:08,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:17:08,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:17:08,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:17:08,974 INFO L87 Difference]: Start difference. First operand 177 states and 204 transitions. Second operand 9 states. [2018-01-24 12:17:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:09,149 INFO L93 Difference]: Finished difference Result 260 states and 295 transitions. [2018-01-24 12:17:09,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:17:09,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-01-24 12:17:09,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:09,151 INFO L225 Difference]: With dead ends: 260 [2018-01-24 12:17:09,152 INFO L226 Difference]: Without dead ends: 141 [2018-01-24 12:17:09,152 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:17:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-24 12:17:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2018-01-24 12:17:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-24 12:17:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-01-24 12:17:09,180 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 46 [2018-01-24 12:17:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:09,181 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-01-24 12:17:09,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:17:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-01-24 12:17:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 12:17:09,182 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:09,182 INFO L322 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, 1, 1] [2018-01-24 12:17:09,182 INFO L371 AbstractCegarLoop]: === Iteration 13 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:09,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1096362099, now seen corresponding path program 1 times [2018-01-24 12:17:09,182 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:09,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:09,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:09,184 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:09,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:09,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 12:17:09,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:09,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:17:09,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:17:09,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:17:09,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:09,285 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 6 states. [2018-01-24 12:17:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:09,433 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2018-01-24 12:17:09,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:17:09,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-01-24 12:17:09,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:09,435 INFO L225 Difference]: With dead ends: 144 [2018-01-24 12:17:09,435 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 12:17:09,435 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:17:09,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 12:17:09,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 134. [2018-01-24 12:17:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 12:17:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-01-24 12:17:09,453 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 52 [2018-01-24 12:17:09,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:09,454 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-01-24 12:17:09,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:17:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-01-24 12:17:09,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-24 12:17:09,455 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:09,455 INFO L322 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2018-01-24 12:17:09,455 INFO L371 AbstractCegarLoop]: === Iteration 14 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1224161946, now seen corresponding path program 1 times [2018-01-24 12:17:09,456 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:09,456 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:09,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:09,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:09,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:09,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:17:09,597 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:09,597 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:09,604 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:09,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:17:09,731 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:09,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2018-01-24 12:17:09,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:17:09,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:17:09,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:17:09,733 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 15 states. [2018-01-24 12:17:09,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:09,987 INFO L93 Difference]: Finished difference Result 215 states and 232 transitions. [2018-01-24 12:17:09,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:17:09,987 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-01-24 12:17:09,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:09,989 INFO L225 Difference]: With dead ends: 215 [2018-01-24 12:17:09,989 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 12:17:09,989 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:17:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 12:17:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2018-01-24 12:17:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 12:17:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-01-24 12:17:10,007 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 57 [2018-01-24 12:17:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:10,008 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-01-24 12:17:10,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:17:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-01-24 12:17:10,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-24 12:17:10,009 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:10,009 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 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] [2018-01-24 12:17:10,009 INFO L371 AbstractCegarLoop]: === Iteration 15 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:10,010 INFO L82 PathProgramCache]: Analyzing trace with hash -227989441, now seen corresponding path program 1 times [2018-01-24 12:17:10,010 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:10,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:10,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:10,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:10,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:10,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 12:17:10,134 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:10,134 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:10,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:10,177 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:17:10,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:17:10,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2018-01-24 12:17:10,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:17:10,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:17:10,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:17:10,290 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 14 states. [2018-01-24 12:17:10,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:10,563 INFO L93 Difference]: Finished difference Result 207 states and 220 transitions. [2018-01-24 12:17:10,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:17:10,563 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-01-24 12:17:10,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:10,564 INFO L225 Difference]: With dead ends: 207 [2018-01-24 12:17:10,565 INFO L226 Difference]: Without dead ends: 128 [2018-01-24 12:17:10,565 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-01-24 12:17:10,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-24 12:17:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2018-01-24 12:17:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-24 12:17:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-01-24 12:17:10,583 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 62 [2018-01-24 12:17:10,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:10,584 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-01-24 12:17:10,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:17:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-01-24 12:17:10,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-24 12:17:10,584 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:10,585 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:10,585 INFO L371 AbstractCegarLoop]: === Iteration 16 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:10,585 INFO L82 PathProgramCache]: Analyzing trace with hash 897277161, now seen corresponding path program 1 times [2018-01-24 12:17:10,585 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:10,585 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:10,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:10,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:10,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:10,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 12:17:10,898 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:10,898 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:10,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:10,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:10,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:17:10,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:17:10,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:10,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:17:10,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:17:10,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 12:17:11,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 28 [2018-01-24 12:17:11,130 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 17 treesize of output 16 [2018-01-24 12:17:11,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:11,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:17:11,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 12:17:11,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:15, output treesize:11 [2018-01-24 12:17:11,216 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~3.base| Int)) (and (= |c_foo_#t~ret5| (select (select |c_#memory_int| |foo_~#a~3.base|) 0)) (= |c_#memory_int| (store |c_old(#memory_int)| |foo_~#a~3.base| (store (select |c_old(#memory_int)| |foo_~#a~3.base|) 0 (select (select |c_old(#memory_int)| |c_foo_#in~b.base|) |c_foo_#in~b.offset|)))))) is different from true [2018-01-24 12:17:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-01-24 12:17:13,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:13,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 34 [2018-01-24 12:17:13,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-24 12:17:13,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-24 12:17:13,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=938, Unknown=16, NotChecked=62, Total=1122 [2018-01-24 12:17:13,360 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 34 states. [2018-01-24 12:17:15,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:15,250 INFO L93 Difference]: Finished difference Result 247 states and 272 transitions. [2018-01-24 12:17:15,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-24 12:17:15,251 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2018-01-24 12:17:15,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:15,253 INFO L225 Difference]: With dead ends: 247 [2018-01-24 12:17:15,253 INFO L226 Difference]: Without dead ends: 187 [2018-01-24 12:17:15,254 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=413, Invalid=3323, Unknown=50, NotChecked=120, Total=3906 [2018-01-24 12:17:15,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-24 12:17:15,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 139. [2018-01-24 12:17:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-24 12:17:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2018-01-24 12:17:15,277 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 67 [2018-01-24 12:17:15,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:15,278 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2018-01-24 12:17:15,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-24 12:17:15,278 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2018-01-24 12:17:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-24 12:17:15,279 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:15,279 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2018-01-24 12:17:15,279 INFO L371 AbstractCegarLoop]: === Iteration 17 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:15,280 INFO L82 PathProgramCache]: Analyzing trace with hash 2066805359, now seen corresponding path program 1 times [2018-01-24 12:17:15,280 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:15,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:15,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:15,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:15,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:15,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 12:17:15,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:15,487 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:15,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:15,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:15,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:15,638 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 19 treesize of output 22 [2018-01-24 12:17:15,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:15,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:15,649 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:15,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:17:15,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:15,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 12:17:15,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:28 [2018-01-24 12:17:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-01-24 12:17:15,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:15,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-01-24 12:17:15,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:17:15,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:17:15,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:17:15,741 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand 19 states. [2018-01-24 12:17:16,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:16,126 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-01-24 12:17:16,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:17:16,126 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-01-24 12:17:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:16,127 INFO L225 Difference]: With dead ends: 144 [2018-01-24 12:17:16,128 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 12:17:16,128 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-01-24 12:17:16,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 12:17:16,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2018-01-24 12:17:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-24 12:17:16,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2018-01-24 12:17:16,144 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 78 [2018-01-24 12:17:16,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:16,144 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2018-01-24 12:17:16,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:17:16,144 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2018-01-24 12:17:16,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-24 12:17:16,145 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:16,146 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 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] [2018-01-24 12:17:16,146 INFO L371 AbstractCegarLoop]: === Iteration 18 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:16,146 INFO L82 PathProgramCache]: Analyzing trace with hash -864143526, now seen corresponding path program 1 times [2018-01-24 12:17:16,146 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:16,146 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:16,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:16,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:16,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:16,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-01-24 12:17:16,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:16,205 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:16,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:16,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-01-24 12:17:16,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:16,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-24 12:17:16,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:17:16,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:17:16,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:16,311 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 6 states. [2018-01-24 12:17:16,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:16,401 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2018-01-24 12:17:16,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:17:16,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-01-24 12:17:16,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:16,403 INFO L225 Difference]: With dead ends: 155 [2018-01-24 12:17:16,403 INFO L226 Difference]: Without dead ends: 145 [2018-01-24 12:17:16,404 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-24 12:17:16,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2018-01-24 12:17:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-24 12:17:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2018-01-24 12:17:16,425 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 80 [2018-01-24 12:17:16,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:16,426 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2018-01-24 12:17:16,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:17:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2018-01-24 12:17:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-24 12:17:16,427 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:16,427 INFO L322 BasicCegarLoop]: trace histogram [5, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:16,427 INFO L371 AbstractCegarLoop]: === Iteration 19 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:16,428 INFO L82 PathProgramCache]: Analyzing trace with hash -999779067, now seen corresponding path program 2 times [2018-01-24 12:17:16,428 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:16,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:16,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:16,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:16,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:16,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:16,783 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 12:17:16,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:16,783 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-24 12:17:16,791 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:17:16,808 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:16,828 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:16,833 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:16,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:16,937 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:16,938 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:16,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:17:16,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:16,948 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 19 treesize of output 22 [2018-01-24 12:17:16,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:16,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 12:17:16,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:30 [2018-01-24 12:17:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-24 12:17:17,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:17,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-01-24 12:17:17,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 12:17:17,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 12:17:17,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-01-24 12:17:17,124 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 22 states. [2018-01-24 12:17:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:17,692 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2018-01-24 12:17:17,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:17:17,693 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2018-01-24 12:17:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:17,693 INFO L225 Difference]: With dead ends: 142 [2018-01-24 12:17:17,694 INFO L226 Difference]: Without dead ends: 141 [2018-01-24 12:17:17,694 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2018-01-24 12:17:17,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-24 12:17:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2018-01-24 12:17:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 12:17:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2018-01-24 12:17:17,710 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 84 [2018-01-24 12:17:17,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:17,711 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2018-01-24 12:17:17,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 12:17:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2018-01-24 12:17:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-24 12:17:17,712 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:17,712 INFO L322 BasicCegarLoop]: trace histogram [5, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:17,712 INFO L371 AbstractCegarLoop]: === Iteration 20 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash 311899052, now seen corresponding path program 2 times [2018-01-24 12:17:17,713 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:17,713 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:17,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:17,713 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:17:17,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:17,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-24 12:17:17,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:17,894 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-24 12:17:17,901 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:17:17,915 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:17,931 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:17,934 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:17,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 55 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-01-24 12:17:18,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:18,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-01-24 12:17:18,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 12:17:18,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 12:17:18,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:17:18,079 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 17 states. [2018-01-24 12:17:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:18,422 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2018-01-24 12:17:18,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 12:17:18,422 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-01-24 12:17:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:18,423 INFO L225 Difference]: With dead ends: 203 [2018-01-24 12:17:18,423 INFO L226 Difference]: Without dead ends: 148 [2018-01-24 12:17:18,424 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:17:18,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-24 12:17:18,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 141. [2018-01-24 12:17:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-24 12:17:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-01-24 12:17:18,445 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 93 [2018-01-24 12:17:18,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:18,446 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-01-24 12:17:18,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 12:17:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-01-24 12:17:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-24 12:17:18,447 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:18,447 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:18,447 INFO L371 AbstractCegarLoop]: === Iteration 21 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:18,447 INFO L82 PathProgramCache]: Analyzing trace with hash -52037211, now seen corresponding path program 2 times [2018-01-24 12:17:18,448 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:18,448 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:18,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:18,449 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:17:18,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:18,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 9 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-01-24 12:17:18,649 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:18,649 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-24 12:17:18,654 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:17:18,670 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:18,692 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:18,695 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:18,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-01-24 12:17:18,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:18,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-01-24 12:17:18,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:17:18,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:17:18,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:17:18,801 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 19 states. [2018-01-24 12:17:19,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:19,482 INFO L93 Difference]: Finished difference Result 229 states and 243 transitions. [2018-01-24 12:17:19,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:17:19,483 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2018-01-24 12:17:19,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:19,484 INFO L225 Difference]: With dead ends: 229 [2018-01-24 12:17:19,485 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 12:17:19,485 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2018-01-24 12:17:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 12:17:19,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2018-01-24 12:17:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 12:17:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-01-24 12:17:19,524 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 109 [2018-01-24 12:17:19,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:19,524 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-01-24 12:17:19,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:17:19,524 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-01-24 12:17:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-01-24 12:17:19,526 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:19,526 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:19,526 INFO L371 AbstractCegarLoop]: === Iteration 22 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:19,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1577506560, now seen corresponding path program 3 times [2018-01-24 12:17:19,526 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:19,527 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:19,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:19,528 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:17:19,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:19,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 14 proven. 58 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-01-24 12:17:20,074 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:20,074 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-24 12:17:20,079 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:17:20,093 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:17:20,101 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:17:20,112 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:17:20,117 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:20,121 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:20,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:17:20,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:20,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-24 12:17:20,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:20,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:17:20,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 12:17:20,156 WARN L1029 $PredicateComparison]: unable to prove that (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) is different from true [2018-01-24 12:17:20,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:17:20,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:20,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 12:17:20,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:20,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:17:20,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-24 12:17:20,193 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_7 Int) (v_prenex_8 Int)) (= (* 4 v_prenex_7) (select |c_#length| v_prenex_8))) (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0)))) is different from true [2018-01-24 12:17:20,214 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:20,225 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 14 treesize of output 17 [2018-01-24 12:17:20,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:20,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:20,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:20,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:17:20,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:20,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 12:17:20,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:34, output treesize:27 [2018-01-24 12:17:20,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 12:17:20,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:20,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:17:20,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:20,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:17:20,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-24 12:17:20,341 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_10 Int) (v_prenex_9 Int)) (= (* 4 v_prenex_9) (select |c_#length| v_prenex_10))) (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0)))) is different from true [2018-01-24 12:17:20,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:20,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-24 12:17:20,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-24 12:17:20,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:20,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:20,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:17:20,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:20,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-01-24 12:17:20,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:45, output treesize:66 [2018-01-24 12:17:20,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:17:20,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:20,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 12:17:20,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:20,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:17:20,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-24 12:17:20,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:20,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-24 12:17:20,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-24 12:17:20,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:20,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:20,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:17:20,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:20,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 12:17:20,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:72 [2018-01-24 12:17:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 44 not checked. [2018-01-24 12:17:20,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:20,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2018-01-24 12:17:20,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-24 12:17:20,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-24 12:17:20,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=914, Unknown=3, NotChecked=192, Total=1260 [2018-01-24 12:17:20,900 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 36 states. [2018-01-24 12:17:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:23,167 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2018-01-24 12:17:23,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-24 12:17:23,168 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 114 [2018-01-24 12:17:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:23,169 INFO L225 Difference]: With dead ends: 174 [2018-01-24 12:17:23,169 INFO L226 Difference]: Without dead ends: 159 [2018-01-24 12:17:23,170 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 101 SyntacticMatches, 11 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=511, Invalid=2920, Unknown=3, NotChecked=348, Total=3782 [2018-01-24 12:17:23,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-24 12:17:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2018-01-24 12:17:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-24 12:17:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2018-01-24 12:17:23,194 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 114 [2018-01-24 12:17:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:23,194 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2018-01-24 12:17:23,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-24 12:17:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2018-01-24 12:17:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-01-24 12:17:23,195 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:23,195 INFO L322 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:23,196 INFO L371 AbstractCegarLoop]: === Iteration 23 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash -711301408, now seen corresponding path program 1 times [2018-01-24 12:17:23,196 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:23,196 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:23,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:23,197 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:17:23,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:23,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-01-24 12:17:23,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:23,292 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-24 12:17:23,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:23,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 74 proven. 27 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-01-24 12:17:23,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:23,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 12 [2018-01-24 12:17:23,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:17:23,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:17:23,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:17:23,462 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand 12 states. [2018-01-24 12:17:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:23,645 INFO L93 Difference]: Finished difference Result 255 states and 273 transitions. [2018-01-24 12:17:23,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:17:23,646 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 128 [2018-01-24 12:17:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:23,647 INFO L225 Difference]: With dead ends: 255 [2018-01-24 12:17:23,647 INFO L226 Difference]: Without dead ends: 171 [2018-01-24 12:17:23,648 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:17:23,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-24 12:17:23,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 156. [2018-01-24 12:17:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-24 12:17:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 164 transitions. [2018-01-24 12:17:23,667 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 164 transitions. Word has length 128 [2018-01-24 12:17:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:23,668 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 164 transitions. [2018-01-24 12:17:23,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:17:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 164 transitions. [2018-01-24 12:17:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-01-24 12:17:23,669 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:23,669 INFO L322 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:23,669 INFO L371 AbstractCegarLoop]: === Iteration 24 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:23,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1264569492, now seen corresponding path program 2 times [2018-01-24 12:17:23,670 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:23,670 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:23,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:23,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:23,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:23,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2018-01-24 12:17:23,837 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:23,837 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-24 12:17:23,844 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:17:23,860 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:23,906 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:23,915 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:23,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:24,156 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 220 proven. 9 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-01-24 12:17:24,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:24,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 17 [2018-01-24 12:17:24,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 12:17:24,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 12:17:24,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:17:24,177 INFO L87 Difference]: Start difference. First operand 156 states and 164 transitions. Second operand 17 states. [2018-01-24 12:17:24,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:24,447 INFO L93 Difference]: Finished difference Result 320 states and 354 transitions. [2018-01-24 12:17:24,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 12:17:24,448 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 175 [2018-01-24 12:17:24,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:24,449 INFO L225 Difference]: With dead ends: 320 [2018-01-24 12:17:24,449 INFO L226 Difference]: Without dead ends: 221 [2018-01-24 12:17:24,450 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2018-01-24 12:17:24,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-24 12:17:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 197. [2018-01-24 12:17:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-24 12:17:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 210 transitions. [2018-01-24 12:17:24,485 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 210 transitions. Word has length 175 [2018-01-24 12:17:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:24,485 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 210 transitions. [2018-01-24 12:17:24,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 12:17:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 210 transitions. [2018-01-24 12:17:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-01-24 12:17:24,487 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:24,487 INFO L322 BasicCegarLoop]: trace histogram [14, 13, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:24,488 INFO L371 AbstractCegarLoop]: === Iteration 25 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:24,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1015807450, now seen corresponding path program 3 times [2018-01-24 12:17:24,488 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:24,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:24,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:24,489 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:17:24,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:24,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 686 trivial. 0 not checked. [2018-01-24 12:17:24,704 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:24,704 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-24 12:17:24,710 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:17:24,729 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:17:24,736 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:17:24,737 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:24,742 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2018-01-24 12:17:24,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:17:24,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2018-01-24 12:17:24,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:17:24,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:17:24,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:17:24,835 INFO L87 Difference]: Start difference. First operand 197 states and 210 transitions. Second operand 11 states. [2018-01-24 12:17:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:25,039 INFO L93 Difference]: Finished difference Result 238 states and 257 transitions. [2018-01-24 12:17:25,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 12:17:25,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2018-01-24 12:17:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:25,042 INFO L225 Difference]: With dead ends: 238 [2018-01-24 12:17:25,042 INFO L226 Difference]: Without dead ends: 224 [2018-01-24 12:17:25,043 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2018-01-24 12:17:25,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-24 12:17:25,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 200. [2018-01-24 12:17:25,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-01-24 12:17:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 215 transitions. [2018-01-24 12:17:25,079 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 215 transitions. Word has length 232 [2018-01-24 12:17:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:25,080 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 215 transitions. [2018-01-24 12:17:25,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:17:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 215 transitions. [2018-01-24 12:17:25,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-01-24 12:17:25,082 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:25,082 INFO L322 BasicCegarLoop]: trace histogram [18, 16, 12, 12, 12, 12, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:25,082 INFO L371 AbstractCegarLoop]: === Iteration 26 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:25,082 INFO L82 PathProgramCache]: Analyzing trace with hash -532996239, now seen corresponding path program 1 times [2018-01-24 12:17:25,083 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:25,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:25,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:25,084 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:17:25,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:25,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1118 trivial. 0 not checked. [2018-01-24 12:17:25,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:25,351 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-24 12:17:25,360 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:25,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 779 proven. 10 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2018-01-24 12:17:25,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:25,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-01-24 12:17:25,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 12:17:25,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 12:17:25,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:17:25,669 INFO L87 Difference]: Start difference. First operand 200 states and 215 transitions. Second operand 18 states. [2018-01-24 12:17:25,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:25,911 INFO L93 Difference]: Finished difference Result 319 states and 349 transitions. [2018-01-24 12:17:25,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:17:25,911 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 289 [2018-01-24 12:17:25,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:25,912 INFO L225 Difference]: With dead ends: 319 [2018-01-24 12:17:25,913 INFO L226 Difference]: Without dead ends: 207 [2018-01-24 12:17:25,913 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2018-01-24 12:17:25,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-24 12:17:25,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 198. [2018-01-24 12:17:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-24 12:17:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 208 transitions. [2018-01-24 12:17:25,935 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 208 transitions. Word has length 289 [2018-01-24 12:17:25,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:25,935 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 208 transitions. [2018-01-24 12:17:25,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 12:17:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 208 transitions. [2018-01-24 12:17:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-01-24 12:17:25,937 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:25,937 INFO L322 BasicCegarLoop]: trace histogram [22, 22, 15, 15, 15, 15, 15, 15, 15, 15, 15, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:25,937 INFO L371 AbstractCegarLoop]: === Iteration 27 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:25,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1059600550, now seen corresponding path program 2 times [2018-01-24 12:17:25,937 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:25,937 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:25,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:25,938 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:25,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:25,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 1933 trivial. 0 not checked. [2018-01-24 12:17:26,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:26,296 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:26,301 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:17:26,323 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:26,380 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:26,390 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:26,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 1284 proven. 24 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2018-01-24 12:17:26,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:26,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2018-01-24 12:17:26,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:17:26,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:17:26,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:17:26,572 INFO L87 Difference]: Start difference. First operand 198 states and 208 transitions. Second operand 21 states. [2018-01-24 12:17:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:26,888 INFO L93 Difference]: Finished difference Result 357 states and 386 transitions. [2018-01-24 12:17:26,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 12:17:26,888 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 359 [2018-01-24 12:17:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:26,889 INFO L225 Difference]: With dead ends: 357 [2018-01-24 12:17:26,889 INFO L226 Difference]: Without dead ends: 271 [2018-01-24 12:17:26,890 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 12:17:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-01-24 12:17:26,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 243. [2018-01-24 12:17:26,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-24 12:17:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 257 transitions. [2018-01-24 12:17:26,919 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 257 transitions. Word has length 359 [2018-01-24 12:17:26,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:26,919 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 257 transitions. [2018-01-24 12:17:26,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 12:17:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 257 transitions. [2018-01-24 12:17:26,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-01-24 12:17:26,921 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:26,921 INFO L322 BasicCegarLoop]: trace histogram [30, 26, 22, 22, 22, 22, 22, 18, 18, 18, 18, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:26,921 INFO L371 AbstractCegarLoop]: === Iteration 28 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:26,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1405874031, now seen corresponding path program 3 times [2018-01-24 12:17:26,921 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:26,922 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:26,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:26,922 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:17:26,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:26,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3483 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 3271 trivial. 0 not checked. [2018-01-24 12:17:27,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:27,407 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:27,419 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:17:27,459 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:17:27,468 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:17:27,481 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:17:27,495 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:17:27,540 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:17:27,545 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:27,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:27,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3483 backedges. 973 proven. 21 refuted. 0 times theorem prover too weak. 2489 trivial. 0 not checked. [2018-01-24 12:17:27,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:27,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-01-24 12:17:27,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 12:17:27,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 12:17:27,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:17:27,802 INFO L87 Difference]: Start difference. First operand 243 states and 257 transitions. Second operand 18 states. [2018-01-24 12:17:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:28,350 INFO L93 Difference]: Finished difference Result 359 states and 403 transitions. [2018-01-24 12:17:28,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 12:17:28,350 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 441 [2018-01-24 12:17:28,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:28,353 INFO L225 Difference]: With dead ends: 359 [2018-01-24 12:17:28,353 INFO L226 Difference]: Without dead ends: 340 [2018-01-24 12:17:28,353 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-01-24 12:17:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-01-24 12:17:28,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 266. [2018-01-24 12:17:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-01-24 12:17:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 288 transitions. [2018-01-24 12:17:28,389 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 288 transitions. Word has length 441 [2018-01-24 12:17:28,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:28,390 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 288 transitions. [2018-01-24 12:17:28,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 12:17:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 288 transitions. [2018-01-24 12:17:28,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-01-24 12:17:28,392 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:28,393 INFO L322 BasicCegarLoop]: trace histogram [35, 35, 26, 26, 26, 26, 26, 26, 26, 26, 26, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:28,393 INFO L371 AbstractCegarLoop]: === Iteration 29 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:28,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1260936207, now seen corresponding path program 4 times [2018-01-24 12:17:28,393 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:28,393 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:28,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:28,394 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:17:28,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:28,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5401 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 5131 trivial. 0 not checked. [2018-01-24 12:17:28,930 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:28,930 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:28,935 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 12:17:29,065 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:29,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5401 backedges. 3198 proven. 44 refuted. 0 times theorem prover too weak. 2159 trivial. 0 not checked. [2018-01-24 12:17:29,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:29,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-01-24 12:17:29,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 12:17:29,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 12:17:29,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-01-24 12:17:29,513 INFO L87 Difference]: Start difference. First operand 266 states and 288 transitions. Second operand 25 states. [2018-01-24 12:17:30,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:30,055 INFO L93 Difference]: Finished difference Result 682 states and 824 transitions. [2018-01-24 12:17:30,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 12:17:30,056 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 530 [2018-01-24 12:17:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:30,061 INFO L225 Difference]: With dead ends: 682 [2018-01-24 12:17:30,061 INFO L226 Difference]: Without dead ends: 553 [2018-01-24 12:17:30,063 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=294, Invalid=1266, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 12:17:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-01-24 12:17:30,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 317. [2018-01-24 12:17:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-01-24 12:17:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 344 transitions. [2018-01-24 12:17:30,123 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 344 transitions. Word has length 530 [2018-01-24 12:17:30,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:30,124 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 344 transitions. [2018-01-24 12:17:30,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 12:17:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 344 transitions. [2018-01-24 12:17:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2018-01-24 12:17:30,127 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:30,127 INFO L322 BasicCegarLoop]: trace histogram [45, 39, 35, 35, 35, 35, 35, 29, 29, 29, 29, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:30,127 INFO L371 AbstractCegarLoop]: === Iteration 30 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:30,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1579835560, now seen corresponding path program 5 times [2018-01-24 12:17:30,127 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:30,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:30,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:30,128 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:17:30,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:30,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7993 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 7658 trivial. 0 not checked. [2018-01-24 12:17:30,971 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:30,971 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:30,977 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 12:17:31,015 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:31,023 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:31,032 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:31,063 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:31,166 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:31,492 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:32,044 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:34,014 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:34,020 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:34,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7993 backedges. 4046 proven. 128 refuted. 0 times theorem prover too weak. 3819 trivial. 0 not checked. [2018-01-24 12:17:34,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:34,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2018-01-24 12:17:34,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 12:17:34,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 12:17:34,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:17:34,391 INFO L87 Difference]: Start difference. First operand 317 states and 344 transitions. Second operand 27 states. [2018-01-24 12:17:35,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:35,019 INFO L93 Difference]: Finished difference Result 513 states and 565 transitions. [2018-01-24 12:17:35,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-24 12:17:35,020 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 624 [2018-01-24 12:17:35,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:35,021 INFO L225 Difference]: With dead ends: 513 [2018-01-24 12:17:35,022 INFO L226 Difference]: Without dead ends: 353 [2018-01-24 12:17:35,023 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=327, Invalid=1929, Unknown=0, NotChecked=0, Total=2256 [2018-01-24 12:17:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-01-24 12:17:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 334. [2018-01-24 12:17:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-01-24 12:17:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 355 transitions. [2018-01-24 12:17:35,063 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 355 transitions. Word has length 624 [2018-01-24 12:17:35,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:35,064 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 355 transitions. [2018-01-24 12:17:35,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 12:17:35,064 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 355 transitions. [2018-01-24 12:17:35,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2018-01-24 12:17:35,068 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:35,068 INFO L322 BasicCegarLoop]: trace histogram [51, 45, 40, 40, 40, 40, 40, 34, 34, 34, 34, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:35,069 INFO L371 AbstractCegarLoop]: === Iteration 31 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:35,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1723936527, now seen corresponding path program 6 times [2018-01-24 12:17:35,069 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:35,069 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:35,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:35,070 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:17:35,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:35,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10474 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 10067 trivial. 0 not checked. [2018-01-24 12:17:36,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:36,019 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:36,025 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-24 12:17:36,063 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:17:36,068 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:17:36,073 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:17:36,083 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:17:36,094 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:17:36,171 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:17:36,332 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:17:36,772 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:17:38,119 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:17:39,000 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:17:41,935 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:17:41,942 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:41,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10474 backedges. 2178 proven. 38 refuted. 0 times theorem prover too weak. 8258 trivial. 0 not checked. [2018-01-24 12:17:42,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:42,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2018-01-24 12:17:42,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 12:17:42,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 12:17:42,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-01-24 12:17:42,481 INFO L87 Difference]: Start difference. First operand 334 states and 355 transitions. Second operand 22 states. [2018-01-24 12:17:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:42,865 INFO L93 Difference]: Finished difference Result 544 states and 620 transitions. [2018-01-24 12:17:42,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-24 12:17:42,865 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 704 [2018-01-24 12:17:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:42,869 INFO L225 Difference]: With dead ends: 544 [2018-01-24 12:17:42,869 INFO L226 Difference]: Without dead ends: 525 [2018-01-24 12:17:42,871 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2018-01-24 12:17:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-01-24 12:17:42,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 357. [2018-01-24 12:17:42,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-01-24 12:17:42,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 387 transitions. [2018-01-24 12:17:42,932 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 387 transitions. Word has length 704 [2018-01-24 12:17:42,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:42,933 INFO L432 AbstractCegarLoop]: Abstraction has 357 states and 387 transitions. [2018-01-24 12:17:42,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 12:17:42,933 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 387 transitions. [2018-01-24 12:17:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2018-01-24 12:17:42,940 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:42,940 INFO L322 BasicCegarLoop]: trace histogram [57, 57, 45, 45, 45, 45, 45, 45, 45, 45, 45, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:42,940 INFO L371 AbstractCegarLoop]: === Iteration 32 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:42,941 INFO L82 PathProgramCache]: Analyzing trace with hash 324361008, now seen corresponding path program 7 times [2018-01-24 12:17:42,941 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:42,941 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:42,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:42,942 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:17:42,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:43,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 14684 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 14198 trivial. 0 not checked. [2018-01-24 12:17:43,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:43,972 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:43,977 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:44,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 14684 backedges. 8198 proven. 70 refuted. 0 times theorem prover too weak. 6416 trivial. 0 not checked. [2018-01-24 12:17:44,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:44,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2018-01-24 12:17:44,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-24 12:17:44,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-24 12:17:44,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2018-01-24 12:17:44,755 INFO L87 Difference]: Start difference. First operand 357 states and 387 transitions. Second operand 30 states. [2018-01-24 12:17:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:45,352 INFO L93 Difference]: Finished difference Result 969 states and 1196 transitions. [2018-01-24 12:17:45,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-24 12:17:45,352 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 814 [2018-01-24 12:17:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:45,356 INFO L225 Difference]: With dead ends: 969 [2018-01-24 12:17:45,356 INFO L226 Difference]: Without dead ends: 812 [2018-01-24 12:17:45,358 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 800 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=440, Invalid=1912, Unknown=0, NotChecked=0, Total=2352 [2018-01-24 12:17:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-01-24 12:17:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 414. [2018-01-24 12:17:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-01-24 12:17:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 449 transitions. [2018-01-24 12:17:45,414 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 449 transitions. Word has length 814 [2018-01-24 12:17:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:45,415 INFO L432 AbstractCegarLoop]: Abstraction has 414 states and 449 transitions. [2018-01-24 12:17:45,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-24 12:17:45,415 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 449 transitions. [2018-01-24 12:17:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2018-01-24 12:17:45,421 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:45,421 INFO L322 BasicCegarLoop]: trace histogram [70, 62, 57, 57, 57, 57, 57, 49, 49, 49, 49, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 11, 11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:45,421 INFO L371 AbstractCegarLoop]: === Iteration 33 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:17:45,422 INFO L82 PathProgramCache]: Analyzing trace with hash -362362842, now seen corresponding path program 8 times [2018-01-24 12:17:45,422 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:45,422 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:45,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:45,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:45,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:45,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-24 12:17:45,677 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 12:17:45,681 INFO L168 Benchmark]: Toolchain (without parser) took 46166.27 ms. Allocated memory was 306.7 MB in the beginning and 1.2 GB in the end (delta: 869.3 MB). Free memory was 267.6 MB in the beginning and 304.8 MB in the end (delta: -37.2 MB). Peak memory consumption was 832.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:45,683 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 306.7 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:17:45,683 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.91 ms. Allocated memory is still 306.7 MB. Free memory was 267.6 MB in the beginning and 258.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:45,683 INFO L168 Benchmark]: Boogie Preprocessor took 33.29 ms. Allocated memory is still 306.7 MB. Free memory was 258.6 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:45,684 INFO L168 Benchmark]: RCFGBuilder took 282.42 ms. Allocated memory is still 306.7 MB. Free memory was 256.6 MB in the beginning and 236.5 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:45,684 INFO L168 Benchmark]: TraceAbstraction took 45660.59 ms. Allocated memory was 306.7 MB in the beginning and 1.2 GB in the end (delta: 869.3 MB). Free memory was 236.5 MB in the beginning and 304.8 MB in the end (delta: -68.3 MB). Peak memory consumption was 801.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:45,686 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.16 ms. Allocated memory is still 306.7 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 182.91 ms. Allocated memory is still 306.7 MB. Free memory was 267.6 MB in the beginning and 258.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.29 ms. Allocated memory is still 306.7 MB. Free memory was 258.6 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 282.42 ms. Allocated memory is still 306.7 MB. Free memory was 256.6 MB in the beginning and 236.5 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 45660.59 ms. Allocated memory was 306.7 MB in the beginning and 1.2 GB in the end (delta: 869.3 MB). Free memory was 236.5 MB in the beginning and 304.8 MB in the end (delta: -68.3 MB). Peak memory consumption was 801.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-17-45-693.csv Completed graceful shutdown