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/memsafety/960521-1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:08:13,927 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:08:13,928 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:08:13,946 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:08:13,946 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:08:13,947 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:08:13,948 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:08:13,950 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:08:13,952 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:08:13,953 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:08:13,954 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:08:13,954 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:08:13,955 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:08:13,956 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:08:13,957 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:08:13,969 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:08:13,971 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:08:13,973 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:08:13,974 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:08:13,975 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:08:13,983 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:08:13,983 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:08:13,983 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:08:13,989 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:08:13,990 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:08:13,991 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:08:13,991 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:08:13,992 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:08:13,992 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:08:13,992 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:08:13,993 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:08:13,993 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:08:14,012 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:08:14,015 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:08:14,016 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:08:14,016 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:08:14,017 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:08:14,017 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:08:14,017 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:08:14,018 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:08:14,018 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:08:14,018 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:08:14,018 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:08:14,018 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:08:14,018 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:08:14,019 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:08:14,019 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:08:14,019 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:08:14,019 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:08:14,019 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:08:14,020 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:08:14,020 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:08:14,020 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:08:14,020 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:08:14,020 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:08:14,020 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:08:14,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:08:14,021 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:08:14,021 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:08:14,021 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:08:14,021 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:08:14,021 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:08:14,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:08:14,022 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:08:14,023 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:08:14,023 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:08:14,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:08:14,079 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:08:14,084 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:08:14,085 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:08:14,085 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:08:14,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i [2018-01-31 09:08:14,258 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:08:14,270 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 09:08:14,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:08:14,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:08:14,279 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:08:14,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:08:14" (1/1) ... [2018-01-31 09:08:14,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21155711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:14, skipping insertion in model container [2018-01-31 09:08:14,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:08:14" (1/1) ... [2018-01-31 09:08:14,303 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:08:14,363 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:08:14,537 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:08:14,562 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:08:14,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:14 WrapperNode [2018-01-31 09:08:14,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:08:14,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:08:14,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:08:14,580 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:08:14,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:14" (1/1) ... [2018-01-31 09:08:14,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:14" (1/1) ... [2018-01-31 09:08:14,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:14" (1/1) ... [2018-01-31 09:08:14,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:14" (1/1) ... [2018-01-31 09:08:14,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:14" (1/1) ... [2018-01-31 09:08:14,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:14" (1/1) ... [2018-01-31 09:08:14,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:14" (1/1) ... [2018-01-31 09:08:14,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:08:14,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:08:14,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:08:14,631 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:08:14,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:14" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:08:14,696 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:08:14,696 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:08:14,696 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 09:08:14,697 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:08:14,697 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:08:14,697 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:08:14,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:08:14,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:08:14,697 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:08:14,698 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 09:08:14,698 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 09:08:14,698 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 09:08:14,698 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:08:14,698 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:08:14,698 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:08:15,192 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:08:15,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:08:15 BoogieIcfgContainer [2018-01-31 09:08:15,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:08:15,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:08:15,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:08:15,197 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:08:15,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:08:14" (1/3) ... [2018-01-31 09:08:15,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694c21bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:08:15, skipping insertion in model container [2018-01-31 09:08:15,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:08:14" (2/3) ... [2018-01-31 09:08:15,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694c21bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:08:15, skipping insertion in model container [2018-01-31 09:08:15,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:08:15" (3/3) ... [2018-01-31 09:08:15,202 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-free.i [2018-01-31 09:08:15,212 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:08:15,222 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-31 09:08:15,270 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:08:15,270 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:08:15,270 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:08:15,270 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:08:15,270 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:08:15,271 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:08:15,271 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:08:15,271 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:08:15,272 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:08:15,290 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-31 09:08:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-31 09:08:15,299 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:15,300 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:08:15,301 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:15,306 INFO L82 PathProgramCache]: Analyzing trace with hash 608637057, now seen corresponding path program 1 times [2018-01-31 09:08:15,308 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:15,309 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:15,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:15,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:15,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:15,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:08:15,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:08:15,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:08:15,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:08:15,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:08:15,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:08:15,590 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 5 states. [2018-01-31 09:08:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:16,186 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-01-31 09:08:16,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:08:16,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-31 09:08:16,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:16,229 INFO L225 Difference]: With dead ends: 99 [2018-01-31 09:08:16,229 INFO L226 Difference]: Without dead ends: 60 [2018-01-31 09:08:16,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:08:16,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-31 09:08:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-31 09:08:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-31 09:08:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-01-31 09:08:16,266 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 17 [2018-01-31 09:08:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:16,267 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-01-31 09:08:16,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:08:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-01-31 09:08:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-31 09:08:16,268 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:16,268 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:08:16,269 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:16,269 INFO L82 PathProgramCache]: Analyzing trace with hash 608637058, now seen corresponding path program 1 times [2018-01-31 09:08:16,269 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:16,269 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:16,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:16,270 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:16,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:16,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:08:16,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:08:16,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:08:16,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:08:16,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:08:16,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:08:16,457 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 6 states. [2018-01-31 09:08:16,683 WARN L143 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 17 [2018-01-31 09:08:16,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:16,864 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-01-31 09:08:16,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:08:16,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-31 09:08:16,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:16,866 INFO L225 Difference]: With dead ends: 60 [2018-01-31 09:08:16,866 INFO L226 Difference]: Without dead ends: 59 [2018-01-31 09:08:16,867 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:08:16,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-31 09:08:16,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-31 09:08:16,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-31 09:08:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-31 09:08:16,875 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 17 [2018-01-31 09:08:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:16,875 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-31 09:08:16,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:08:16,876 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-31 09:08:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 09:08:16,877 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:16,877 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:08:16,877 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:16,877 INFO L82 PathProgramCache]: Analyzing trace with hash 186914476, now seen corresponding path program 1 times [2018-01-31 09:08:16,877 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:16,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:16,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:16,879 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:16,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:16,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:08:16,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:08:16,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:08:16,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:08:16,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:08:16,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:08:16,997 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 4 states. [2018-01-31 09:08:17,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:17,382 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-01-31 09:08:17,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:08:17,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-31 09:08:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:17,384 INFO L225 Difference]: With dead ends: 59 [2018-01-31 09:08:17,384 INFO L226 Difference]: Without dead ends: 56 [2018-01-31 09:08:17,385 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:08:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-31 09:08:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-31 09:08:17,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-31 09:08:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-01-31 09:08:17,391 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 24 [2018-01-31 09:08:17,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:17,392 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-01-31 09:08:17,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:08:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-01-31 09:08:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 09:08:17,393 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:17,393 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:08:17,393 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:17,393 INFO L82 PathProgramCache]: Analyzing trace with hash 186914477, now seen corresponding path program 1 times [2018-01-31 09:08:17,393 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:17,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:17,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:17,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:17,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:17,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:08:17,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:08:17,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:08:17,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:08:17,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:08:17,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:08:17,705 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 7 states. [2018-01-31 09:08:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:17,876 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-01-31 09:08:17,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:08:17,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-31 09:08:17,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:17,880 INFO L225 Difference]: With dead ends: 94 [2018-01-31 09:08:17,880 INFO L226 Difference]: Without dead ends: 65 [2018-01-31 09:08:17,880 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:08:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-31 09:08:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-01-31 09:08:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-31 09:08:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-31 09:08:17,888 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 24 [2018-01-31 09:08:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:17,888 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-31 09:08:17,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:08:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-31 09:08:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-31 09:08:17,889 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:17,889 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:08:17,889 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:17,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1679529059, now seen corresponding path program 1 times [2018-01-31 09:08:17,890 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:17,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:17,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:17,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:17,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:17,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:08:18,241 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:18,242 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:08:18,255 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:18,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:18,365 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-31 09:08:18,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:18,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:18,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-31 09:08:18,528 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-31 09:08:18,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:18,539 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-31 09:08:18,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-01-31 09:08:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:08:18,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:18,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-01-31 09:08:18,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 09:08:18,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 09:08:18,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:08:18,840 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 13 states. [2018-01-31 09:08:19,164 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-01-31 09:08:19,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:19,306 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-01-31 09:08:19,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:08:19,307 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-01-31 09:08:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:19,308 INFO L225 Difference]: With dead ends: 100 [2018-01-31 09:08:19,309 INFO L226 Difference]: Without dead ends: 71 [2018-01-31 09:08:19,309 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-01-31 09:08:19,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-31 09:08:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-01-31 09:08:19,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-31 09:08:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-01-31 09:08:19,318 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 30 [2018-01-31 09:08:19,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:19,319 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-01-31 09:08:19,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 09:08:19,320 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-01-31 09:08:19,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 09:08:19,321 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:19,321 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:08:19,321 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:19,321 INFO L82 PathProgramCache]: Analyzing trace with hash -294686311, now seen corresponding path program 2 times [2018-01-31 09:08:19,322 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:19,322 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:19,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:19,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:19,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:19,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:08:19,875 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:19,875 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:08:19,881 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:08:19,901 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:19,906 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:19,907 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:19,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:19,915 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-31 09:08:19,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:19,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:08:19,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:19,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:19,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-31 09:08:19,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:08:19,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:08:19,971 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-31 09:08:19,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:19,981 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-31 09:08:19,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:19,989 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-31 09:08:19,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-01-31 09:08:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:08:20,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:20,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-01-31 09:08:20,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 09:08:20,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 09:08:20,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-01-31 09:08:20,271 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 20 states. [2018-01-31 09:08:21,387 WARN L146 SmtUtils]: Spent 322ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-01-31 09:08:22,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:22,086 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-01-31 09:08:22,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 09:08:22,086 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-01-31 09:08:22,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:22,087 INFO L225 Difference]: With dead ends: 105 [2018-01-31 09:08:22,087 INFO L226 Difference]: Without dead ends: 76 [2018-01-31 09:08:22,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2018-01-31 09:08:22,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-31 09:08:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-01-31 09:08:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-31 09:08:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-01-31 09:08:22,097 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 36 [2018-01-31 09:08:22,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:22,098 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-01-31 09:08:22,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 09:08:22,098 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-01-31 09:08:22,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 09:08:22,099 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:22,099 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-01-31 09:08:22,099 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:22,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1273956393, now seen corresponding path program 1 times [2018-01-31 09:08:22,100 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:22,100 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:22,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:22,101 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:08:22,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:22,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:08:22,256 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:22,256 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:08:22,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:22,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:08:22,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:22,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-31 09:08:22,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 09:08:22,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 09:08:22,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-31 09:08:22,562 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 17 states. [2018-01-31 09:08:22,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:22,714 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-01-31 09:08:22,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 09:08:22,715 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-01-31 09:08:22,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:22,716 INFO L225 Difference]: With dead ends: 110 [2018-01-31 09:08:22,716 INFO L226 Difference]: Without dead ends: 82 [2018-01-31 09:08:22,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-01-31 09:08:22,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-31 09:08:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2018-01-31 09:08:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-31 09:08:22,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-01-31 09:08:22,727 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 45 [2018-01-31 09:08:22,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:22,727 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-01-31 09:08:22,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 09:08:22,727 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-01-31 09:08:22,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-31 09:08:22,728 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:22,729 INFO L351 BasicCegarLoop]: trace histogram [5, 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] [2018-01-31 09:08:22,729 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:22,729 INFO L82 PathProgramCache]: Analyzing trace with hash -225814477, now seen corresponding path program 2 times [2018-01-31 09:08:22,729 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:22,729 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:22,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:22,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:22,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:22,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:08:22,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:22,977 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:08:22,982 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:08:23,001 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:23,011 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:23,015 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:23,034 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-31 09:08:23,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:23,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:08:23,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-31 09:08:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-31 09:08:23,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:08:23,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2018-01-31 09:08:23,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 09:08:23,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 09:08:23,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-01-31 09:08:23,420 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 19 states. [2018-01-31 09:08:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:24,222 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2018-01-31 09:08:24,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 09:08:24,222 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-01-31 09:08:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:24,225 INFO L225 Difference]: With dead ends: 111 [2018-01-31 09:08:24,225 INFO L226 Difference]: Without dead ends: 83 [2018-01-31 09:08:24,226 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=310, Invalid=1250, Unknown=0, NotChecked=0, Total=1560 [2018-01-31 09:08:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-31 09:08:24,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2018-01-31 09:08:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-31 09:08:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-01-31 09:08:24,241 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 51 [2018-01-31 09:08:24,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:24,241 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-01-31 09:08:24,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 09:08:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-01-31 09:08:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-31 09:08:24,243 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:24,243 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:08:24,244 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:24,244 INFO L82 PathProgramCache]: Analyzing trace with hash -921316877, now seen corresponding path program 1 times [2018-01-31 09:08:24,244 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:24,244 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:24,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:24,245 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:08:24,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:24,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:08:24,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:24,538 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:08:24,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:24,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:08:24,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:24,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-01-31 09:08:24,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 09:08:24,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 09:08:24,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-01-31 09:08:24,755 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 25 states. [2018-01-31 09:08:25,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:25,331 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-01-31 09:08:25,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 09:08:25,332 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 63 [2018-01-31 09:08:25,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:25,333 INFO L225 Difference]: With dead ends: 114 [2018-01-31 09:08:25,333 INFO L226 Difference]: Without dead ends: 89 [2018-01-31 09:08:25,334 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=360, Invalid=830, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 09:08:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-31 09:08:25,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2018-01-31 09:08:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 09:08:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-01-31 09:08:25,354 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 63 [2018-01-31 09:08:25,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:25,354 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-01-31 09:08:25,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 09:08:25,354 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-01-31 09:08:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 09:08:25,356 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:25,356 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:08:25,356 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:25,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1713697661, now seen corresponding path program 2 times [2018-01-31 09:08:25,356 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:25,356 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:25,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:25,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:25,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:25,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:08:25,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:25,719 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:08:25,724 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:08:25,745 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:25,753 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:25,755 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:25,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:08:26,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:26,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-31 09:08:26,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 09:08:26,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 09:08:26,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-01-31 09:08:26,059 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 29 states. [2018-01-31 09:08:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:26,441 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-01-31 09:08:26,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 09:08:26,442 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 69 [2018-01-31 09:08:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:26,443 INFO L225 Difference]: With dead ends: 120 [2018-01-31 09:08:26,443 INFO L226 Difference]: Without dead ends: 95 [2018-01-31 09:08:26,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 09:08:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-31 09:08:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2018-01-31 09:08:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-31 09:08:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-01-31 09:08:26,456 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 69 [2018-01-31 09:08:26,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:26,456 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-01-31 09:08:26,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 09:08:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-01-31 09:08:26,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-31 09:08:26,458 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:26,458 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:08:26,458 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:26,458 INFO L82 PathProgramCache]: Analyzing trace with hash -307018361, now seen corresponding path program 3 times [2018-01-31 09:08:26,458 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:26,458 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:26,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:26,459 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:08:26,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:26,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:08:27,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:27,218 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:08:27,223 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:08:27,238 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:08:27,242 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:08:27,243 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:27,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:27,266 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-31 09:08:27,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:27,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:08:27,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-31 09:08:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-01-31 09:08:27,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:27,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 25 [2018-01-31 09:08:27,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 09:08:27,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 09:08:27,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2018-01-31 09:08:27,567 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 25 states. [2018-01-31 09:08:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:28,628 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-01-31 09:08:28,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-31 09:08:28,628 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2018-01-31 09:08:28,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:28,629 INFO L225 Difference]: With dead ends: 132 [2018-01-31 09:08:28,629 INFO L226 Difference]: Without dead ends: 107 [2018-01-31 09:08:28,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=630, Invalid=2340, Unknown=0, NotChecked=0, Total=2970 [2018-01-31 09:08:28,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-31 09:08:28,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2018-01-31 09:08:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-31 09:08:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-01-31 09:08:28,643 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 75 [2018-01-31 09:08:28,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:28,643 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-01-31 09:08:28,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 09:08:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-01-31 09:08:28,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-31 09:08:28,644 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:28,644 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 3, 3, 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-31 09:08:28,644 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:28,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1495560775, now seen corresponding path program 4 times [2018-01-31 09:08:28,644 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:28,644 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:28,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:28,645 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:08:28,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:28,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-31 09:08:29,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:29,188 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:08:29,194 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 09:08:29,235 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:29,240 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:29,265 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-31 09:08:29,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:29,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:29,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 09:08:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 140 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:08:30,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:30,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 46 [2018-01-31 09:08:30,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-31 09:08:30,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-31 09:08:30,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1846, Unknown=0, NotChecked=0, Total=2070 [2018-01-31 09:08:30,092 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 46 states. [2018-01-31 09:08:31,191 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 28 DAG size of output 22 [2018-01-31 09:08:32,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:32,705 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-01-31 09:08:32,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-31 09:08:32,741 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 87 [2018-01-31 09:08:32,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:32,742 INFO L225 Difference]: With dead ends: 150 [2018-01-31 09:08:32,742 INFO L226 Difference]: Without dead ends: 119 [2018-01-31 09:08:32,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1008, Invalid=6302, Unknown=0, NotChecked=0, Total=7310 [2018-01-31 09:08:32,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-31 09:08:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-01-31 09:08:32,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-31 09:08:32,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-01-31 09:08:32,753 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 87 [2018-01-31 09:08:32,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:32,753 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-01-31 09:08:32,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-31 09:08:32,753 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-01-31 09:08:32,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-31 09:08:32,754 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:32,755 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 4, 4, 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] [2018-01-31 09:08:32,755 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:32,755 INFO L82 PathProgramCache]: Analyzing trace with hash -552939513, now seen corresponding path program 5 times [2018-01-31 09:08:32,755 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:32,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:32,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:32,756 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:08:32,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:32,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-31 09:08:33,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:33,167 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:08:33,174 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 09:08:33,184 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:33,185 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:33,187 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:33,189 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:33,192 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:33,194 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:33,198 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:33,205 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:33,213 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:33,248 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:33,250 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:33,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-31 09:08:33,916 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:33,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-01-31 09:08:33,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-31 09:08:33,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-31 09:08:33,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 09:08:33,918 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 41 states. [2018-01-31 09:08:34,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:34,359 INFO L93 Difference]: Finished difference Result 160 states and 162 transitions. [2018-01-31 09:08:34,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-31 09:08:34,360 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-01-31 09:08:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:34,360 INFO L225 Difference]: With dead ends: 160 [2018-01-31 09:08:34,361 INFO L226 Difference]: Without dead ends: 123 [2018-01-31 09:08:34,361 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=964, Invalid=2458, Unknown=0, NotChecked=0, Total=3422 [2018-01-31 09:08:34,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-31 09:08:34,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2018-01-31 09:08:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-31 09:08:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-01-31 09:08:34,367 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 99 [2018-01-31 09:08:34,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:34,367 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-01-31 09:08:34,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-31 09:08:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-01-31 09:08:34,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-31 09:08:34,368 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:34,368 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 4, 4, 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] [2018-01-31 09:08:34,368 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:34,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1688898415, now seen corresponding path program 6 times [2018-01-31 09:08:34,369 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:34,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:34,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:34,370 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:08:34,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:34,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-31 09:08:35,129 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:35,129 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:08:35,135 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 09:08:35,155 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:08:35,168 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:08:35,182 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:08:35,183 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:35,186 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:35,189 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-31 09:08:35,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:35,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:08:35,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-31 09:08:36,513 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-01-31 09:08:36,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:08:36,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [24] total 32 [2018-01-31 09:08:36,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-31 09:08:36,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-31 09:08:36,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2018-01-31 09:08:36,534 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 32 states. [2018-01-31 09:08:37,447 WARN L143 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 18 [2018-01-31 09:08:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:38,604 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-01-31 09:08:38,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-31 09:08:38,605 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 105 [2018-01-31 09:08:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:38,606 INFO L225 Difference]: With dead ends: 165 [2018-01-31 09:08:38,607 INFO L226 Difference]: Without dead ends: 128 [2018-01-31 09:08:38,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1127, Invalid=4423, Unknown=0, NotChecked=0, Total=5550 [2018-01-31 09:08:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-31 09:08:38,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2018-01-31 09:08:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-31 09:08:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-01-31 09:08:38,622 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 105 [2018-01-31 09:08:38,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:38,622 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-01-31 09:08:38,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-31 09:08:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-01-31 09:08:38,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-01-31 09:08:38,624 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:38,624 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 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] [2018-01-31 09:08:38,624 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:38,624 INFO L82 PathProgramCache]: Analyzing trace with hash -329584181, now seen corresponding path program 1 times [2018-01-31 09:08:38,624 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:38,624 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:38,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:38,626 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:08:38,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:38,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-01-31 09:08:38,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:38,922 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:08:38,928 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:38,961 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-31 09:08:39,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:39,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26] total 33 [2018-01-31 09:08:39,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-31 09:08:39,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-31 09:08:39,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 09:08:39,292 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 33 states. [2018-01-31 09:08:39,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:39,868 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2018-01-31 09:08:39,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-31 09:08:39,869 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 117 [2018-01-31 09:08:39,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:39,870 INFO L225 Difference]: With dead ends: 177 [2018-01-31 09:08:39,870 INFO L226 Difference]: Without dead ends: 142 [2018-01-31 09:08:39,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=957, Invalid=2825, Unknown=0, NotChecked=0, Total=3782 [2018-01-31 09:08:39,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-31 09:08:39,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 136. [2018-01-31 09:08:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-31 09:08:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-01-31 09:08:39,883 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 117 [2018-01-31 09:08:39,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:39,883 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-01-31 09:08:39,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-31 09:08:39,884 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-01-31 09:08:39,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-01-31 09:08:39,884 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:39,885 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 5, 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] [2018-01-31 09:08:39,885 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:39,885 INFO L82 PathProgramCache]: Analyzing trace with hash -576261493, now seen corresponding path program 2 times [2018-01-31 09:08:39,885 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:39,885 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:39,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:39,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:08:39,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:39,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-01-31 09:08:40,392 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:40,392 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:08:40,397 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:08:40,414 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:40,429 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:08:40,431 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:40,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-31 09:08:40,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:40,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 28] total 37 [2018-01-31 09:08:40,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-31 09:08:40,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-31 09:08:40,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1062, Unknown=0, NotChecked=0, Total=1332 [2018-01-31 09:08:40,792 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 37 states. [2018-01-31 09:08:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:41,502 INFO L93 Difference]: Finished difference Result 195 states and 198 transitions. [2018-01-31 09:08:41,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-31 09:08:41,502 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 129 [2018-01-31 09:08:41,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:41,503 INFO L225 Difference]: With dead ends: 195 [2018-01-31 09:08:41,503 INFO L226 Difference]: Without dead ends: 154 [2018-01-31 09:08:41,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1174, Invalid=3656, Unknown=0, NotChecked=0, Total=4830 [2018-01-31 09:08:41,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-31 09:08:41,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 148. [2018-01-31 09:08:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-31 09:08:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-01-31 09:08:41,514 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 129 [2018-01-31 09:08:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:41,514 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-01-31 09:08:41,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-31 09:08:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-01-31 09:08:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-31 09:08:41,516 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:41,517 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:08:41,517 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:41,517 INFO L82 PathProgramCache]: Analyzing trace with hash 473424971, now seen corresponding path program 3 times [2018-01-31 09:08:41,517 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:41,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:41,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:41,518 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:08:41,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:41,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-01-31 09:08:41,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:41,698 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-31 09:08:41,703 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:08:41,722 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:08:41,726 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:08:41,729 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:08:41,734 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:08:41,740 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:08:41,745 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:08:41,746 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:41,750 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 74 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-01-31 09:08:42,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:08:42,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 31 [2018-01-31 09:08:42,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-31 09:08:42,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-31 09:08:42,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2018-01-31 09:08:42,028 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 31 states. [2018-01-31 09:08:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:08:42,369 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2018-01-31 09:08:42,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-31 09:08:42,369 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 141 [2018-01-31 09:08:42,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:08:42,370 INFO L225 Difference]: With dead ends: 171 [2018-01-31 09:08:42,370 INFO L226 Difference]: Without dead ends: 157 [2018-01-31 09:08:42,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=467, Invalid=1789, Unknown=0, NotChecked=0, Total=2256 [2018-01-31 09:08:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-31 09:08:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2018-01-31 09:08:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-31 09:08:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-01-31 09:08:42,382 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 141 [2018-01-31 09:08:42,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:08:42,382 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-01-31 09:08:42,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-31 09:08:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-01-31 09:08:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-01-31 09:08:42,383 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:08:42,383 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:08:42,383 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:08:42,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1644437887, now seen corresponding path program 4 times [2018-01-31 09:08:42,383 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:08:42,384 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:08:42,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:42,384 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:08:42,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:08:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:08:42,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:08:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-01-31 09:08:42,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:08:42,581 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-31 09:08:42,587 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 09:08:42,623 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:08:42,627 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:08:42,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:08:42,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:42,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:42,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 09:08:42,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:08:42,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:08:42,686 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-31 09:08:42,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:42,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:42,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-31 09:08:42,772 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-31 09:08:42,774 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-31 09:08:42,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:42,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:42,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:42,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-31 09:08:42,796 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-31 09:08:42,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:08:42,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:08:42,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-01-31 09:09:44,085 WARN L143 SmtUtils]: Spent 134ms on a formula simplification that was a NOOP. DAG size: 64 [2018-01-31 09:10:17,430 WARN L143 SmtUtils]: Spent 156ms on a formula simplification that was a NOOP. DAG size: 76 Received shutdown request... [2018-01-31 09:10:52,841 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-31 09:10:52,841 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 09:10:52,846 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 09:10:52,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:10:52 BoogieIcfgContainer [2018-01-31 09:10:52,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:10:52,848 INFO L168 Benchmark]: Toolchain (without parser) took 158589.14 ms. Allocated memory was 308.3 MB in the beginning and 656.9 MB in the end (delta: 348.7 MB). Free memory was 266.0 MB in the beginning and 493.9 MB in the end (delta: -227.8 MB). Peak memory consumption was 120.8 MB. Max. memory is 5.3 GB. [2018-01-31 09:10:52,849 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 308.3 MB. Free memory is still 272.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:10:52,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.45 ms. Allocated memory is still 308.3 MB. Free memory was 265.0 MB in the beginning and 255.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-31 09:10:52,850 INFO L168 Benchmark]: Boogie Preprocessor took 51.09 ms. Allocated memory is still 308.3 MB. Free memory was 255.0 MB in the beginning and 252.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:10:52,850 INFO L168 Benchmark]: RCFGBuilder took 562.13 ms. Allocated memory is still 308.3 MB. Free memory was 252.9 MB in the beginning and 233.9 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:10:52,850 INFO L168 Benchmark]: TraceAbstraction took 157652.78 ms. Allocated memory was 308.3 MB in the beginning and 656.9 MB in the end (delta: 348.7 MB). Free memory was 233.9 MB in the beginning and 493.9 MB in the end (delta: -259.9 MB). Peak memory consumption was 88.7 MB. Max. memory is 5.3 GB. [2018-01-31 09:10:52,852 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.12 ms. Allocated memory is still 308.3 MB. Free memory is still 272.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 308.45 ms. Allocated memory is still 308.3 MB. Free memory was 265.0 MB in the beginning and 255.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 51.09 ms. Allocated memory is still 308.3 MB. Free memory was 255.0 MB in the beginning and 252.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 562.13 ms. Allocated memory is still 308.3 MB. Free memory was 252.9 MB in the beginning and 233.9 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 157652.78 ms. Allocated memory was 308.3 MB in the beginning and 656.9 MB in the end (delta: 348.7 MB). Free memory was 233.9 MB in the beginning and 493.9 MB in the end (delta: -259.9 MB). Peak memory consumption was 88.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 625). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 629]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 66 locations, 17 error locations. TIMEOUT Result, 157.5s OverallTime, 18 OverallIterations, 14 TraceHistogramMax, 13.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 670 SDtfs, 2479 SDslu, 6340 SDs, 0 SdLazy, 5873 SolverSat, 495 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1534 GetRequests, 882 SyntacticMatches, 8 SemanticMatches, 644 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8522 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 73 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 2176 NumberOfCodeBlocks, 2004 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 2146 ConstructedInterpolants, 254 QuantifiedInterpolants, 1006645 SizeOfPredicates, 185 NumberOfNonLiveVariables, 2728 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 2587/5164 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_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_09-10-52-861.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-10-52-861.csv Completed graceful shutdown