java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:43:34,962 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:43:34,964 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:43:34,979 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:43:34,979 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:43:34,980 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:43:34,981 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:43:34,983 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:43:34,985 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:43:34,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:43:34,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:43:34,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:43:34,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:43:34,989 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:43:34,990 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:43:34,992 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:43:34,994 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:43:34,996 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:43:34,998 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:43:34,999 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:43:35,001 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:43:35,001 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:43:35,002 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:43:35,003 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:43:35,003 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:43:35,005 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:43:35,005 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:43:35,006 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:43:35,006 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:43:35,006 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:43:35,007 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:43:35,007 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:43:35,015 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:43:35,015 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:43:35,016 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:43:35,016 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:43:35,016 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:43:35,017 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:43:35,017 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:43:35,017 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:43:35,018 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:43:35,018 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:43:35,018 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:43:35,018 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:43:35,018 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:43:35,019 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:43:35,019 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:43:35,019 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:43:35,020 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:43:35,020 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:43:35,020 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:43:35,020 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:43:35,020 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:43:35,021 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:43:35,021 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:43:35,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:43:35,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:43:35,021 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:43:35,022 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:43:35,022 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:43:35,022 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:43:35,022 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:43:35,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:43:35,023 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:43:35,025 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:43:35,025 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:43:35,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:43:35,076 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:43:35,080 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:43:35,082 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:43:35,082 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:43:35,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-01-29 23:43:35,259 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:43:35,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:43:35,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:43:35,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:43:35,268 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:43:35,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:43:35" (1/1) ... [2018-01-29 23:43:35,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@572fd3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:35, skipping insertion in model container [2018-01-29 23:43:35,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:43:35" (1/1) ... [2018-01-29 23:43:35,286 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:43:35,321 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:43:35,431 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:43:35,446 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:43:35,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:35 WrapperNode [2018-01-29 23:43:35,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:43:35,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:43:35,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:43:35,454 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:43:35,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:35" (1/1) ... [2018-01-29 23:43:35,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:35" (1/1) ... [2018-01-29 23:43:35,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:35" (1/1) ... [2018-01-29 23:43:35,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:35" (1/1) ... [2018-01-29 23:43:35,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:35" (1/1) ... [2018-01-29 23:43:35,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:35" (1/1) ... [2018-01-29 23:43:35,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:35" (1/1) ... [2018-01-29 23:43:35,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:43:35,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:43:35,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:43:35,485 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:43:35,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:35" (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-29 23:43:35,532 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:43:35,532 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:43:35,533 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-29 23:43:35,533 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:43:35,533 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 23:43:35,533 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 23:43:35,533 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:43:35,533 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:43:35,533 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:43:35,533 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-29 23:43:35,533 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-29 23:43:35,533 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:43:35,534 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-29 23:43:35,534 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:43:35,534 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:43:35,534 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:43:35,759 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:43:35,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:43:35 BoogieIcfgContainer [2018-01-29 23:43:35,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:43:35,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:43:35,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:43:35,765 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:43:35,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:43:35" (1/3) ... [2018-01-29 23:43:35,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515a33e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:43:35, skipping insertion in model container [2018-01-29 23:43:35,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:35" (2/3) ... [2018-01-29 23:43:35,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515a33e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:43:35, skipping insertion in model container [2018-01-29 23:43:35,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:43:35" (3/3) ... [2018-01-29 23:43:35,768 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-01-29 23:43:35,775 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:43:35,781 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-29 23:43:35,816 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:43:35,816 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:43:35,817 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:43:35,817 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:43:35,817 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:43:35,817 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:43:35,817 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:43:35,817 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:43:35,818 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:43:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-01-29 23:43:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-29 23:43:35,840 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:35,842 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:35,842 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:35,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1820134341, now seen corresponding path program 1 times [2018-01-29 23:43:35,847 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:35,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:35,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:35,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:35,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:35,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:35,976 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-29 23:43:35,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:35,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:43:35,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-29 23:43:35,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-29 23:43:35,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-29 23:43:35,993 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 2 states. [2018-01-29 23:43:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:36,021 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2018-01-29 23:43:36,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-29 23:43:36,022 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-29 23:43:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:36,030 INFO L225 Difference]: With dead ends: 140 [2018-01-29 23:43:36,030 INFO L226 Difference]: Without dead ends: 76 [2018-01-29 23:43:36,034 INFO L553 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-29 23:43:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-29 23:43:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-29 23:43:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-29 23:43:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-01-29 23:43:36,149 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 18 [2018-01-29 23:43:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:36,149 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-01-29 23:43:36,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-29 23:43:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-01-29 23:43:36,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-29 23:43:36,150 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:36,151 INFO L350 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-29 23:43:36,151 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:36,151 INFO L82 PathProgramCache]: Analyzing trace with hash -176739127, now seen corresponding path program 1 times [2018-01-29 23:43:36,151 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:36,151 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:36,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:36,153 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:36,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:36,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:36,284 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-29 23:43:36,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:36,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:43:36,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:43:36,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:43:36,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:43:36,288 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 5 states. [2018-01-29 23:43:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:36,436 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-29 23:43:36,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:43:36,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-29 23:43:36,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:36,438 INFO L225 Difference]: With dead ends: 76 [2018-01-29 23:43:36,438 INFO L226 Difference]: Without dead ends: 72 [2018-01-29 23:43:36,439 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:43:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-29 23:43:36,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-29 23:43:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-29 23:43:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-01-29 23:43:36,445 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 21 [2018-01-29 23:43:36,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:36,446 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-01-29 23:43:36,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:43:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-01-29 23:43:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-29 23:43:36,446 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:36,446 INFO L350 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-29 23:43:36,447 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:36,447 INFO L82 PathProgramCache]: Analyzing trace with hash -176739126, now seen corresponding path program 1 times [2018-01-29 23:43:36,447 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:36,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:36,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:36,449 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:36,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:36,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:36,583 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-29 23:43:36,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:36,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:43:36,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:43:36,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:43:36,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:43:36,585 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 6 states. [2018-01-29 23:43:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:36,835 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2018-01-29 23:43:36,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:43:36,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-29 23:43:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:36,838 INFO L225 Difference]: With dead ends: 133 [2018-01-29 23:43:36,838 INFO L226 Difference]: Without dead ends: 132 [2018-01-29 23:43:36,838 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:43:36,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-29 23:43:36,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 83. [2018-01-29 23:43:36,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-29 23:43:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-01-29 23:43:36,853 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 21 [2018-01-29 23:43:36,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:36,853 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-01-29 23:43:36,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:43:36,853 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-01-29 23:43:36,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-29 23:43:36,854 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:36,854 INFO L350 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] [2018-01-29 23:43:36,855 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:36,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1916522015, now seen corresponding path program 1 times [2018-01-29 23:43:36,855 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:36,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:36,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:36,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:36,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:36,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:36,939 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-29 23:43:36,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:36,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:43:36,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:43:36,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:43:36,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:43:36,941 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 4 states. [2018-01-29 23:43:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:36,985 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-01-29 23:43:36,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:43:36,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-29 23:43:36,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:36,987 INFO L225 Difference]: With dead ends: 83 [2018-01-29 23:43:36,987 INFO L226 Difference]: Without dead ends: 80 [2018-01-29 23:43:36,987 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:43:36,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-29 23:43:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-29 23:43:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-29 23:43:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-01-29 23:43:36,994 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 28 [2018-01-29 23:43:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:36,994 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-01-29 23:43:36,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:43:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-01-29 23:43:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-29 23:43:36,995 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:36,996 INFO L350 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] [2018-01-29 23:43:36,996 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1916522016, now seen corresponding path program 1 times [2018-01-29 23:43:36,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:36,996 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:36,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:36,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:36,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:37,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:37,163 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-29 23:43:37,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:37,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:43:37,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:43:37,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:43:37,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:43:37,165 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 7 states. [2018-01-29 23:43:37,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:37,404 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2018-01-29 23:43:37,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:43:37,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-29 23:43:37,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:37,408 INFO L225 Difference]: With dead ends: 170 [2018-01-29 23:43:37,408 INFO L226 Difference]: Without dead ends: 137 [2018-01-29 23:43:37,409 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:43:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-29 23:43:37,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 111. [2018-01-29 23:43:37,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-29 23:43:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2018-01-29 23:43:37,422 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 28 [2018-01-29 23:43:37,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:37,422 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2018-01-29 23:43:37,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:43:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2018-01-29 23:43:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-29 23:43:37,424 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:37,424 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:37,424 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:37,424 INFO L82 PathProgramCache]: Analyzing trace with hash -226141911, now seen corresponding path program 1 times [2018-01-29 23:43:37,424 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:37,425 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:37,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:37,426 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:37,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:37,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:37,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:37,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:43:37,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:43:37,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:43:37,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:43:37,528 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 8 states. [2018-01-29 23:43:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:37,740 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2018-01-29 23:43:37,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:43:37,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-29 23:43:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:37,742 INFO L225 Difference]: With dead ends: 127 [2018-01-29 23:43:37,742 INFO L226 Difference]: Without dead ends: 126 [2018-01-29 23:43:37,743 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:43:37,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-29 23:43:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2018-01-29 23:43:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-29 23:43:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2018-01-29 23:43:37,753 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 28 [2018-01-29 23:43:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:37,754 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2018-01-29 23:43:37,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:43:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2018-01-29 23:43:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-29 23:43:37,755 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:37,755 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:37,755 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:37,755 INFO L82 PathProgramCache]: Analyzing trace with hash 901425558, now seen corresponding path program 1 times [2018-01-29 23:43:37,755 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:37,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:37,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:37,756 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:37,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:37,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:37,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:43:37,825 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-29 23:43:37,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:37,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:43:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:37,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:43:37,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-01-29 23:43:37,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:43:37,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:43:37,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:43:37,989 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 9 states. [2018-01-29 23:43:38,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:38,190 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2018-01-29 23:43:38,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:43:38,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-29 23:43:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:38,193 INFO L225 Difference]: With dead ends: 156 [2018-01-29 23:43:38,193 INFO L226 Difference]: Without dead ends: 119 [2018-01-29 23:43:38,194 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:43:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-29 23:43:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2018-01-29 23:43:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-29 23:43:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-01-29 23:43:38,203 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 34 [2018-01-29 23:43:38,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:38,203 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-01-29 23:43:38,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:43:38,204 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-01-29 23:43:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-29 23:43:38,205 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:38,205 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:38,205 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:38,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1984706335, now seen corresponding path program 1 times [2018-01-29 23:43:38,206 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:38,206 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:38,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:38,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:38,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:38,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:38,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:38,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 23:43:38,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:43:38,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:43:38,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:43:38,393 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 9 states. [2018-01-29 23:43:38,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:38,609 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-01-29 23:43:38,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:43:38,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-29 23:43:38,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:38,611 INFO L225 Difference]: With dead ends: 161 [2018-01-29 23:43:38,611 INFO L226 Difference]: Without dead ends: 128 [2018-01-29 23:43:38,611 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:43:38,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-29 23:43:38,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 99. [2018-01-29 23:43:38,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-29 23:43:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-01-29 23:43:38,620 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 35 [2018-01-29 23:43:38,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:38,621 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-01-29 23:43:38,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:43:38,621 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-01-29 23:43:38,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 23:43:38,622 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:38,622 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:38,623 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:38,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1461534442, now seen corresponding path program 1 times [2018-01-29 23:43:38,623 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:38,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:38,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:38,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:38,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:38,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:43:38,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:38,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 23:43:38,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:43:38,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:43:38,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:43:38,745 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 9 states. [2018-01-29 23:43:38,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:38,937 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2018-01-29 23:43:38,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:43:38,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-01-29 23:43:38,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:38,939 INFO L225 Difference]: With dead ends: 125 [2018-01-29 23:43:38,939 INFO L226 Difference]: Without dead ends: 121 [2018-01-29 23:43:38,940 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:43:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-29 23:43:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 100. [2018-01-29 23:43:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-29 23:43:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2018-01-29 23:43:38,955 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 39 [2018-01-29 23:43:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:38,956 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2018-01-29 23:43:38,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:43:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2018-01-29 23:43:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-29 23:43:38,957 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:38,957 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:38,957 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:38,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1937072529, now seen corresponding path program 1 times [2018-01-29 23:43:38,958 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:38,958 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:38,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:38,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:38,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:38,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:43:39,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:39,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:43:39,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:43:39,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:43:39,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:43:39,020 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 4 states. [2018-01-29 23:43:39,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:39,071 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-01-29 23:43:39,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:43:39,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-29 23:43:39,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:39,073 INFO L225 Difference]: With dead ends: 121 [2018-01-29 23:43:39,073 INFO L226 Difference]: Without dead ends: 120 [2018-01-29 23:43:39,073 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:43:39,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-29 23:43:39,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2018-01-29 23:43:39,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-29 23:43:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-01-29 23:43:39,080 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 40 [2018-01-29 23:43:39,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:39,081 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-01-29 23:43:39,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:43:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-01-29 23:43:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-29 23:43:39,082 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:39,082 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-01-29 23:43:39,082 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:39,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1331810199, now seen corresponding path program 1 times [2018-01-29 23:43:39,082 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:39,082 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:39,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:39,083 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:39,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:39,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:39,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:43:39,342 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-29 23:43:39,354 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:39,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:43:39,424 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-29 23:43:39,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:39,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:39,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-29 23:43:39,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 15 [2018-01-29 23:43:39,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:39,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:43:39,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-01-29 23:43:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:39,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:43:39,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-01-29 23:43:39,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 23:43:39,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 23:43:39,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:43:39,658 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 15 states. [2018-01-29 23:43:40,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:40,019 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-01-29 23:43:40,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:43:40,020 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-01-29 23:43:40,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:40,021 INFO L225 Difference]: With dead ends: 165 [2018-01-29 23:43:40,021 INFO L226 Difference]: Without dead ends: 132 [2018-01-29 23:43:40,022 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:43:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-29 23:43:40,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2018-01-29 23:43:40,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-29 23:43:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2018-01-29 23:43:40,028 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 41 [2018-01-29 23:43:40,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:40,028 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2018-01-29 23:43:40,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 23:43:40,029 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-01-29 23:43:40,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-29 23:43:40,030 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:40,030 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:40,030 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:40,030 INFO L82 PathProgramCache]: Analyzing trace with hash 387514716, now seen corresponding path program 1 times [2018-01-29 23:43:40,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:40,030 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:40,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:40,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:40,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:40,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:43:40,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:40,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:43:40,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:43:40,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:43:40,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:43:40,140 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 8 states. [2018-01-29 23:43:40,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:40,197 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2018-01-29 23:43:40,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:43:40,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-29 23:43:40,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:40,198 INFO L225 Difference]: With dead ends: 107 [2018-01-29 23:43:40,198 INFO L226 Difference]: Without dead ends: 106 [2018-01-29 23:43:40,198 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:43:40,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-29 23:43:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-29 23:43:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-29 23:43:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2018-01-29 23:43:40,206 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 45 [2018-01-29 23:43:40,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:40,206 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2018-01-29 23:43:40,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:43:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2018-01-29 23:43:40,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-29 23:43:40,207 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:40,207 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:40,207 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:40,207 INFO L82 PathProgramCache]: Analyzing trace with hash 387514717, now seen corresponding path program 1 times [2018-01-29 23:43:40,207 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:40,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:40,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:40,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:40,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:40,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:43:40,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:40,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 23:43:40,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:43:40,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:43:40,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:43:40,370 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand 10 states. [2018-01-29 23:43:40,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:40,742 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-01-29 23:43:40,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:43:40,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-29 23:43:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:40,743 INFO L225 Difference]: With dead ends: 106 [2018-01-29 23:43:40,743 INFO L226 Difference]: Without dead ends: 104 [2018-01-29 23:43:40,744 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:43:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-29 23:43:40,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-01-29 23:43:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-29 23:43:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2018-01-29 23:43:40,751 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 45 [2018-01-29 23:43:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:40,751 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2018-01-29 23:43:40,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:43:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-01-29 23:43:40,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-29 23:43:40,752 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:40,752 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:40,752 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:40,753 INFO L82 PathProgramCache]: Analyzing trace with hash 377971666, now seen corresponding path program 1 times [2018-01-29 23:43:40,753 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:40,753 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:40,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:40,769 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:40,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:40,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:43:41,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:41,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-29 23:43:41,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:43:41,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:43:41,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:43:41,143 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand 10 states. [2018-01-29 23:43:41,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:41,396 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-01-29 23:43:41,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:43:41,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-29 23:43:41,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:41,397 INFO L225 Difference]: With dead ends: 120 [2018-01-29 23:43:41,397 INFO L226 Difference]: Without dead ends: 115 [2018-01-29 23:43:41,397 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:43:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-29 23:43:41,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2018-01-29 23:43:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-29 23:43:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 108 transitions. [2018-01-29 23:43:41,403 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 108 transitions. Word has length 45 [2018-01-29 23:43:41,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:41,403 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 108 transitions. [2018-01-29 23:43:41,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:43:41,403 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2018-01-29 23:43:41,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 23:43:41,404 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:41,404 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:41,404 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:41,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1260510115, now seen corresponding path program 1 times [2018-01-29 23:43:41,404 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:41,404 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:41,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:41,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:41,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:41,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:43:41,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:41,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 23:43:41,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:43:41,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:43:41,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:43:41,628 INFO L87 Difference]: Start difference. First operand 105 states and 108 transitions. Second operand 9 states. [2018-01-29 23:43:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:41,860 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-01-29 23:43:41,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:43:41,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-01-29 23:43:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:41,861 INFO L225 Difference]: With dead ends: 105 [2018-01-29 23:43:41,862 INFO L226 Difference]: Without dead ends: 70 [2018-01-29 23:43:41,862 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:43:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-29 23:43:41,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-29 23:43:41,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-29 23:43:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-01-29 23:43:41,866 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 47 [2018-01-29 23:43:41,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:41,867 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-01-29 23:43:41,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:43:41,867 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-01-29 23:43:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 23:43:41,867 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:41,867 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 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-29 23:43:41,867 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:41,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1683917363, now seen corresponding path program 2 times [2018-01-29 23:43:41,868 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:41,868 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:41,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:41,868 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:41,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:41,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:41,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:43:41,951 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-29 23:43:41,959 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:43:41,976 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:43:41,981 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:43:41,982 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:43:41,984 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:43:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:42,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:43:42,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-01-29 23:43:42,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 23:43:42,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 23:43:42,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:43:42,076 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 15 states. [2018-01-29 23:43:42,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:42,261 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2018-01-29 23:43:42,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:43:42,262 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-01-29 23:43:42,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:42,262 INFO L225 Difference]: With dead ends: 161 [2018-01-29 23:43:42,263 INFO L226 Difference]: Without dead ends: 132 [2018-01-29 23:43:42,263 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-01-29 23:43:42,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-29 23:43:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-29 23:43:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-29 23:43:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-29 23:43:42,271 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 47 [2018-01-29 23:43:42,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:42,272 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-29 23:43:42,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 23:43:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-29 23:43:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 23:43:42,273 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:42,273 INFO L350 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2018-01-29 23:43:42,273 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:42,273 INFO L82 PathProgramCache]: Analyzing trace with hash -365721621, now seen corresponding path program 1 times [2018-01-29 23:43:42,273 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:42,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:42,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:42,274 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:43:42,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:42,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-29 23:43:42,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:42,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 23:43:42,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:43:42,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:43:42,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:43:42,414 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 9 states. [2018-01-29 23:43:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:42,602 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2018-01-29 23:43:42,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:43:42,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-01-29 23:43:42,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:42,603 INFO L225 Difference]: With dead ends: 121 [2018-01-29 23:43:42,603 INFO L226 Difference]: Without dead ends: 120 [2018-01-29 23:43:42,603 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:43:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-29 23:43:42,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2018-01-29 23:43:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-29 23:43:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2018-01-29 23:43:42,610 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 50 [2018-01-29 23:43:42,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:42,610 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2018-01-29 23:43:42,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:43:42,610 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2018-01-29 23:43:42,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 23:43:42,611 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:42,611 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:42,611 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:42,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1998969196, now seen corresponding path program 3 times [2018-01-29 23:43:42,611 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:42,612 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:42,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:42,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:42,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:42,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:42,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:43:42,832 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-29 23:43:42,837 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:43:42,851 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:43:42,858 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:43:42,859 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:43:42,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:43:42,876 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-29 23:43:42,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:42,885 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-29 23:43:42,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:42,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:42,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-29 23:43:42,925 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:42,928 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 16 treesize of output 19 [2018-01-29 23:43:42,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:42,940 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:42,941 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:42,942 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-29 23:43:42,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:42,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:43:42,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-01-29 23:43:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:43:43,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:43:43,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 21 [2018-01-29 23:43:43,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 23:43:43,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 23:43:43,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-01-29 23:43:43,168 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand 22 states. [2018-01-29 23:43:45,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:45,154 INFO L93 Difference]: Finished difference Result 163 states and 168 transitions. [2018-01-29 23:43:45,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-29 23:43:45,154 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-01-29 23:43:45,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:45,155 INFO L225 Difference]: With dead ends: 163 [2018-01-29 23:43:45,155 INFO L226 Difference]: Without dead ends: 139 [2018-01-29 23:43:45,156 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=535, Invalid=2327, Unknown=0, NotChecked=0, Total=2862 [2018-01-29 23:43:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-29 23:43:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 120. [2018-01-29 23:43:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-29 23:43:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2018-01-29 23:43:45,165 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 54 [2018-01-29 23:43:45,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:45,165 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2018-01-29 23:43:45,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 23:43:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2018-01-29 23:43:45,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-29 23:43:45,166 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:45,166 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:45,166 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:45,166 INFO L82 PathProgramCache]: Analyzing trace with hash 253281953, now seen corresponding path program 1 times [2018-01-29 23:43:45,166 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:45,166 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:45,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:45,167 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:43:45,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:45,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-29 23:43:45,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:43:45,243 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-29 23:43:45,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:45,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:43:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-29 23:43:45,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:43:45,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-01-29 23:43:45,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:43:45,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:43:45,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:43:45,359 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand 11 states. [2018-01-29 23:43:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:45,494 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2018-01-29 23:43:45,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:43:45,494 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-01-29 23:43:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:45,495 INFO L225 Difference]: With dead ends: 151 [2018-01-29 23:43:45,496 INFO L226 Difference]: Without dead ends: 132 [2018-01-29 23:43:45,496 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:43:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-29 23:43:45,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 119. [2018-01-29 23:43:45,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-29 23:43:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2018-01-29 23:43:45,504 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 56 [2018-01-29 23:43:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:45,504 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2018-01-29 23:43:45,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:43:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-01-29 23:43:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-29 23:43:45,505 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:45,505 INFO L350 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:45,505 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:45,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1409227191, now seen corresponding path program 1 times [2018-01-29 23:43:45,505 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:45,506 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:45,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:45,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:45,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:45,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:45,688 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-29 23:43:45,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:45,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:43:45,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:43:45,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:43:45,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:43:45,689 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand 7 states. [2018-01-29 23:43:46,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:46,009 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-01-29 23:43:46,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:43:46,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2018-01-29 23:43:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:46,010 INFO L225 Difference]: With dead ends: 119 [2018-01-29 23:43:46,010 INFO L226 Difference]: Without dead ends: 118 [2018-01-29 23:43:46,011 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:43:46,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-29 23:43:46,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-01-29 23:43:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-29 23:43:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2018-01-29 23:43:46,024 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 58 [2018-01-29 23:43:46,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:46,024 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2018-01-29 23:43:46,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:43:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2018-01-29 23:43:46,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-29 23:43:46,025 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:46,026 INFO L350 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:46,026 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:46,026 INFO L82 PathProgramCache]: Analyzing trace with hash -736369936, now seen corresponding path program 1 times [2018-01-29 23:43:46,026 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:46,026 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:46,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:46,027 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:46,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:46,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-29 23:43:46,295 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:43:46,295 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-29 23:43:46,301 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:46,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:43:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-29 23:43:46,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:43:46,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 18 [2018-01-29 23:43:46,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 23:43:46,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 23:43:46,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:43:46,497 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand 19 states. [2018-01-29 23:43:47,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:47,119 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-01-29 23:43:47,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-29 23:43:47,119 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-01-29 23:43:47,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:47,120 INFO L225 Difference]: With dead ends: 129 [2018-01-29 23:43:47,120 INFO L226 Difference]: Without dead ends: 128 [2018-01-29 23:43:47,121 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=346, Invalid=1460, Unknown=0, NotChecked=0, Total=1806 [2018-01-29 23:43:47,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-29 23:43:47,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2018-01-29 23:43:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-29 23:43:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2018-01-29 23:43:47,127 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 59 [2018-01-29 23:43:47,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:47,128 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2018-01-29 23:43:47,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 23:43:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2018-01-29 23:43:47,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-29 23:43:47,128 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:47,129 INFO L350 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:47,129 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:47,129 INFO L82 PathProgramCache]: Analyzing trace with hash -951990287, now seen corresponding path program 1 times [2018-01-29 23:43:47,129 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:47,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:47,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:47,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:47,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:47,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:47,855 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:43:47,855 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-29 23:43:47,860 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:47,882 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:43:47,892 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-29 23:43:47,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:47,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:47,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-29 23:43:47,954 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:47,955 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:47,955 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-29 23:43:47,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:47,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:47,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-29 23:43:48,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-29 23:43:48,072 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-29 23:43:48,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:48,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:48,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:48,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-29 23:43:48,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-29 23:43:48,122 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-29 23:43:48,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:48,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:48,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:48,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-01-29 23:43:48,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2018-01-29 23:43:48,386 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-01-29 23:43:48,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 30 [2018-01-29 23:43:48,394 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:48,401 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:48,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-01-29 23:43:48,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:48,415 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 19 [2018-01-29 23:43:48,415 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:48,422 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:48,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:48,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-29 23:43:48,437 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:70, output treesize:50 [2018-01-29 23:43:48,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2018-01-29 23:43:48,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:48,534 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:43:48,535 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:48,535 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:43:48,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 81 [2018-01-29 23:43:48,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:48,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 12 [2018-01-29 23:43:48,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:48,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:48,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:48,557 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:88, output treesize:15 [2018-01-29 23:43:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:48,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:43:48,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 38 [2018-01-29 23:43:48,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-29 23:43:48,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-29 23:43:48,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1258, Unknown=21, NotChecked=0, Total=1406 [2018-01-29 23:43:48,613 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand 38 states. [2018-01-29 23:43:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:52,619 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2018-01-29 23:43:52,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-29 23:43:52,620 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 64 [2018-01-29 23:43:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:52,620 INFO L225 Difference]: With dead ends: 130 [2018-01-29 23:43:52,620 INFO L226 Difference]: Without dead ends: 85 [2018-01-29 23:43:52,621 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=476, Invalid=3888, Unknown=58, NotChecked=0, Total=4422 [2018-01-29 23:43:52,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-29 23:43:52,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2018-01-29 23:43:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-29 23:43:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-01-29 23:43:52,627 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 64 [2018-01-29 23:43:52,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:52,627 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-01-29 23:43:52,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-29 23:43:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-01-29 23:43:52,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-29 23:43:52,627 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:52,628 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-29 23:43:52,628 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:52,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1241565140, now seen corresponding path program 2 times [2018-01-29 23:43:52,628 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:52,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:52,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:52,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:52,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:52,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-29 23:43:53,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:43:53,162 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-29 23:43:53,167 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:43:53,182 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:43:53,190 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:43:53,192 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:43:53,196 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:43:53,210 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-29 23:43:53,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 23:43:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-01-29 23:43:53,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:43:53,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 20 [2018-01-29 23:43:53,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 23:43:53,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 23:43:53,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:43:53,348 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 21 states. [2018-01-29 23:43:54,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:54,073 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-01-29 23:43:54,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 23:43:54,073 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-01-29 23:43:54,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:54,074 INFO L225 Difference]: With dead ends: 95 [2018-01-29 23:43:54,074 INFO L226 Difference]: Without dead ends: 84 [2018-01-29 23:43:54,075 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=215, Invalid=1345, Unknown=0, NotChecked=0, Total=1560 [2018-01-29 23:43:54,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-29 23:43:54,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-29 23:43:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-29 23:43:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-01-29 23:43:54,081 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 69 [2018-01-29 23:43:54,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:54,081 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-01-29 23:43:54,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 23:43:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-01-29 23:43:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-29 23:43:54,081 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:54,082 INFO L350 BasicCegarLoop]: trace histogram [4, 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, 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-29 23:43:54,082 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:43:54,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1032811122, now seen corresponding path program 2 times [2018-01-29 23:43:54,082 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:54,082 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:54,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:54,083 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:43:54,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:54,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:55,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:43:55,086 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-29 23:43:55,092 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:43:55,105 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:43:55,112 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:43:55,114 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:43:55,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:43:55,221 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-29 23:43:55,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:43:55,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:55,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:55,276 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-29 23:43:55,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-29 23:43:55,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-29 23:43:55,393 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-29 23:43:55,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-29 23:43:55,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-29 23:43:55,435 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-29 23:43:55,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-01-29 23:43:56,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2018-01-29 23:43:56,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-01-29 23:43:56,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 29 treesize of output 38 [2018-01-29 23:43:56,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2018-01-29 23:43:56,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:56,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:56,316 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:56,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-01-29 23:43:56,333 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:56,334 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-01-29 23:43:56,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:56,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:56,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 46 [2018-01-29 23:43:56,338 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:56,350 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:56,363 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:56,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:56,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-29 23:43:56,390 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:98, output treesize:79 [2018-01-29 23:43:56,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 94 [2018-01-29 23:43:56,595 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:56,596 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:56,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:56,599 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:56,600 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:56,601 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:43:56,602 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:56,603 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:43:56,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 168 [2018-01-29 23:43:56,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:56,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 19 [2018-01-29 23:43:56,666 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:56,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:56,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:56,686 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:129, output treesize:10 [2018-01-29 23:43:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 13 proven. 13 refuted. 21 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:56,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:43:56,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 56 [2018-01-29 23:43:56,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-29 23:43:56,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-29 23:43:56,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2778, Unknown=49, NotChecked=0, Total=3080 [2018-01-29 23:43:56,809 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 56 states. [2018-01-29 23:43:57,998 WARN L146 SmtUtils]: Spent 297ms on a formula simplification. DAG size of input: 47 DAG size of output 36 [2018-01-29 23:43:58,443 WARN L146 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 51 DAG size of output 37 [2018-01-29 23:44:02,365 WARN L146 SmtUtils]: Spent 329ms on a formula simplification. DAG size of input: 80 DAG size of output 53 [2018-01-29 23:44:02,951 WARN L146 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 82 DAG size of output 74 [2018-01-29 23:44:03,745 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 78 DAG size of output 57 [2018-01-29 23:44:05,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:05,294 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2018-01-29 23:44:05,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-01-29 23:44:05,294 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 83 [2018-01-29 23:44:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:05,296 INFO L225 Difference]: With dead ends: 170 [2018-01-29 23:44:05,296 INFO L226 Difference]: Without dead ends: 154 [2018-01-29 23:44:05,299 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4335 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1283, Invalid=14522, Unknown=197, NotChecked=0, Total=16002 [2018-01-29 23:44:05,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-29 23:44:05,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2018-01-29 23:44:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-29 23:44:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-01-29 23:44:05,323 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 83 [2018-01-29 23:44:05,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:05,324 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-01-29 23:44:05,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-01-29 23:44:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-01-29 23:44:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-29 23:44:05,326 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:05,326 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:44:05,326 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:44:05,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1359615464, now seen corresponding path program 3 times [2018-01-29 23:44:05,327 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:05,327 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:05,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:05,328 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:44:05,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:05,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-29 23:44:05,512 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:05,512 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-29 23:44:05,521 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:44:05,543 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:44:05,552 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:44:05,559 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:44:05,567 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:44:05,568 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:44:05,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:05,732 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-29 23:44:05,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:05,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 18 [2018-01-29 23:44:05,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 23:44:05,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 23:44:05,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:44:05,754 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 18 states. [2018-01-29 23:44:06,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:06,026 INFO L93 Difference]: Finished difference Result 217 states and 223 transitions. [2018-01-29 23:44:06,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 23:44:06,027 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 89 [2018-01-29 23:44:06,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:06,027 INFO L225 Difference]: With dead ends: 217 [2018-01-29 23:44:06,028 INFO L226 Difference]: Without dead ends: 131 [2018-01-29 23:44:06,028 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=898, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 23:44:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-29 23:44:06,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 104. [2018-01-29 23:44:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-29 23:44:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2018-01-29 23:44:06,038 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 89 [2018-01-29 23:44:06,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:06,039 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2018-01-29 23:44:06,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 23:44:06,039 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-01-29 23:44:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-01-29 23:44:06,040 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:06,040 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:44:06,040 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:44:06,040 INFO L82 PathProgramCache]: Analyzing trace with hash 71567515, now seen corresponding path program 4 times [2018-01-29 23:44:06,040 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:06,040 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:06,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:06,041 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:44:06,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:06,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-29 23:44:06,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:06,166 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-29 23:44:06,170 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:44:06,197 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:44:06,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:06,301 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-29 23:44:06,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:06,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2018-01-29 23:44:06,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 23:44:06,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 23:44:06,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-01-29 23:44:06,322 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand 26 states. [2018-01-29 23:44:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:06,644 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2018-01-29 23:44:06,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-29 23:44:06,645 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 96 [2018-01-29 23:44:06,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:06,646 INFO L225 Difference]: With dead ends: 134 [2018-01-29 23:44:06,646 INFO L226 Difference]: Without dead ends: 124 [2018-01-29 23:44:06,646 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=1719, Unknown=0, NotChecked=0, Total=2070 [2018-01-29 23:44:06,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-29 23:44:06,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 97. [2018-01-29 23:44:06,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-29 23:44:06,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-01-29 23:44:06,656 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 96 [2018-01-29 23:44:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:06,656 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-01-29 23:44:06,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 23:44:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-01-29 23:44:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-01-29 23:44:06,657 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:06,657 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:44:06,657 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:44:06,657 INFO L82 PathProgramCache]: Analyzing trace with hash 956728007, now seen corresponding path program 5 times [2018-01-29 23:44:06,657 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:06,657 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:06,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:06,658 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:44:06,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:06,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-29 23:44:07,084 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:07,084 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-29 23:44:07,092 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:44:07,102 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:07,106 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:07,112 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:07,126 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:07,128 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:44:07,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:07,194 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 24 proven. 24 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-29 23:44:07,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:07,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-01-29 23:44:07,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 23:44:07,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 23:44:07,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-01-29 23:44:07,215 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 22 states. [2018-01-29 23:44:07,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:07,401 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2018-01-29 23:44:07,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 23:44:07,401 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 96 [2018-01-29 23:44:07,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:07,402 INFO L225 Difference]: With dead ends: 137 [2018-01-29 23:44:07,402 INFO L226 Difference]: Without dead ends: 106 [2018-01-29 23:44:07,403 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=922, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 23:44:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-29 23:44:07,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-01-29 23:44:07,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-29 23:44:07,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-01-29 23:44:07,412 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 96 [2018-01-29 23:44:07,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:07,413 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-01-29 23:44:07,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 23:44:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-01-29 23:44:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-29 23:44:07,413 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:07,413 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:44:07,413 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:44:07,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1604998831, now seen corresponding path program 6 times [2018-01-29 23:44:07,414 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:07,414 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:07,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:07,414 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:44:07,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:07,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:09,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:09,039 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-29 23:44:09,044 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:44:09,057 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:44:09,061 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:44:09,064 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:44:09,069 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:44:09,074 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:44:09,076 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:44:09,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:09,082 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-29 23:44:09,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 23:44:09,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:09,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:09,144 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-29 23:44:09,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-29 23:44:09,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-29 23:44:09,269 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-29 23:44:09,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-29 23:44:09,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-29 23:44:09,318 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-29 23:44:09,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-01-29 23:44:11,510 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 62 DAG size of output 54 [2018-01-29 23:44:11,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 70 [2018-01-29 23:44:11,530 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-01-29 23:44:11,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 45 [2018-01-29 23:44:11,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2018-01-29 23:44:11,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 52 [2018-01-29 23:44:11,560 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,571 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,583 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,592 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-01-29 23:44:11,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,617 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 34 [2018-01-29 23:44:11,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 52 [2018-01-29 23:44:11,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,626 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,627 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-01-29 23:44:11,630 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,643 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,650 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,663 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-01-29 23:44:11,697 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:124, output treesize:106 [2018-01-29 23:44:11,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 111 [2018-01-29 23:44:11,925 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,927 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:44:11,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,929 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,929 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,930 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,931 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,931 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:44:11,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 203 [2018-01-29 23:44:11,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 11 [2018-01-29 23:44:11,964 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,975 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:160, output treesize:10 [2018-01-29 23:44:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 29 refuted. 39 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-29 23:44:12,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:12,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 29] total 63 [2018-01-29 23:44:12,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-01-29 23:44:12,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-01-29 23:44:12,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3627, Unknown=87, NotChecked=0, Total=3906 [2018-01-29 23:44:12,096 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 63 states. [2018-01-29 23:44:18,511 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 83 DAG size of output 55 [2018-01-29 23:44:18,754 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 83 DAG size of output 56 [2018-01-29 23:44:20,336 WARN L146 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 89 DAG size of output 62 [2018-01-29 23:44:21,359 WARN L146 SmtUtils]: Spent 448ms on a formula simplification. DAG size of input: 97 DAG size of output 73 [2018-01-29 23:44:21,644 WARN L146 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 76 DAG size of output 59 [2018-01-29 23:44:22,206 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 76 DAG size of output 62 [2018-01-29 23:44:23,040 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 107 DAG size of output 62 [2018-01-29 23:44:26,920 WARN L146 SmtUtils]: Spent 2180ms on a formula simplification. DAG size of input: 116 DAG size of output 80 [2018-01-29 23:44:30,925 WARN L146 SmtUtils]: Spent 599ms on a formula simplification. DAG size of input: 117 DAG size of output 76 [2018-01-29 23:44:33,740 WARN L146 SmtUtils]: Spent 471ms on a formula simplification. DAG size of input: 82 DAG size of output 68 [2018-01-29 23:44:34,744 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 105 DAG size of output 64 [2018-01-29 23:44:36,022 WARN L146 SmtUtils]: Spent 758ms on a formula simplification. DAG size of input: 100 DAG size of output 85 [2018-01-29 23:44:36,575 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 83 DAG size of output 71 [2018-01-29 23:44:37,562 WARN L146 SmtUtils]: Spent 233ms on a formula simplification. DAG size of input: 122 DAG size of output 66 [2018-01-29 23:44:42,097 WARN L143 SmtUtils]: Spent 169ms on a formula simplification that was a NOOP. DAG size: 61 [2018-01-29 23:44:43,389 WARN L143 SmtUtils]: Spent 208ms on a formula simplification that was a NOOP. DAG size: 71 [2018-01-29 23:44:51,435 WARN L146 SmtUtils]: Spent 835ms on a formula simplification. DAG size of input: 94 DAG size of output 74 [2018-01-29 23:44:57,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:57,138 INFO L93 Difference]: Finished difference Result 264 states and 273 transitions. [2018-01-29 23:44:57,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-01-29 23:44:57,138 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 102 [2018-01-29 23:44:57,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:57,139 INFO L225 Difference]: With dead ends: 264 [2018-01-29 23:44:57,139 INFO L226 Difference]: Without dead ends: 145 [2018-01-29 23:44:57,143 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10387 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=1800, Invalid=32259, Unknown=723, NotChecked=0, Total=34782 [2018-01-29 23:44:57,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-29 23:44:57,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 123. [2018-01-29 23:44:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-29 23:44:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2018-01-29 23:44:57,158 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 102 [2018-01-29 23:44:57,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:57,158 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2018-01-29 23:44:57,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-01-29 23:44:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2018-01-29 23:44:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-29 23:44:57,159 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:57,159 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:44:57,159 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:44:57,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1942351588, now seen corresponding path program 7 times [2018-01-29 23:44:57,159 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:57,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:57,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:57,160 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:44:57,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:57,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 27 proven. 67 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-29 23:44:57,400 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:57,400 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-29 23:44:57,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:57,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 54 proven. 24 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-29 23:44:57,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:57,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-01-29 23:44:57,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-29 23:44:57,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-29 23:44:57,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 23:44:57,618 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand 34 states. [2018-01-29 23:44:58,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:58,072 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-01-29 23:44:58,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-29 23:44:58,105 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 115 [2018-01-29 23:44:58,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:58,106 INFO L225 Difference]: With dead ends: 159 [2018-01-29 23:44:58,106 INFO L226 Difference]: Without dead ends: 149 [2018-01-29 23:44:58,106 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=575, Invalid=3085, Unknown=0, NotChecked=0, Total=3660 [2018-01-29 23:44:58,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-29 23:44:58,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 116. [2018-01-29 23:44:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-29 23:44:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-01-29 23:44:58,122 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 115 [2018-01-29 23:44:58,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:58,122 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-01-29 23:44:58,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-29 23:44:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-01-29 23:44:58,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-29 23:44:58,123 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:58,123 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:44:58,123 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:44:58,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2001418824, now seen corresponding path program 8 times [2018-01-29 23:44:58,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:58,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:58,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:58,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:58,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:58,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 32 proven. 56 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-29 23:44:58,362 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:58,362 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-29 23:44:58,367 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:44:58,382 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:58,392 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:58,394 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:44:58,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 54 proven. 44 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-29 23:44:58,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:58,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-01-29 23:44:58,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-29 23:44:58,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-29 23:44:58,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2018-01-29 23:44:58,649 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 37 states. [2018-01-29 23:44:59,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:59,037 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-01-29 23:44:59,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-29 23:44:59,038 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 115 [2018-01-29 23:44:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:59,038 INFO L225 Difference]: With dead ends: 165 [2018-01-29 23:44:59,038 INFO L226 Difference]: Without dead ends: 128 [2018-01-29 23:44:59,039 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=485, Invalid=2595, Unknown=0, NotChecked=0, Total=3080 [2018-01-29 23:44:59,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-29 23:44:59,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-01-29 23:44:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-29 23:44:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-01-29 23:44:59,056 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 115 [2018-01-29 23:44:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:59,056 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-01-29 23:44:59,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-29 23:44:59,056 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-01-29 23:44:59,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-01-29 23:44:59,057 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:59,057 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:44:59,057 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-29 23:44:59,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1314288366, now seen corresponding path program 9 times [2018-01-29 23:44:59,057 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:59,057 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:59,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:59,058 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:44:59,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:59,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:01,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:45:01,120 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-29 23:45:01,125 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:45:01,139 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:45:01,144 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:45:01,148 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:45:01,155 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:45:01,166 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:45:01,174 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:45:01,176 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:45:01,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:45:01,465 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-29 23:45:01,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:01,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:01,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:45:01,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:01,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:01,545 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-29 23:45:01,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:01,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:01,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-29 23:45:01,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-29 23:45:01,717 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-29 23:45:01,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:01,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:01,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:01,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-29 23:45:01,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-29 23:45:01,770 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-29 23:45:01,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:01,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:01,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:01,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-01-29 23:45:07,783 WARN L146 SmtUtils]: Spent 492ms on a formula simplification. DAG size of input: 78 DAG size of output 69 [2018-01-29 23:45:07,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 88 [2018-01-29 23:45:07,868 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-01-29 23:45:07,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 43 treesize of output 52 [2018-01-29 23:45:07,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 54 [2018-01-29 23:45:07,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 56 [2018-01-29 23:45:07,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 63 [2018-01-29 23:45:07,981 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:08,010 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:08,037 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:08,065 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:08,091 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:08,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 98 [2018-01-29 23:45:08,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:08,153 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 49 [2018-01-29 23:45:08,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:08,158 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:08,159 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 70 [2018-01-29 23:45:08,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:08,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:08,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:08,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 80 [2018-01-29 23:45:08,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:08,185 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:08,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:08,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:08,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2018-01-29 23:45:08,193 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:08,208 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:08,219 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:08,229 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:08,247 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:08,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:08,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-01-29 23:45:08,295 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 12 variables, input treesize:157, output treesize:140 [2018-01-29 23:45:08,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 128 [2018-01-29 23:45:08,675 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:45:08,696 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:08,700 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:08,701 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:08,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 151 [2018-01-29 23:45:08,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:08,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 18 [2018-01-29 23:45:08,733 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:08,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:08,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:08,744 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:182, output treesize:7 [2018-01-29 23:45:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 54 proven. 25 refuted. 89 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:08,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:45:08,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 80 [2018-01-29 23:45:08,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-01-29 23:45:08,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-01-29 23:45:08,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=5670, Unknown=211, NotChecked=0, Total=6320 [2018-01-29 23:45:08,907 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 80 states. [2018-01-29 23:45:23,454 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 82 DAG size of output 62 [2018-01-29 23:45:25,250 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 86 DAG size of output 66 [2018-01-29 23:45:27,560 WARN L146 SmtUtils]: Spent 934ms on a formula simplification. DAG size of input: 95 DAG size of output 73 [2018-01-29 23:45:32,181 WARN L146 SmtUtils]: Spent 381ms on a formula simplification. DAG size of input: 104 DAG size of output 72 [2018-01-29 23:45:33,033 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 90 DAG size of output 70 [2018-01-29 23:45:33,380 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 78 DAG size of output 68 [2018-01-29 23:45:35,032 WARN L146 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 92 DAG size of output 72 [2018-01-29 23:45:47,600 WARN L146 SmtUtils]: Spent 4033ms on a formula simplification. DAG size of input: 114 DAG size of output 79 [2018-01-29 23:45:48,198 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 79 DAG size of output 70 Received shutdown request... [2018-01-29 23:45:51,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-01-29 23:45:51,998 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:45:52,003 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:45:52,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:45:52 BoogieIcfgContainer [2018-01-29 23:45:52,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:45:52,004 INFO L168 Benchmark]: Toolchain (without parser) took 136744.80 ms. Allocated memory was 304.6 MB in the beginning and 638.1 MB in the end (delta: 333.4 MB). Free memory was 263.7 MB in the beginning and 349.9 MB in the end (delta: -86.2 MB). Peak memory consumption was 247.2 MB. Max. memory is 5.3 GB. [2018-01-29 23:45:52,005 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:45:52,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.90 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 253.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:45:52,006 INFO L168 Benchmark]: Boogie Preprocessor took 30.71 ms. Allocated memory is still 304.6 MB. Free memory was 253.7 MB in the beginning and 251.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:45:52,006 INFO L168 Benchmark]: RCFGBuilder took 275.53 ms. Allocated memory is still 304.6 MB. Free memory was 251.7 MB in the beginning and 229.1 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-01-29 23:45:52,006 INFO L168 Benchmark]: TraceAbstraction took 136242.19 ms. Allocated memory was 304.6 MB in the beginning and 638.1 MB in the end (delta: 333.4 MB). Free memory was 229.1 MB in the beginning and 349.9 MB in the end (delta: -120.7 MB). Peak memory consumption was 212.7 MB. Max. memory is 5.3 GB. [2018-01-29 23:45:52,008 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 304.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 189.90 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 253.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.71 ms. Allocated memory is still 304.6 MB. Free memory was 253.7 MB in the beginning and 251.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 275.53 ms. Allocated memory is still 304.6 MB. Free memory was 251.7 MB in the beginning and 229.1 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 136242.19 ms. Allocated memory was 304.6 MB in the beginning and 638.1 MB in the end (delta: 333.4 MB). Free memory was 229.1 MB in the beginning and 349.9 MB in the end (delta: -120.7 MB). Peak memory consumption was 212.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and interpolant automaton (currently 106 states, 80 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 118. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 79 locations, 19 error locations. TIMEOUT Result, 136.1s OverallTime, 31 OverallIterations, 6 TraceHistogramMax, 109.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1672 SDtfs, 5306 SDslu, 12255 SDs, 0 SdLazy, 14385 SolverSat, 1369 SolverUnsat, 2276 SolverUnknown, 0 SolverNotchecked, 32.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2218 GetRequests, 1077 SyntacticMatches, 37 SemanticMatches, 1103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28824 ImplicationChecksByTransitivity, 91.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 421 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 24.6s InterpolantComputationTime, 3030 NumberOfCodeBlocks, 3009 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 2983 ConstructedInterpolants, 218 QuantifiedInterpolants, 2690252 SizeOfPredicates, 213 NumberOfNonLiveVariables, 3542 ConjunctsInSsa, 339 ConjunctsInUnsatCore, 47 InterpolantComputations, 16 PerfectInterpolantSequences, 990/1968 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-45-52-016.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-45-52-016.csv Completed graceful shutdown