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/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/reducercommutativity/sep10_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d63d1fb [2018-01-27 23:05:17,866 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-27 23:05:17,868 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-27 23:05:17,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-27 23:05:17,891 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-27 23:05:17,891 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-27 23:05:17,893 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-27 23:05:17,895 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-27 23:05:17,897 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-27 23:05:17,898 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-27 23:05:17,899 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-27 23:05:17,899 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-27 23:05:17,900 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-27 23:05:17,901 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-27 23:05:17,902 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-27 23:05:17,905 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-27 23:05:17,907 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-27 23:05:17,909 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-27 23:05:17,910 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-27 23:05:17,911 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-27 23:05:17,914 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-27 23:05:17,914 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-27 23:05:17,914 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-27 23:05:17,915 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-27 23:05:17,916 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-27 23:05:17,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-27 23:05:17,918 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-27 23:05:17,918 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-27 23:05:17,918 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-27 23:05:17,919 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-27 23:05:17,919 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-27 23:05:17,920 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-27 23:05:17,935 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-27 23:05:17,935 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-27 23:05:17,936 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-27 23:05:17,936 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-27 23:05:17,936 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-27 23:05:17,936 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-27 23:05:17,937 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-27 23:05:17,937 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-27 23:05:17,937 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-27 23:05:17,937 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-27 23:05:17,938 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-27 23:05:17,938 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-27 23:05:17,938 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-27 23:05:17,938 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-27 23:05:17,938 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-27 23:05:17,939 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-27 23:05:17,939 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-27 23:05:17,939 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-27 23:05:17,939 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-27 23:05:17,939 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-27 23:05:17,940 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-27 23:05:17,947 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-27 23:05:17,947 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-27 23:05:17,947 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-27 23:05:17,948 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-27 23:05:17,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-27 23:05:17,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-27 23:05:17,948 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-27 23:05:17,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-27 23:05:17,948 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-27 23:05:17,949 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-27 23:05:17,949 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-27 23:05:17,949 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-27 23:05:17,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-27 23:05:17,950 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-27 23:05:17,951 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-27 23:05:17,951 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-27 23:05:18,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-27 23:05:18,017 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-27 23:05:18,020 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-27 23:05:18,022 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-27 23:05:18,022 INFO L276 PluginConnector]: CDTParser initialized [2018-01-27 23:05:18,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep10_true-unreach-call.i [2018-01-27 23:05:18,134 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-27 23:05:18,143 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-27 23:05:18,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-27 23:05:18,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-27 23:05:18,152 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-27 23:05:18,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:05:18" (1/1) ... [2018-01-27 23:05:18,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38509d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:18, skipping insertion in model container [2018-01-27 23:05:18,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:05:18" (1/1) ... [2018-01-27 23:05:18,175 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-27 23:05:18,197 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-27 23:05:18,372 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-27 23:05:18,398 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-27 23:05:18,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:18 WrapperNode [2018-01-27 23:05:18,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-27 23:05:18,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-27 23:05:18,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-27 23:05:18,409 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-27 23:05:18,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:18" (1/1) ... [2018-01-27 23:05:18,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:18" (1/1) ... [2018-01-27 23:05:18,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:18" (1/1) ... [2018-01-27 23:05:18,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:18" (1/1) ... [2018-01-27 23:05:18,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:18" (1/1) ... [2018-01-27 23:05:18,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:18" (1/1) ... [2018-01-27 23:05:18,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:18" (1/1) ... [2018-01-27 23:05:18,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-27 23:05:18,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-27 23:05:18,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-27 23:05:18,464 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-27 23:05:18,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:18" (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-27 23:05:18,529 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-27 23:05:18,530 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-27 23:05:18,530 INFO L136 BoogieDeclarations]: Found implementation of procedure sep [2018-01-27 23:05:18,530 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-27 23:05:18,530 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-27 23:05:18,530 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-27 23:05:18,530 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-27 23:05:18,531 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-27 23:05:18,531 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-27 23:05:18,531 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-27 23:05:18,531 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-27 23:05:18,531 INFO L128 BoogieDeclarations]: Found specification of procedure sep [2018-01-27 23:05:18,531 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-27 23:05:18,531 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-27 23:05:18,532 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-27 23:05:19,124 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-27 23:05:19,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:05:19 BoogieIcfgContainer [2018-01-27 23:05:19,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-27 23:05:19,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-27 23:05:19,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-27 23:05:19,128 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-27 23:05:19,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:05:18" (1/3) ... [2018-01-27 23:05:19,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7a9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:05:19, skipping insertion in model container [2018-01-27 23:05:19,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:18" (2/3) ... [2018-01-27 23:05:19,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7a9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:05:19, skipping insertion in model container [2018-01-27 23:05:19,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:05:19" (3/3) ... [2018-01-27 23:05:19,131 INFO L105 eAbstractionObserver]: Analyzing ICFG sep10_true-unreach-call.i [2018-01-27 23:05:19,137 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-27 23:05:19,145 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-27 23:05:19,186 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:05:19,186 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:05:19,186 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:05:19,187 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:05:19,187 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:05:19,187 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:05:19,187 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:05:19,187 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-27 23:05:19,188 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:05:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:05:19,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-27 23:05:19,212 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:19,213 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-27 23:05:19,213 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-27 23:05:19,216 INFO L82 PathProgramCache]: Analyzing trace with hash 118205, now seen corresponding path program 1 times [2018-01-27 23:05:19,217 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:19,218 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:19,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:19,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:19,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:05:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:05:19,324 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-27 23:05:19,332 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:05:19,338 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:05:19,338 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:05:19,339 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:05:19,339 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:05:19,339 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:05:19,339 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:05:19,339 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:05:19,339 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-27 23:05:19,339 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:05:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:05:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-27 23:05:19,344 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:19,344 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:19,345 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:19,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1534485562, now seen corresponding path program 1 times [2018-01-27 23:05:19,345 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:19,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:19,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:19,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:19,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:19,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-27 23:05:19,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:05:19,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:05:19,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:05:19,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:05:19,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:05:19,458 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-01-27 23:05:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:19,481 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2018-01-27 23:05:19,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:05:19,482 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 46 [2018-01-27 23:05:19,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:19,496 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:05:19,496 INFO L226 Difference]: Without dead ends: 50 [2018-01-27 23:05:19,500 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:05:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-27 23:05:19,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-27 23:05:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-27 23:05:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-27 23:05:19,652 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 46 [2018-01-27 23:05:19,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:19,653 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-27 23:05:19,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:05:19,653 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-27 23:05:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-27 23:05:19,656 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:19,656 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:19,656 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:19,656 INFO L82 PathProgramCache]: Analyzing trace with hash -156806073, now seen corresponding path program 1 times [2018-01-27 23:05:19,656 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:19,656 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:19,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:19,658 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:19,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:19,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-27 23:05:19,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:05:19,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:05:19,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:05:19,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:05:19,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:05:19,799 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 3 states. [2018-01-27 23:05:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:19,873 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-01-27 23:05:19,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:05:19,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-01-27 23:05:19,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:19,875 INFO L225 Difference]: With dead ends: 93 [2018-01-27 23:05:19,875 INFO L226 Difference]: Without dead ends: 55 [2018-01-27 23:05:19,877 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:05:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-27 23:05:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-01-27 23:05:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-27 23:05:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-27 23:05:19,887 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 51 [2018-01-27 23:05:19,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:19,887 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-27 23:05:19,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:05:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-27 23:05:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-27 23:05:19,890 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:19,890 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:19,890 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:19,891 INFO L82 PathProgramCache]: Analyzing trace with hash 977157338, now seen corresponding path program 1 times [2018-01-27 23:05:19,891 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:19,891 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:19,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:19,892 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:19,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:19,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-27 23:05:19,988 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:19,988 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) [2018-01-27 23:05:20,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:20,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-27 23:05:20,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 23:05:20,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-01-27 23:05:20,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-27 23:05:20,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-27 23:05:20,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:05:20,182 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 4 states. [2018-01-27 23:05:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:20,221 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2018-01-27 23:05:20,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:05:20,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-01-27 23:05:20,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:20,223 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:05:20,223 INFO L226 Difference]: Without dead ends: 57 [2018-01-27 23:05:20,224 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:05:20,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-27 23:05:20,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-01-27 23:05:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-27 23:05:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-27 23:05:20,235 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 56 [2018-01-27 23:05:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:20,236 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-27 23:05:20,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-27 23:05:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-27 23:05:20,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-27 23:05:20,244 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:20,244 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:20,244 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:20,245 INFO L82 PathProgramCache]: Analyzing trace with hash 901586011, now seen corresponding path program 1 times [2018-01-27 23:05:20,245 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:20,245 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:20,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:20,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:20,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:20,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:20,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:05:20,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:05:20,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:05:20,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:05:20,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:05:20,397 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 3 states. [2018-01-27 23:05:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:20,451 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-01-27 23:05:20,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:05:20,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-01-27 23:05:20,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:20,455 INFO L225 Difference]: With dead ends: 82 [2018-01-27 23:05:20,455 INFO L226 Difference]: Without dead ends: 60 [2018-01-27 23:05:20,456 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:05:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-27 23:05:20,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-01-27 23:05:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-27 23:05:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-01-27 23:05:20,463 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 71 [2018-01-27 23:05:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:20,464 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-01-27 23:05:20,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:05:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-01-27 23:05:20,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-27 23:05:20,466 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:20,466 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:05:20,466 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:20,467 INFO L82 PathProgramCache]: Analyzing trace with hash -61334317, now seen corresponding path program 1 times [2018-01-27 23:05:20,467 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:20,467 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:20,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:20,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:20,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:20,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:20,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:20,685 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) [2018-01-27 23:05:20,699 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:20,769 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:20,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:20,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-27 23:05:20,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-27 23:05:20,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-27 23:05:20,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:05:20,887 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 5 states. [2018-01-27 23:05:20,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:20,938 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2018-01-27 23:05:20,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-27 23:05:20,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-01-27 23:05:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:20,940 INFO L225 Difference]: With dead ends: 106 [2018-01-27 23:05:20,940 INFO L226 Difference]: Without dead ends: 64 [2018-01-27 23:05:20,940 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:05:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-27 23:05:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-01-27 23:05:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-27 23:05:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-01-27 23:05:20,948 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 77 [2018-01-27 23:05:20,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:20,948 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-01-27 23:05:20,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-27 23:05:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-01-27 23:05:20,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-27 23:05:20,950 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:20,950 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:20,950 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:20,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1322671194, now seen corresponding path program 2 times [2018-01-27 23:05:20,951 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:20,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:20,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:20,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:20,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:20,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:21,121 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:21,121 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-27 23:05:21,139 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:05:21,164 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:21,194 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:21,207 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:21,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:21,371 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:21,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-27 23:05:21,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-27 23:05:21,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-27 23:05:21,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:05:21,372 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2018-01-27 23:05:21,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:21,542 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2018-01-27 23:05:21,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-27 23:05:21,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-01-27 23:05:21,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:21,544 INFO L225 Difference]: With dead ends: 111 [2018-01-27 23:05:21,544 INFO L226 Difference]: Without dead ends: 69 [2018-01-27 23:05:21,545 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:05:21,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-27 23:05:21,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-01-27 23:05:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-27 23:05:21,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-01-27 23:05:21,551 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 82 [2018-01-27 23:05:21,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:21,552 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-01-27 23:05:21,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-27 23:05:21,552 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-01-27 23:05:21,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-27 23:05:21,554 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:21,554 INFO L330 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:21,554 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:21,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1751804083, now seen corresponding path program 3 times [2018-01-27 23:05:21,554 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:21,554 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:21,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:21,556 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:21,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:21,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:21,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:21,698 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-27 23:05:21,703 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-27 23:05:21,728 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:21,752 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:21,764 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:21,769 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:22,045 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-27 23:05:22,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:22,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-01-27 23:05:22,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:05:22,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:05:22,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:05:22,079 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 8 states. [2018-01-27 23:05:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:22,262 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2018-01-27 23:05:22,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-27 23:05:22,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-01-27 23:05:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:22,265 INFO L225 Difference]: With dead ends: 124 [2018-01-27 23:05:22,265 INFO L226 Difference]: Without dead ends: 82 [2018-01-27 23:05:22,266 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:05:22,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-27 23:05:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2018-01-27 23:05:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-27 23:05:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-01-27 23:05:22,280 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 87 [2018-01-27 23:05:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:22,280 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-01-27 23:05:22,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:05:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-01-27 23:05:22,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-27 23:05:22,282 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:22,282 INFO L330 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:22,282 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:22,283 INFO L82 PathProgramCache]: Analyzing trace with hash -465935121, now seen corresponding path program 4 times [2018-01-27 23:05:22,283 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:22,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:22,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:22,284 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:22,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:22,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-01-27 23:05:22,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:22,534 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-27 23:05:22,543 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-27 23:05:22,589 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:22,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-01-27 23:05:22,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:22,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-27 23:05:22,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:05:22,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:05:22,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:05:22,660 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 8 states. [2018-01-27 23:05:22,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:22,707 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2018-01-27 23:05:22,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:05:22,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2018-01-27 23:05:22,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:22,709 INFO L225 Difference]: With dead ends: 131 [2018-01-27 23:05:22,709 INFO L226 Difference]: Without dead ends: 84 [2018-01-27 23:05:22,710 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:05:22,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-27 23:05:22,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-01-27 23:05:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-27 23:05:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-01-27 23:05:22,722 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 107 [2018-01-27 23:05:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:22,722 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-01-27 23:05:22,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:05:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-01-27 23:05:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-27 23:05:22,731 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:22,732 INFO L330 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:22,732 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:22,732 INFO L82 PathProgramCache]: Analyzing trace with hash 704280706, now seen corresponding path program 5 times [2018-01-27 23:05:22,732 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:22,732 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:22,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:22,733 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:22,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:22,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-01-27 23:05:23,282 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:23,282 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) [2018-01-27 23:05:23,296 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:23,316 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:23,331 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:23,347 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:23,365 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:23,389 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:23,398 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:23,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-27 23:05:23,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:23,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-01-27 23:05:23,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-27 23:05:23,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-27 23:05:23,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:05:23,516 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 11 states. [2018-01-27 23:05:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:23,724 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2018-01-27 23:05:23,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-27 23:05:23,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 112 [2018-01-27 23:05:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:23,727 INFO L225 Difference]: With dead ends: 144 [2018-01-27 23:05:23,727 INFO L226 Difference]: Without dead ends: 97 [2018-01-27 23:05:23,728 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:05:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-27 23:05:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2018-01-27 23:05:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-27 23:05:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2018-01-27 23:05:23,745 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 112 [2018-01-27 23:05:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:23,746 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2018-01-27 23:05:23,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-27 23:05:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2018-01-27 23:05:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-01-27 23:05:23,749 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:23,750 INFO L330 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 7, 6, 6, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:23,750 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:23,750 INFO L82 PathProgramCache]: Analyzing trace with hash -942204730, now seen corresponding path program 6 times [2018-01-27 23:05:23,750 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:23,750 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:23,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:23,751 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:23,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:23,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-01-27 23:05:23,974 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:23,974 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-27 23:05:23,981 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-27 23:05:24,002 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:24,004 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:24,010 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:24,016 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:24,025 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:24,039 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:24,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-01-27 23:05:24,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:24,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-01-27 23:05:24,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-27 23:05:24,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-27 23:05:24,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:05:24,107 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 11 states. [2018-01-27 23:05:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:24,214 INFO L93 Difference]: Finished difference Result 161 states and 176 transitions. [2018-01-27 23:05:24,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-27 23:05:24,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 132 [2018-01-27 23:05:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:24,237 INFO L225 Difference]: With dead ends: 161 [2018-01-27 23:05:24,237 INFO L226 Difference]: Without dead ends: 109 [2018-01-27 23:05:24,238 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:05:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-27 23:05:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2018-01-27 23:05:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-27 23:05:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-01-27 23:05:24,247 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 132 [2018-01-27 23:05:24,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:24,247 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-01-27 23:05:24,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-27 23:05:24,247 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-01-27 23:05:24,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-01-27 23:05:24,249 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:24,249 INFO L330 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 8, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:24,249 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:24,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1709902091, now seen corresponding path program 7 times [2018-01-27 23:05:24,250 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:24,250 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:24,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:24,251 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:24,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:24,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-27 23:05:24,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:24,761 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-27 23:05:24,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:24,820 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-27 23:05:24,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:24,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-01-27 23:05:24,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-27 23:05:24,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-27 23:05:24,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:05:24,963 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 11 states. [2018-01-27 23:05:25,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:25,001 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2018-01-27 23:05:25,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-27 23:05:25,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 143 [2018-01-27 23:05:25,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:25,002 INFO L225 Difference]: With dead ends: 168 [2018-01-27 23:05:25,002 INFO L226 Difference]: Without dead ends: 110 [2018-01-27 23:05:25,003 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:05:25,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-27 23:05:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2018-01-27 23:05:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-27 23:05:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-01-27 23:05:25,015 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 143 [2018-01-27 23:05:25,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:25,016 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-01-27 23:05:25,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-27 23:05:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-01-27 23:05:25,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-01-27 23:05:25,018 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:25,019 INFO L330 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 9, 8, 8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:25,019 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:25,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1984164066, now seen corresponding path program 8 times [2018-01-27 23:05:25,019 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:25,019 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:25,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:25,020 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:25,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:25,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-27 23:05:25,921 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:25,921 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-27 23:05:25,928 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:05:25,943 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:25,961 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:25,964 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:25,967 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-27 23:05:26,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:26,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-01-27 23:05:26,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-27 23:05:26,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-27 23:05:26,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:05:26,026 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 12 states. [2018-01-27 23:05:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:26,119 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2018-01-27 23:05:26,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-27 23:05:26,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2018-01-27 23:05:26,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:26,122 INFO L225 Difference]: With dead ends: 173 [2018-01-27 23:05:26,122 INFO L226 Difference]: Without dead ends: 115 [2018-01-27 23:05:26,122 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:05:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-27 23:05:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-01-27 23:05:26,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-27 23:05:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-01-27 23:05:26,129 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 148 [2018-01-27 23:05:26,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:26,129 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-01-27 23:05:26,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-27 23:05:26,130 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-01-27 23:05:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-01-27 23:05:26,131 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:26,132 INFO L330 BasicCegarLoop]: trace histogram [12, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:26,132 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:26,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2114641131, now seen corresponding path program 9 times [2018-01-27 23:05:26,133 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:26,133 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:26,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:26,134 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:26,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:26,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-27 23:05:26,628 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:26,628 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-27 23:05:26,634 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-27 23:05:26,650 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:26,656 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:26,661 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:26,678 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:26,679 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:26,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:26,789 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 124 proven. 21 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-01-27 23:05:26,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:26,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-01-27 23:05:26,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-27 23:05:26,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-27 23:05:26,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-01-27 23:05:26,810 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 16 states. [2018-01-27 23:05:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:26,998 INFO L93 Difference]: Finished difference Result 183 states and 203 transitions. [2018-01-27 23:05:26,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-27 23:05:26,998 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 153 [2018-01-27 23:05:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:26,999 INFO L225 Difference]: With dead ends: 183 [2018-01-27 23:05:26,999 INFO L226 Difference]: Without dead ends: 125 [2018-01-27 23:05:27,000 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-01-27 23:05:27,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-27 23:05:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-01-27 23:05:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-27 23:05:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-01-27 23:05:27,007 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 153 [2018-01-27 23:05:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:27,007 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-01-27 23:05:27,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-27 23:05:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-01-27 23:05:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-01-27 23:05:27,009 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:27,009 INFO L330 BasicCegarLoop]: trace histogram [15, 12, 12, 12, 12, 11, 10, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:27,009 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:27,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1819817847, now seen corresponding path program 10 times [2018-01-27 23:05:27,009 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:27,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:27,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:27,010 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:27,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:27,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-01-27 23:05:27,358 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:27,358 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-27 23:05:27,363 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-27 23:05:27,401 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:27,406 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 198 proven. 38 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2018-01-27 23:05:27,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:27,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-27 23:05:27,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:05:27,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:05:27,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:05:27,451 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 8 states. [2018-01-27 23:05:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:27,480 INFO L93 Difference]: Finished difference Result 192 states and 212 transitions. [2018-01-27 23:05:27,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:05:27,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 173 [2018-01-27 23:05:27,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:27,482 INFO L225 Difference]: With dead ends: 192 [2018-01-27 23:05:27,482 INFO L226 Difference]: Without dead ends: 130 [2018-01-27 23:05:27,482 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:05:27,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-27 23:05:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-01-27 23:05:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-27 23:05:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-01-27 23:05:27,489 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 173 [2018-01-27 23:05:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:27,489 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-01-27 23:05:27,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:05:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-01-27 23:05:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-01-27 23:05:27,490 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:27,491 INFO L330 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 11, 10, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:27,491 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:27,491 INFO L82 PathProgramCache]: Analyzing trace with hash 520263198, now seen corresponding path program 11 times [2018-01-27 23:05:27,491 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:27,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:27,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:27,492 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:27,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:27,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-01-27 23:05:28,144 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:28,144 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-27 23:05:28,149 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-27 23:05:28,163 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:28,178 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:28,197 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:28,213 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:28,227 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:28,238 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:28,254 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:28,275 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:28,306 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:28,360 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:28,423 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:28,431 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:28,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 296 proven. 60 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2018-01-27 23:05:28,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:28,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-01-27 23:05:28,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-27 23:05:28,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-27 23:05:28,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-27 23:05:28,599 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 9 states. [2018-01-27 23:05:28,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:28,980 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2018-01-27 23:05:28,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-27 23:05:28,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 188 [2018-01-27 23:05:28,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:28,981 INFO L225 Difference]: With dead ends: 202 [2018-01-27 23:05:28,982 INFO L226 Difference]: Without dead ends: 135 [2018-01-27 23:05:28,982 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-27 23:05:28,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-27 23:05:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2018-01-27 23:05:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-27 23:05:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-01-27 23:05:28,993 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 188 [2018-01-27 23:05:28,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:28,993 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-01-27 23:05:28,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-27 23:05:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-01-27 23:05:28,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-01-27 23:05:28,995 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:28,995 INFO L330 BasicCegarLoop]: trace histogram [21, 18, 18, 18, 18, 11, 10, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:28,995 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:28,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2031918441, now seen corresponding path program 12 times [2018-01-27 23:05:28,995 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:28,996 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:28,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:28,996 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:28,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:29,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 0 proven. 505 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2018-01-27 23:05:29,271 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:29,291 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-27 23:05:29,296 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-27 23:05:29,317 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:29,321 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:29,326 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:29,329 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:29,344 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:29,351 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:29,356 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:29,357 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:29,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 420 proven. 10 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2018-01-27 23:05:29,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:29,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-01-27 23:05:29,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-27 23:05:29,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-27 23:05:29,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:05:29,437 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 12 states. [2018-01-27 23:05:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:29,567 INFO L93 Difference]: Finished difference Result 222 states and 247 transitions. [2018-01-27 23:05:29,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-27 23:05:29,567 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 203 [2018-01-27 23:05:29,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:29,568 INFO L225 Difference]: With dead ends: 222 [2018-01-27 23:05:29,568 INFO L226 Difference]: Without dead ends: 150 [2018-01-27 23:05:29,569 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:05:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-27 23:05:29,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2018-01-27 23:05:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-27 23:05:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-01-27 23:05:29,577 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 203 [2018-01-27 23:05:29,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:29,577 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2018-01-27 23:05:29,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-27 23:05:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2018-01-27 23:05:29,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-01-27 23:05:29,578 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:29,579 INFO L330 BasicCegarLoop]: trace histogram [24, 21, 21, 21, 21, 11, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:29,579 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:29,579 INFO L82 PathProgramCache]: Analyzing trace with hash -814363338, now seen corresponding path program 13 times [2018-01-27 23:05:29,579 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:29,579 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:29,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:29,581 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:29,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:29,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2018-01-27 23:05:29,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:29,946 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-27 23:05:29,952 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:30,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 552 proven. 119 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2018-01-27 23:05:30,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:30,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-01-27 23:05:30,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-27 23:05:30,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-27 23:05:30,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:05:30,147 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 11 states. [2018-01-27 23:05:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:30,252 INFO L93 Difference]: Finished difference Result 234 states and 260 transitions. [2018-01-27 23:05:30,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-27 23:05:30,252 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 224 [2018-01-27 23:05:30,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:30,254 INFO L225 Difference]: With dead ends: 234 [2018-01-27 23:05:30,254 INFO L226 Difference]: Without dead ends: 151 [2018-01-27 23:05:30,255 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:05:30,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-27 23:05:30,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2018-01-27 23:05:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-27 23:05:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-01-27 23:05:30,267 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 224 [2018-01-27 23:05:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:30,267 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-01-27 23:05:30,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-27 23:05:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-01-27 23:05:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-01-27 23:05:30,269 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:30,270 INFO L330 BasicCegarLoop]: trace histogram [27, 24, 24, 24, 24, 11, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:30,270 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:30,270 INFO L82 PathProgramCache]: Analyzing trace with hash 303820159, now seen corresponding path program 14 times [2018-01-27 23:05:30,270 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:30,270 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:30,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:30,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:30,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:30,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1811 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2018-01-27 23:05:30,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:30,686 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:30,695 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:05:30,719 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:30,767 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:30,780 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:30,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1811 backedges. 710 proven. 156 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2018-01-27 23:05:30,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:30,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-01-27 23:05:30,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-27 23:05:30,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-27 23:05:30,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:05:30,958 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 12 states. [2018-01-27 23:05:31,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:31,103 INFO L93 Difference]: Finished difference Result 244 states and 272 transitions. [2018-01-27 23:05:31,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-27 23:05:31,106 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 239 [2018-01-27 23:05:31,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:31,107 INFO L225 Difference]: With dead ends: 244 [2018-01-27 23:05:31,108 INFO L226 Difference]: Without dead ends: 156 [2018-01-27 23:05:31,108 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:05:31,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-27 23:05:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2018-01-27 23:05:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-27 23:05:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2018-01-27 23:05:31,116 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 239 [2018-01-27 23:05:31,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:31,116 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2018-01-27 23:05:31,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-27 23:05:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2018-01-27 23:05:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-01-27 23:05:31,117 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:31,117 INFO L330 BasicCegarLoop]: trace histogram [30, 27, 27, 27, 27, 11, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:31,117 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:31,117 INFO L82 PathProgramCache]: Analyzing trace with hash 297006614, now seen corresponding path program 15 times [2018-01-27 23:05:31,117 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:31,118 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:31,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:31,118 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:31,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:31,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 0 proven. 1090 refuted. 0 times theorem prover too weak. 1114 trivial. 0 not checked. [2018-01-27 23:05:31,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:31,456 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:31,462 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-27 23:05:31,482 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:31,487 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:31,492 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:31,497 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:31,504 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:31,505 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:31,509 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 894 proven. 24 refuted. 0 times theorem prover too weak. 1286 trivial. 0 not checked. [2018-01-27 23:05:32,382 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:32,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-01-27 23:05:32,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-27 23:05:32,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-27 23:05:32,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-01-27 23:05:32,384 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand 16 states. [2018-01-27 23:05:32,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:32,784 INFO L93 Difference]: Finished difference Result 261 states and 291 transitions. [2018-01-27 23:05:32,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-27 23:05:32,784 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 254 [2018-01-27 23:05:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:32,785 INFO L225 Difference]: With dead ends: 261 [2018-01-27 23:05:32,786 INFO L226 Difference]: Without dead ends: 168 [2018-01-27 23:05:32,786 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-01-27 23:05:32,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-27 23:05:32,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2018-01-27 23:05:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-27 23:05:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 178 transitions. [2018-01-27 23:05:32,794 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 178 transitions. Word has length 254 [2018-01-27 23:05:32,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:32,794 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 178 transitions. [2018-01-27 23:05:32,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-27 23:05:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2018-01-27 23:05:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-01-27 23:05:32,796 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:32,796 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:32,796 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:32,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1622231449, now seen corresponding path program 16 times [2018-01-27 23:05:32,797 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:32,797 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:32,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:32,798 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:32,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:32,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2662 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 2618 trivial. 0 not checked. [2018-01-27 23:05:33,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:33,468 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:33,473 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-27 23:05:33,548 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:33,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2662 backedges. 1092 proven. 44 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2018-01-27 23:05:33,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:33,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-27 23:05:33,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:05:33,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:05:33,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:05:33,644 INFO L87 Difference]: Start difference. First operand 164 states and 178 transitions. Second operand 8 states. [2018-01-27 23:05:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:33,693 INFO L93 Difference]: Finished difference Result 241 states and 266 transitions. [2018-01-27 23:05:33,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:05:33,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 275 [2018-01-27 23:05:33,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:33,694 INFO L225 Difference]: With dead ends: 241 [2018-01-27 23:05:33,694 INFO L226 Difference]: Without dead ends: 174 [2018-01-27 23:05:33,695 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:05:33,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-27 23:05:33,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2018-01-27 23:05:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-27 23:05:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2018-01-27 23:05:33,701 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 275 [2018-01-27 23:05:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:33,702 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2018-01-27 23:05:33,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:05:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2018-01-27 23:05:33,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-01-27 23:05:33,704 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:33,704 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:33,704 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:33,704 INFO L82 PathProgramCache]: Analyzing trace with hash -323430353, now seen corresponding path program 17 times [2018-01-27 23:05:33,704 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:33,705 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:33,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:33,705 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:33,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:33,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2618 trivial. 0 not checked. [2018-01-27 23:05:34,342 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:34,342 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:34,347 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-27 23:05:34,368 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,378 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,380 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,382 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,383 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,385 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,389 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,393 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,395 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,399 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,402 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,407 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,413 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,427 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,439 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,463 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,496 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,572 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,704 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:34,952 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:35,098 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:35,101 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:35,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 1092 proven. 70 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2018-01-27 23:05:35,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:35,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-01-27 23:05:35,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-27 23:05:35,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-27 23:05:35,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-27 23:05:35,227 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand 9 states. [2018-01-27 23:05:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:35,416 INFO L93 Difference]: Finished difference Result 247 states and 272 transitions. [2018-01-27 23:05:35,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-27 23:05:35,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 281 [2018-01-27 23:05:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:35,418 INFO L225 Difference]: With dead ends: 247 [2018-01-27 23:05:35,418 INFO L226 Difference]: Without dead ends: 180 [2018-01-27 23:05:35,419 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-27 23:05:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-27 23:05:35,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2018-01-27 23:05:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-27 23:05:35,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 190 transitions. [2018-01-27 23:05:35,428 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 190 transitions. Word has length 281 [2018-01-27 23:05:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:35,429 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 190 transitions. [2018-01-27 23:05:35,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-27 23:05:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2018-01-27 23:05:35,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-01-27 23:05:35,434 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:35,434 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:35,434 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:35,434 INFO L82 PathProgramCache]: Analyzing trace with hash 69501943, now seen corresponding path program 18 times [2018-01-27 23:05:35,435 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:35,435 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:35,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:35,435 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:35,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:35,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2720 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 2618 trivial. 0 not checked. [2018-01-27 23:05:36,234 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:36,234 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:36,243 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-27 23:05:36,266 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:36,280 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:36,294 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:36,298 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:36,302 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:36,308 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:36,313 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:36,321 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:36,327 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:36,375 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:36,402 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:36,438 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:36,485 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:36,514 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:36,668 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:36,670 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:36,674 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2720 backedges. 1092 proven. 102 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2018-01-27 23:05:36,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:36,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-27 23:05:36,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-27 23:05:36,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-27 23:05:36,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-01-27 23:05:36,755 INFO L87 Difference]: Start difference. First operand 176 states and 190 transitions. Second operand 10 states. [2018-01-27 23:05:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:36,785 INFO L93 Difference]: Finished difference Result 253 states and 278 transitions. [2018-01-27 23:05:36,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-27 23:05:36,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 287 [2018-01-27 23:05:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:36,787 INFO L225 Difference]: With dead ends: 253 [2018-01-27 23:05:36,787 INFO L226 Difference]: Without dead ends: 186 [2018-01-27 23:05:36,788 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-01-27 23:05:36,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-27 23:05:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2018-01-27 23:05:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-27 23:05:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 196 transitions. [2018-01-27 23:05:36,796 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 196 transitions. Word has length 287 [2018-01-27 23:05:36,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:36,797 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 196 transitions. [2018-01-27 23:05:36,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-27 23:05:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 196 transitions. [2018-01-27 23:05:36,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-01-27 23:05:36,799 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:36,799 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:36,799 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:36,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1128121921, now seen corresponding path program 19 times [2018-01-27 23:05:36,800 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:36,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:36,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:36,801 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:36,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:36,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 2618 trivial. 0 not checked. [2018-01-27 23:05:37,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:37,619 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:37,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:37,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1092 proven. 140 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2018-01-27 23:05:37,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:37,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-01-27 23:05:37,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-27 23:05:37,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-27 23:05:37,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:05:37,852 INFO L87 Difference]: Start difference. First operand 182 states and 196 transitions. Second operand 11 states. [2018-01-27 23:05:37,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:37,889 INFO L93 Difference]: Finished difference Result 259 states and 284 transitions. [2018-01-27 23:05:37,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-27 23:05:37,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 293 [2018-01-27 23:05:37,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:37,891 INFO L225 Difference]: With dead ends: 259 [2018-01-27 23:05:37,891 INFO L226 Difference]: Without dead ends: 192 [2018-01-27 23:05:37,891 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:05:37,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-27 23:05:37,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2018-01-27 23:05:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-27 23:05:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 202 transitions. [2018-01-27 23:05:37,901 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 202 transitions. Word has length 293 [2018-01-27 23:05:37,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:37,902 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 202 transitions. [2018-01-27 23:05:37,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-27 23:05:37,902 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 202 transitions. [2018-01-27 23:05:37,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-01-27 23:05:37,904 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:37,904 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:37,905 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:37,905 INFO L82 PathProgramCache]: Analyzing trace with hash -412976761, now seen corresponding path program 20 times [2018-01-27 23:05:37,905 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:37,905 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:37,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:37,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:37,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:37,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2802 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 2618 trivial. 0 not checked. [2018-01-27 23:05:38,380 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:38,380 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:38,385 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:05:38,407 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:38,443 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:38,449 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:38,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2802 backedges. 1092 proven. 184 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2018-01-27 23:05:38,550 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:38,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-01-27 23:05:38,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-27 23:05:38,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-27 23:05:38,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:05:38,551 INFO L87 Difference]: Start difference. First operand 188 states and 202 transitions. Second operand 12 states. [2018-01-27 23:05:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:38,602 INFO L93 Difference]: Finished difference Result 261 states and 286 transitions. [2018-01-27 23:05:38,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-27 23:05:38,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 299 [2018-01-27 23:05:38,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:38,604 INFO L225 Difference]: With dead ends: 261 [2018-01-27 23:05:38,605 INFO L226 Difference]: Without dead ends: 194 [2018-01-27 23:05:38,605 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:05:38,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-27 23:05:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-01-27 23:05:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-27 23:05:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 208 transitions. [2018-01-27 23:05:38,613 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 208 transitions. Word has length 299 [2018-01-27 23:05:38,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:38,614 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 208 transitions. [2018-01-27 23:05:38,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-27 23:05:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 208 transitions. [2018-01-27 23:05:38,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-01-27 23:05:38,616 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:38,617 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:38,617 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:38,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1770667185, now seen corresponding path program 21 times [2018-01-27 23:05:38,617 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:38,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:38,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:38,618 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:38,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:05:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:05:39,998 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-27 23:05:40,038 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:05:40,060 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:05:40,065 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:05:40,073 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:05:40,073 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:05:40,073 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:05:40,170 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:05:40,170 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:05:40,170 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:05:40,170 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:05:40,170 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:05:40,170 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:05:40,170 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:05:40,170 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-27 23:05:40,171 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:05:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:05:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-27 23:05:40,175 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:40,175 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:40,175 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-27 23:05:40,176 INFO L82 PathProgramCache]: Analyzing trace with hash -762648204, now seen corresponding path program 1 times [2018-01-27 23:05:40,176 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:40,176 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:40,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:40,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:40,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:40,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-27 23:05:40,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:05:40,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:05:40,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:05:40,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:05:40,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:05:40,190 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-01-27 23:05:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:40,194 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2018-01-27 23:05:40,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:05:40,197 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 44 [2018-01-27 23:05:40,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:40,197 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:05:40,198 INFO L226 Difference]: Without dead ends: 48 [2018-01-27 23:05:40,198 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:05:40,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-27 23:05:40,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-27 23:05:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-27 23:05:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-27 23:05:40,202 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 44 [2018-01-27 23:05:40,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:40,202 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-27 23:05:40,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:05:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-27 23:05:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-27 23:05:40,203 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:40,203 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:40,203 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-27 23:05:40,204 INFO L82 PathProgramCache]: Analyzing trace with hash -983402303, now seen corresponding path program 1 times [2018-01-27 23:05:40,204 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:40,204 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:40,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:40,205 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:40,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:40,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-27 23:05:40,270 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:05:40,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:05:40,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:05:40,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:05:40,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:05:40,271 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 3 states. [2018-01-27 23:05:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:40,359 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-01-27 23:05:40,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:05:40,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-01-27 23:05:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:40,362 INFO L225 Difference]: With dead ends: 89 [2018-01-27 23:05:40,362 INFO L226 Difference]: Without dead ends: 53 [2018-01-27 23:05:40,362 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:05:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-27 23:05:40,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-01-27 23:05:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-27 23:05:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-27 23:05:40,367 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 49 [2018-01-27 23:05:40,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:40,367 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-27 23:05:40,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:05:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-27 23:05:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-27 23:05:40,368 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:40,368 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:40,368 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-27 23:05:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1531942380, now seen corresponding path program 1 times [2018-01-27 23:05:40,369 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:40,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:40,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:40,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:40,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:40,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-27 23:05:40,431 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:40,431 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:05:40,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:40,476 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-27 23:05:40,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 23:05:40,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-01-27 23:05:40,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-27 23:05:40,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-27 23:05:40,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:05:40,601 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 4 states. [2018-01-27 23:05:40,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:40,692 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-01-27 23:05:40,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:05:40,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-01-27 23:05:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:40,694 INFO L225 Difference]: With dead ends: 90 [2018-01-27 23:05:40,694 INFO L226 Difference]: Without dead ends: 55 [2018-01-27 23:05:40,695 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:05:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-27 23:05:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-01-27 23:05:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-27 23:05:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-27 23:05:40,698 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 54 [2018-01-27 23:05:40,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:40,698 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-27 23:05:40,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-27 23:05:40,698 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-27 23:05:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-27 23:05:40,699 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:40,699 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:40,699 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-27 23:05:40,699 INFO L82 PathProgramCache]: Analyzing trace with hash -709675563, now seen corresponding path program 1 times [2018-01-27 23:05:40,699 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:40,699 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:40,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:40,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:40,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:40,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:40,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:05:40,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:05:40,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:05:40,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:05:40,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:05:40,771 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 3 states. [2018-01-27 23:05:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:40,889 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-01-27 23:05:40,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:05:40,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-01-27 23:05:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:40,890 INFO L225 Difference]: With dead ends: 78 [2018-01-27 23:05:40,890 INFO L226 Difference]: Without dead ends: 58 [2018-01-27 23:05:40,890 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:05:40,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-27 23:05:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-01-27 23:05:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-27 23:05:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-27 23:05:40,894 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 69 [2018-01-27 23:05:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:40,894 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-27 23:05:40,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:05:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-27 23:05:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-27 23:05:40,895 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:40,895 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:05:40,895 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-27 23:05:40,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1300493389, now seen corresponding path program 1 times [2018-01-27 23:05:40,895 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:40,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:40,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:40,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:40,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:40,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:41,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:41,047 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:05:41,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:41,100 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:41,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:41,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-27 23:05:41,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-27 23:05:41,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-27 23:05:41,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:05:41,241 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 5 states. [2018-01-27 23:05:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:41,427 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2018-01-27 23:05:41,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-27 23:05:41,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-01-27 23:05:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:41,429 INFO L225 Difference]: With dead ends: 102 [2018-01-27 23:05:41,429 INFO L226 Difference]: Without dead ends: 62 [2018-01-27 23:05:41,429 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:05:41,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-27 23:05:41,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-01-27 23:05:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-27 23:05:41,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-01-27 23:05:41,434 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 75 [2018-01-27 23:05:41,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:41,435 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-01-27 23:05:41,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-27 23:05:41,435 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-01-27 23:05:41,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-27 23:05:41,436 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:41,436 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:41,437 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-27 23:05:41,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1553929184, now seen corresponding path program 2 times [2018-01-27 23:05:41,438 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:41,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:41,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:41,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:41,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:41,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:41,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:41,694 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:05:41,708 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:41,722 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:41,738 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:41,741 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:42,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 23:05:42,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-27 23:05:42,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 23:05:42,120 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-27 23:05:42,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-27 23:05:42,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 23:05:42,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-27 23:05:42,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 23:05:42,502 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-27 23:05:42,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-27 23:05:42,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 23:05:42,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-27 23:05:42,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 23:05:42,798 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-27 23:05:42,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-27 23:05:42,853 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#x~5.base| Int)) (and (= (store |c_old(#valid)| |main_~#x~5.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_~#x~5.base|) 0))) is different from true [2018-01-27 23:05:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-01-27 23:05:42,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 23:05:42,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-01-27 23:05:42,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-27 23:05:42,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-27 23:05:42,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2018-01-27 23:05:42,917 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 9 states. [2018-01-27 23:05:44,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:44,007 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2018-01-27 23:05:44,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-27 23:05:44,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-01-27 23:05:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:44,007 INFO L225 Difference]: With dead ends: 106 [2018-01-27 23:05:44,008 INFO L226 Difference]: Without dead ends: 0 [2018-01-27 23:05:44,008 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=47, Invalid=112, Unknown=1, NotChecked=22, Total=182 [2018-01-27 23:05:44,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-27 23:05:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-27 23:05:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-27 23:05:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-27 23:05:44,009 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2018-01-27 23:05:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:44,009 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-27 23:05:44,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-27 23:05:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-27 23:05:44,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-27 23:05:44,012 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:05:44,012 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:05:44,012 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:05:44,012 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:05:44,012 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:05:44,013 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:05:44,013 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:05:44,013 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == sepErr0EnsuresViolation======== [2018-01-27 23:05:44,013 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:05:44,014 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:05:44,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-27 23:05:44,015 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:44,015 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:44,015 INFO L371 AbstractCegarLoop]: === Iteration 1 === [sepErr0EnsuresViolation]=== [2018-01-27 23:05:44,017 INFO L82 PathProgramCache]: Analyzing trace with hash 145376028, now seen corresponding path program 1 times [2018-01-27 23:05:44,017 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:44,017 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:44,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:44,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:44,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:44,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:44,025 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-27 23:05:44,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:05:44,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:05:44,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:05:44,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:05:44,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:05:44,026 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-01-27 23:05:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:44,028 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2018-01-27 23:05:44,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:05:44,028 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-27 23:05:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:44,029 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:05:44,029 INFO L226 Difference]: Without dead ends: 0 [2018-01-27 23:05:44,029 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:05:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-27 23:05:44,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-27 23:05:44,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-27 23:05:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-27 23:05:44,030 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-01-27 23:05:44,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:44,030 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-27 23:05:44,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:05:44,030 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-27 23:05:44,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-27 23:05:44,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:05:44 BoogieIcfgContainer [2018-01-27 23:05:44,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-27 23:05:44,036 INFO L168 Benchmark]: Toolchain (without parser) took 25901.59 ms. Allocated memory was 307.2 MB in the beginning and 778.6 MB in the end (delta: 471.3 MB). Free memory was 268.1 MB in the beginning and 358.0 MB in the end (delta: -89.9 MB). Peak memory consumption was 381.4 MB. Max. memory is 5.3 GB. [2018-01-27 23:05:44,038 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-27 23:05:44,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.10 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 258.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-27 23:05:44,039 INFO L168 Benchmark]: Boogie Preprocessor took 53.43 ms. Allocated memory is still 307.2 MB. Free memory was 258.1 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-27 23:05:44,039 INFO L168 Benchmark]: RCFGBuilder took 661.42 ms. Allocated memory is still 307.2 MB. Free memory was 256.2 MB in the beginning and 237.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. [2018-01-27 23:05:44,040 INFO L168 Benchmark]: TraceAbstraction took 24909.56 ms. Allocated memory was 307.2 MB in the beginning and 778.6 MB in the end (delta: 471.3 MB). Free memory was 237.2 MB in the beginning and 358.0 MB in the end (delta: -120.8 MB). Peak memory consumption was 350.5 MB. Max. memory is 5.3 GB. [2018-01-27 23:05:44,041 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 264.10 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 258.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 53.43 ms. Allocated memory is still 307.2 MB. Free memory was 258.1 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 661.42 ms. Allocated memory is still 307.2 MB. Free memory was 256.2 MB in the beginning and 237.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 24909.56 ms. Allocated memory was 307.2 MB in the beginning and 778.6 MB in the end (delta: 471.3 MB). Free memory was 237.2 MB in the beginning and 358.0 MB in the end (delta: -120.8 MB). Peak memory consumption was 350.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L20] FCALL int x[10]; VAL [x={42:0}] [L21] int temp; [L22] int ret; [L23] int ret2; [L24] int ret5; [L26] int i = 0; VAL [i=0, x={42:0}] [L26] COND TRUE i < 10 [L27] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-50, i=0, x={42:0}] [L26] i++ VAL [i=1, x={42:0}] [L26] COND TRUE i < 10 [L27] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-38, i=1, x={42:0}] [L26] i++ VAL [i=2, x={42:0}] [L26] COND TRUE i < 10 [L27] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-6, i=2, x={42:0}] [L26] i++ VAL [i=3, x={42:0}] [L26] COND TRUE i < 10 [L27] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=3, x={42:0}] [L26] i++ VAL [i=4, x={42:0}] [L26] COND TRUE i < 10 [L27] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=4, x={42:0}] [L26] i++ VAL [i=5, x={42:0}] [L26] COND TRUE i < 10 [L27] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=5, x={42:0}] [L26] i++ VAL [i=6, x={42:0}] [L26] COND TRUE i < 10 [L27] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-8, i=6, x={42:0}] [L26] i++ VAL [i=7, x={42:0}] [L26] COND TRUE i < 10 [L27] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=7, x={42:0}] [L26] i++ VAL [i=8, x={42:0}] [L26] COND TRUE i < 10 [L27] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=8, x={42:0}] [L26] i++ VAL [i=9, x={42:0}] [L26] COND TRUE i < 10 [L27] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-4, i=9, x={42:0}] [L26] i++ VAL [i=10, x={42:0}] [L26] COND FALSE !(i < 10) VAL [i=10, x={42:0}] [L30] CALL, EXPR sep(x) VAL [x={42:0}] [L6] long long ret =0; [L7] int i=0; VAL [i=0, ret=0, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=0, ret=0, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=0, ret=0, x={42:0}, x={42:0}, x[i]=-50] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=0, ret=1, x={42:0}, x={42:0}] [L7] i++ VAL [i=1, ret=1, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=1, ret=1, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=1, ret=1, x={42:0}, x={42:0}, x[i]=-38] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=1, ret=2, x={42:0}, x={42:0}] [L7] i++ VAL [i=2, ret=2, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=2, ret=2, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=2, ret=2, x={42:0}, x={42:0}, x[i]=-6] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=2, ret=3, x={42:0}, x={42:0}] [L7] i++ VAL [i=3, ret=3, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=3, ret=3, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=3, ret=3, x={42:0}, x={42:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=3, ret=4, x={42:0}, x={42:0}] [L7] i++ VAL [i=4, ret=4, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=4, ret=4, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=4, ret=4, x={42:0}, x={42:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=4, ret=5, x={42:0}, x={42:0}] [L7] i++ VAL [i=5, ret=5, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=5, ret=5, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=5, ret=5, x={42:0}, x={42:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=5, ret=6, x={42:0}, x={42:0}] [L7] i++ VAL [i=6, ret=6, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=6, ret=6, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=6, ret=6, x={42:0}, x={42:0}, x[i]=-8] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=6, ret=7, x={42:0}, x={42:0}] [L7] i++ VAL [i=7, ret=7, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=7, ret=7, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=7, ret=7, x={42:0}, x={42:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=7, ret=8, x={42:0}, x={42:0}] [L7] i++ VAL [i=8, ret=8, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=8, ret=8, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=8, ret=8, x={42:0}, x={42:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=8, ret=9, x={42:0}, x={42:0}] [L7] i++ VAL [i=9, ret=9, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=9, ret=9, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=9, ret=9, x={42:0}, x={42:0}, x[i]=-4] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=9, ret=10, x={42:0}, x={42:0}] [L7] i++ VAL [i=10, ret=10, x={42:0}, x={42:0}] [L7] COND FALSE !(i<10) VAL [i=10, ret=10, x={42:0}, x={42:0}] [L14] RET return ret; VAL [\result=10, i=10, ret=10, x={42:0}, x={42:0}] [L30] EXPR sep(x) VAL [i=10, sep(x)=10, x={42:0}] [L30] ret = sep(x) [L32] EXPR, FCALL x[0] VAL [i=10, ret=10, x={42:0}, x[0]=-50] [L32] temp=x[0] [L32] EXPR, FCALL x[1] VAL [i=10, ret=10, temp=-50, x={42:0}, x[1]=-38] [L32] FCALL x[0] = x[1] VAL [i=10, ret=10, temp=-50, x={42:0}, x[1]=-38] [L32] FCALL x[1] = temp VAL [i=10, ret=10, temp=-50, x={42:0}] [L33] CALL, EXPR sep(x) VAL [x={42:0}] [L6] long long ret =0; [L7] int i=0; VAL [i=0, ret=0, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=0, ret=0, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=0, ret=0, x={42:0}, x={42:0}, x[i]=-38] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=0, ret=1, x={42:0}, x={42:0}] [L7] i++ VAL [i=1, ret=1, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=1, ret=1, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=1, ret=1, x={42:0}, x={42:0}, x[i]=-50] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=1, ret=2, x={42:0}, x={42:0}] [L7] i++ VAL [i=2, ret=2, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=2, ret=2, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=2, ret=2, x={42:0}, x={42:0}, x[i]=-6] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=2, ret=3, x={42:0}, x={42:0}] [L7] i++ VAL [i=3, ret=3, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=3, ret=3, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=3, ret=3, x={42:0}, x={42:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=3, ret=4, x={42:0}, x={42:0}] [L7] i++ VAL [i=4, ret=4, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=4, ret=4, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=4, ret=4, x={42:0}, x={42:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=4, ret=5, x={42:0}, x={42:0}] [L7] i++ VAL [i=5, ret=5, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=5, ret=5, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=5, ret=5, x={42:0}, x={42:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=5, ret=6, x={42:0}, x={42:0}] [L7] i++ VAL [i=6, ret=6, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=6, ret=6, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=6, ret=6, x={42:0}, x={42:0}, x[i]=-8] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=6, ret=7, x={42:0}, x={42:0}] [L7] i++ VAL [i=7, ret=7, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=7, ret=7, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=7, ret=7, x={42:0}, x={42:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=7, ret=8, x={42:0}, x={42:0}] [L7] i++ VAL [i=8, ret=8, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=8, ret=8, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=8, ret=8, x={42:0}, x={42:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=8, ret=9, x={42:0}, x={42:0}] [L7] i++ VAL [i=9, ret=9, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=9, ret=9, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=9, ret=9, x={42:0}, x={42:0}, x[i]=-4] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=9, ret=10, x={42:0}, x={42:0}] [L7] i++ VAL [i=10, ret=10, x={42:0}, x={42:0}] [L7] COND FALSE !(i<10) VAL [i=10, ret=10, x={42:0}, x={42:0}] [L14] RET return ret; VAL [\result=10, i=10, ret=10, x={42:0}, x={42:0}] [L33] EXPR sep(x) VAL [i=10, ret=10, sep(x)=10, temp=-50, x={42:0}] [L33] ret2 = sep(x) [L34] EXPR, FCALL x[0] VAL [i=10, ret=10, ret2=10, temp=-50, x={42:0}, x[0]=-38] [L34] temp=x[0] [L35] int i =0 ; VAL [i=10, i=0, ret=10, ret2=10, temp=-38, x={42:0}] [L35] COND TRUE i<10 -1 VAL [i=10, i=0, ret=10, ret2=10, temp=-38, x={42:0}] [L36] EXPR, FCALL x[i+1] VAL [i=10, i=0, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=-50] [L36] FCALL x[i] = x[i+1] VAL [i=10, i=0, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=-50] [L35] i++ VAL [i=1, i=10, ret=10, ret2=10, temp=-38, x={42:0}] [L35] COND TRUE i<10 -1 VAL [i=10, i=1, ret=10, ret2=10, temp=-38, x={42:0}] [L36] EXPR, FCALL x[i+1] VAL [i=10, i=1, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=-6] [L36] FCALL x[i] = x[i+1] VAL [i=1, i=10, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=-6] [L35] i++ VAL [i=10, i=2, ret=10, ret2=10, temp=-38, x={42:0}] [L35] COND TRUE i<10 -1 VAL [i=10, i=2, ret=10, ret2=10, temp=-38, x={42:0}] [L36] EXPR, FCALL x[i+1] VAL [i=2, i=10, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=0] [L36] FCALL x[i] = x[i+1] VAL [i=10, i=2, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=0] [L35] i++ VAL [i=3, i=10, ret=10, ret2=10, temp=-38, x={42:0}] [L35] COND TRUE i<10 -1 VAL [i=10, i=3, ret=10, ret2=10, temp=-38, x={42:0}] [L36] EXPR, FCALL x[i+1] VAL [i=3, i=10, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=0] [L36] FCALL x[i] = x[i+1] VAL [i=10, i=3, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=0] [L35] i++ VAL [i=4, i=10, ret=10, ret2=10, temp=-38, x={42:0}] [L35] COND TRUE i<10 -1 VAL [i=4, i=10, ret=10, ret2=10, temp=-38, x={42:0}] [L36] EXPR, FCALL x[i+1] VAL [i=10, i=4, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=0] [L36] FCALL x[i] = x[i+1] VAL [i=4, i=10, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=0] [L35] i++ VAL [i=5, i=10, ret=10, ret2=10, temp=-38, x={42:0}] [L35] COND TRUE i<10 -1 VAL [i=10, i=5, ret=10, ret2=10, temp=-38, x={42:0}] [L36] EXPR, FCALL x[i+1] VAL [i=5, i=10, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=-8] [L36] FCALL x[i] = x[i+1] VAL [i=5, i=10, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=-8] [L35] i++ VAL [i=10, i=6, ret=10, ret2=10, temp=-38, x={42:0}] [L35] COND TRUE i<10 -1 VAL [i=6, i=10, ret=10, ret2=10, temp=-38, x={42:0}] [L36] EXPR, FCALL x[i+1] VAL [i=6, i=10, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=0] [L36] FCALL x[i] = x[i+1] VAL [i=6, i=10, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=0] [L35] i++ VAL [i=7, i=10, ret=10, ret2=10, temp=-38, x={42:0}] [L35] COND TRUE i<10 -1 VAL [i=10, i=7, ret=10, ret2=10, temp=-38, x={42:0}] [L36] EXPR, FCALL x[i+1] VAL [i=7, i=10, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=0] [L36] FCALL x[i] = x[i+1] VAL [i=7, i=10, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=0] [L35] i++ VAL [i=10, i=8, ret=10, ret2=10, temp=-38, x={42:0}] [L35] COND TRUE i<10 -1 VAL [i=10, i=8, ret=10, ret2=10, temp=-38, x={42:0}] [L36] EXPR, FCALL x[i+1] VAL [i=8, i=10, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=-4] [L36] FCALL x[i] = x[i+1] VAL [i=8, i=10, ret=10, ret2=10, temp=-38, x={42:0}, x[i+1]=-4] [L35] i++ VAL [i=9, i=10, ret=10, ret2=10, temp=-38, x={42:0}] [L35] COND FALSE !(i<10 -1) VAL [i=10, i=9, ret=10, ret2=10, temp=-38, x={42:0}] [L38] FCALL x[10 -1] = temp VAL [i=9, i=10, ret=10, ret2=10, temp=-38, x={42:0}] [L39] CALL, EXPR sep(x) VAL [x={42:0}] [L6] long long ret =0; [L7] int i=0; VAL [i=0, ret=0, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=0, ret=0, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=0, ret=0, x={42:0}, x={42:0}, x[i]=-50] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=0, ret=1, x={42:0}, x={42:0}] [L7] i++ VAL [i=1, ret=1, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=1, ret=1, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=1, ret=1, x={42:0}, x={42:0}, x[i]=-6] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=1, ret=2, x={42:0}, x={42:0}] [L7] i++ VAL [i=2, ret=2, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=2, ret=2, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=2, ret=2, x={42:0}, x={42:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=2, ret=3, x={42:0}, x={42:0}] [L7] i++ VAL [i=3, ret=3, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=3, ret=3, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=3, ret=3, x={42:0}, x={42:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=3, ret=4, x={42:0}, x={42:0}] [L7] i++ VAL [i=4, ret=4, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=4, ret=4, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=4, ret=4, x={42:0}, x={42:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=4, ret=5, x={42:0}, x={42:0}] [L7] i++ VAL [i=5, ret=5, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=5, ret=5, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=5, ret=5, x={42:0}, x={42:0}, x[i]=-8] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=5, ret=6, x={42:0}, x={42:0}] [L7] i++ VAL [i=6, ret=6, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=6, ret=6, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=6, ret=6, x={42:0}, x={42:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=6, ret=7, x={42:0}, x={42:0}] [L7] i++ VAL [i=7, ret=7, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=7, ret=7, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=7, ret=7, x={42:0}, x={42:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=7, ret=8, x={42:0}, x={42:0}] [L7] i++ VAL [i=8, ret=8, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=8, ret=8, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=8, ret=8, x={42:0}, x={42:0}, x[i]=-4] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=8, ret=9, x={42:0}, x={42:0}] [L7] i++ VAL [i=9, ret=9, x={42:0}, x={42:0}] [L7] COND TRUE i<10 VAL [i=9, ret=9, x={42:0}, x={42:0}] [L9] EXPR, FCALL x[i] VAL [i=9, ret=9, x={42:0}, x={42:0}, x[i]=-38] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=9, ret=10, x={42:0}, x={42:0}] [L7] i++ VAL [i=10, ret=10, x={42:0}, x={42:0}] [L7] COND FALSE !(i<10) VAL [i=10, ret=10, x={42:0}, x={42:0}] [L14] RET return ret; VAL [\result=10, i=10, ret=10, x={42:0}, x={42:0}] [L39] EXPR sep(x) VAL [i=9, i=10, ret=10, ret2=10, sep(x)=10, temp=-38, x={42:0}] [L39] ret5 = sep(x) [L41] COND FALSE !(ret != ret2 || ret !=ret5) VAL [i=10, i=9, ret=10, ret2=10, ret5=10, temp=-38, x={42:0}] [L44] return 1; VAL [\result=1, i=9, i=10, ret=10, ret2=10, ret5=10, temp=-38, x={42:0}] [L44] return 1; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. UNSAFE Result, 20.8s OverallTime, 25 OverallIterations, 33 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1227 SDtfs, 569 SDslu, 6231 SDs, 0 SdLazy, 908 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3977 GetRequests, 3807 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 86 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 8099 NumberOfCodeBlocks, 7532 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 7749 ConstructedInterpolants, 0 QuantifiedInterpolants, 2120593 SizeOfPredicates, 21 NumberOfNonLiveVariables, 6718 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 45 InterpolantComputations, 4 PerfectInterpolantSequences, 41777/48062 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. SAFE Result, 3.8s OverallTime, 6 OverallIterations, 6 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 292 SDtfs, 82 SDslu, 330 SDs, 0 SdLazy, 172 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 208 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=5, 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 580 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 571 ConstructedInterpolants, 35 QuantifiedInterpolants, 91665 SizeOfPredicates, 5 NumberOfNonLiveVariables, 406 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 337/360 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 4]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: sepErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 58 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sep10_true-unreach-call.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-27_23-05-44-056.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sep10_true-unreach-call.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-27_23-05-44-056.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sep10_true-unreach-call.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-27_23-05-44-056.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sep10_true-unreach-call.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-27_23-05-44-056.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sep10_true-unreach-call.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-27_23-05-44-056.csv Received shutdown request...