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/sum05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d63d1fb [2018-01-27 23:06:56,861 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-27 23:06:56,863 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-27 23:06:56,880 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-27 23:06:56,881 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-27 23:06:56,882 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-27 23:06:56,884 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-27 23:06:56,888 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-27 23:06:56,890 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-27 23:06:56,892 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-27 23:06:56,893 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-27 23:06:56,893 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-27 23:06:56,894 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-27 23:06:56,895 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-27 23:06:56,896 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-27 23:06:56,899 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-27 23:06:56,901 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-27 23:06:56,903 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-27 23:06:56,904 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-27 23:06:56,906 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-27 23:06:56,908 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-27 23:06:56,909 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-27 23:06:56,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-27 23:06:56,910 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-27 23:06:56,911 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-27 23:06:56,912 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-27 23:06:56,913 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-27 23:06:56,914 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-27 23:06:56,914 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-27 23:06:56,914 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-27 23:06:56,915 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-27 23:06:56,915 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:06:56,927 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-27 23:06:56,927 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-27 23:06:56,928 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-27 23:06:56,928 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-27 23:06:56,929 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-27 23:06:56,929 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-27 23:06:56,929 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-27 23:06:56,930 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-27 23:06:56,930 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-27 23:06:56,930 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-27 23:06:56,931 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-27 23:06:56,931 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-27 23:06:56,931 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-27 23:06:56,931 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-27 23:06:56,932 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-27 23:06:56,932 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-27 23:06:56,932 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-27 23:06:56,932 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-27 23:06:56,932 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-27 23:06:56,933 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-27 23:06:56,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-27 23:06:56,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-27 23:06:56,933 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-27 23:06:56,934 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-27 23:06:56,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-27 23:06:56,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-27 23:06:56,934 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-27 23:06:56,934 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-27 23:06:56,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-27 23:06:56,935 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-27 23:06:56,935 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-27 23:06:56,935 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-27 23:06:56,935 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-27 23:06:56,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-27 23:06:56,936 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-27 23:06:56,937 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-27 23:06:56,937 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-27 23:06:56,984 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-27 23:06:56,999 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-27 23:06:57,002 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-27 23:06:57,003 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-27 23:06:57,004 INFO L276 PluginConnector]: CDTParser initialized [2018-01-27 23:06:57,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum05_true-unreach-call_true-termination.i [2018-01-27 23:06:57,142 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-27 23:06:57,151 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-27 23:06:57,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-27 23:06:57,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-27 23:06:57,166 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-27 23:06:57,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:06:57" (1/1) ... [2018-01-27 23:06:57,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@523eec15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:06:57, skipping insertion in model container [2018-01-27 23:06:57,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:06:57" (1/1) ... [2018-01-27 23:06:57,192 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-27 23:06:57,216 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-27 23:06:57,393 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-27 23:06:57,424 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-27 23:06:57,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:06:57 WrapperNode [2018-01-27 23:06:57,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-27 23:06:57,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-27 23:06:57,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-27 23:06:57,441 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-27 23:06:57,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:06:57" (1/1) ... [2018-01-27 23:06:57,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:06:57" (1/1) ... [2018-01-27 23:06:57,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:06:57" (1/1) ... [2018-01-27 23:06:57,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:06:57" (1/1) ... [2018-01-27 23:06:57,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:06:57" (1/1) ... [2018-01-27 23:06:57,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:06:57" (1/1) ... [2018-01-27 23:06:57,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:06:57" (1/1) ... [2018-01-27 23:06:57,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-27 23:06:57,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-27 23:06:57,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-27 23:06:57,502 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-27 23:06:57,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:06:57" (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:06:57,615 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-27 23:06:57,615 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-27 23:06:57,615 INFO L136 BoogieDeclarations]: Found implementation of procedure sum [2018-01-27 23:06:57,615 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-27 23:06:57,615 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-27 23:06:57,616 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-27 23:06:57,616 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-27 23:06:57,620 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-27 23:06:57,620 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-27 23:06:57,620 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-27 23:06:57,620 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-27 23:06:57,620 INFO L128 BoogieDeclarations]: Found specification of procedure sum [2018-01-27 23:06:57,620 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-27 23:06:57,621 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-27 23:06:57,621 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-27 23:06:58,148 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-27 23:06:58,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:06:58 BoogieIcfgContainer [2018-01-27 23:06:58,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-27 23:06:58,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-27 23:06:58,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-27 23:06:58,155 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-27 23:06:58,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:06:57" (1/3) ... [2018-01-27 23:06:58,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e66276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:06:58, skipping insertion in model container [2018-01-27 23:06:58,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:06:57" (2/3) ... [2018-01-27 23:06:58,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e66276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:06:58, skipping insertion in model container [2018-01-27 23:06:58,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:06:58" (3/3) ... [2018-01-27 23:06:58,161 INFO L105 eAbstractionObserver]: Analyzing ICFG sum05_true-unreach-call_true-termination.i [2018-01-27 23:06:58,172 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-27 23:06:58,182 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-27 23:06:58,235 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:06:58,235 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:06:58,235 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:06:58,235 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:06:58,236 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:06:58,236 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:06:58,236 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:06:58,236 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-27 23:06:58,246 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:06:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:06:58,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-27 23:06:58,269 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:06:58,270 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-27 23:06:58,270 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-27 23:06:58,275 INFO L82 PathProgramCache]: Analyzing trace with hash 114361, now seen corresponding path program 1 times [2018-01-27 23:06:58,276 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:06:58,277 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:06:58,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:06:58,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:06:58,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:06:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:06:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:06:58,417 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-27 23:06:58,425 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:06:58,433 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:06:58,433 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:06:58,433 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:06:58,433 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:06:58,433 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:06:58,434 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:06:58,434 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:06:58,434 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-27 23:06:58,434 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:06:58,437 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:06:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-27 23:06:58,440 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:06:58,440 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:06:58,440 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:06:58,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1258483300, now seen corresponding path program 1 times [2018-01-27 23:06:58,441 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:06:58,441 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:06:58,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:06:58,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:06:58,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:06:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:06:58,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:06:58,563 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:06:58,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:06:58,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:06:58,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:06:58,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:06:58,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:06:58,587 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-01-27 23:06:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:06:58,613 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-01-27 23:06:58,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:06:58,615 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 46 [2018-01-27 23:06:58,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:06:58,630 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:06:58,631 INFO L226 Difference]: Without dead ends: 50 [2018-01-27 23:06:58,636 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:06:58,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-27 23:06:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-27 23:06:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-27 23:06:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-27 23:06:58,785 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 46 [2018-01-27 23:06:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:06:58,786 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-27 23:06:58,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:06:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-27 23:06:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-27 23:06:58,791 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:06:58,791 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:06:58,791 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:06:58,792 INFO L82 PathProgramCache]: Analyzing trace with hash -983082746, now seen corresponding path program 1 times [2018-01-27 23:06:58,792 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:06:58,792 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:06:58,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:06:58,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:06:58,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:06:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:06:58,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:06:58,954 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:06:58,955 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:06:58,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:06:58,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:06:58,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:06:58,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:06:58,960 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 3 states. [2018-01-27 23:06:59,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:06:59,020 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-01-27 23:06:59,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:06:59,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-01-27 23:06:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:06:59,023 INFO L225 Difference]: With dead ends: 93 [2018-01-27 23:06:59,023 INFO L226 Difference]: Without dead ends: 55 [2018-01-27 23:06:59,025 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:06:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-27 23:06:59,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-01-27 23:06:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-27 23:06:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-27 23:06:59,033 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 51 [2018-01-27 23:06:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:06:59,035 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-27 23:06:59,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:06:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-27 23:06:59,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-27 23:06:59,038 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:06:59,038 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:06:59,038 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:06:59,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1286187467, now seen corresponding path program 1 times [2018-01-27 23:06:59,038 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:06:59,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:06:59,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:06:59,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:06:59,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:06:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:06:59,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:06:59,126 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:06:59,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:06:59,127 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:06:59,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:06:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:06:59,222 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:06:59,336 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:06:59,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 23:06:59,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-01-27 23:06:59,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-27 23:06:59,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-27 23:06:59,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:06:59,366 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2018-01-27 23:06:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:06:59,392 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2018-01-27 23:06:59,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:06:59,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-01-27 23:06:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:06:59,397 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:06:59,397 INFO L226 Difference]: Without dead ends: 57 [2018-01-27 23:06:59,397 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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:06:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-27 23:06:59,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-01-27 23:06:59,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-27 23:06:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-27 23:06:59,406 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 56 [2018-01-27 23:06:59,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:06:59,406 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-27 23:06:59,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-27 23:06:59,407 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-27 23:06:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-27 23:06:59,410 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:06:59,410 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:06:59,410 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:06:59,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1323141693, now seen corresponding path program 1 times [2018-01-27 23:06:59,411 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:06:59,411 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:06:59,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:06:59,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:06:59,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:06:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:06:59,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:06:59,584 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:06:59,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:06:59,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:06:59,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:06:59,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:06:59,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:06:59,586 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 3 states. [2018-01-27 23:06:59,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:06:59,718 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-01-27 23:06:59,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:06:59,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-01-27 23:06:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:06:59,725 INFO L225 Difference]: With dead ends: 82 [2018-01-27 23:06:59,725 INFO L226 Difference]: Without dead ends: 60 [2018-01-27 23:06:59,726 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:06:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-27 23:06:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-01-27 23:06:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-27 23:06:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-27 23:06:59,737 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 71 [2018-01-27 23:06:59,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:06:59,742 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-27 23:06:59,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:06:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-27 23:06:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-27 23:06:59,743 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:06:59,744 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:06:59,744 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:06:59,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1123185973, now seen corresponding path program 1 times [2018-01-27 23:06:59,745 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:06:59,746 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:06:59,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:06:59,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:06:59,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:06:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:06:59,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:06:59,913 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:06:59,913 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:06:59,913 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:06:59,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:06:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:06:59,985 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:00,030 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:07:00,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:00,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-27 23:07:00,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-27 23:07:00,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-27 23:07:00,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:07:00,058 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2018-01-27 23:07:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:00,104 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-01-27 23:07:00,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-27 23:07:00,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-01-27 23:07:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:00,106 INFO L225 Difference]: With dead ends: 106 [2018-01-27 23:07:00,106 INFO L226 Difference]: Without dead ends: 64 [2018-01-27 23:07:00,107 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:07:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-27 23:07:00,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-01-27 23:07:00,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-27 23:07:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-27 23:07:00,116 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 77 [2018-01-27 23:07:00,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:00,116 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-27 23:07:00,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-27 23:07:00,116 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-27 23:07:00,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-27 23:07:00,118 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:00,118 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:07:00,118 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:00,118 INFO L82 PathProgramCache]: Analyzing trace with hash 651249060, now seen corresponding path program 2 times [2018-01-27 23:07:00,119 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:00,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:00,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:00,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:00,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:00,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:00,311 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:07:00,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:00,312 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:07:00,325 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:07:00,360 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:00,391 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:00,408 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:00,413 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:00,471 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:07:00,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:00,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-27 23:07:00,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-27 23:07:00,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-27 23:07:00,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:07:00,492 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-01-27 23:07:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:00,566 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-01-27 23:07:00,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-27 23:07:00,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-01-27 23:07:00,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:00,572 INFO L225 Difference]: With dead ends: 111 [2018-01-27 23:07:00,572 INFO L226 Difference]: Without dead ends: 69 [2018-01-27 23:07:00,573 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:07:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-27 23:07:00,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-01-27 23:07:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-27 23:07:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-01-27 23:07:00,581 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 82 [2018-01-27 23:07:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:00,582 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-01-27 23:07:00,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-27 23:07:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-01-27 23:07:00,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-27 23:07:00,583 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:00,584 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:07:00,584 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:00,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1424072043, now seen corresponding path program 3 times [2018-01-27 23:07:00,584 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:00,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:00,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:00,588 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:00,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:00,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:07:00,851 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:07:00,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:00,852 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:07:00,858 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-27 23:07:00,876 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:00,894 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:00,905 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:00,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:01,174 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:07:01,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:01,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-01-27 23:07:01,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:07:01,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:07:01,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:07:01,209 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 8 states. [2018-01-27 23:07:01,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:01,548 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-01-27 23:07:01,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-27 23:07:01,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-01-27 23:07:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:01,551 INFO L225 Difference]: With dead ends: 124 [2018-01-27 23:07:01,551 INFO L226 Difference]: Without dead ends: 82 [2018-01-27 23:07:01,551 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:07:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-27 23:07:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2018-01-27 23:07:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-27 23:07:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-01-27 23:07:01,560 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 87 [2018-01-27 23:07:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:01,561 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-01-27 23:07:01,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:07:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-01-27 23:07:01,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-27 23:07:01,566 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:01,566 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:07:01,566 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:01,566 INFO L82 PathProgramCache]: Analyzing trace with hash -748922802, now seen corresponding path program 4 times [2018-01-27 23:07:01,567 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:01,567 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:01,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:01,568 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:01,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:01,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:02,094 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:07:02,094 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:02,094 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) [2018-01-27 23:07:02,106 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:07:02,157 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:02,169 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:02,279 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:07:02,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:02,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-27 23:07:02,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:07:02,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:07:02,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:07:02,314 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 8 states. [2018-01-27 23:07:02,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:02,429 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-01-27 23:07:02,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:07:02,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2018-01-27 23:07:02,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:02,433 INFO L225 Difference]: With dead ends: 128 [2018-01-27 23:07:02,433 INFO L226 Difference]: Without dead ends: 81 [2018-01-27 23:07:02,433 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:07:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-27 23:07:02,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-27 23:07:02,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-27 23:07:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-01-27 23:07:02,445 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 107 [2018-01-27 23:07:02,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:02,445 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-01-27 23:07:02,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:07:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-01-27 23:07:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-27 23:07:02,447 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:02,447 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:07:02,447 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:02,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1381891197, now seen corresponding path program 5 times [2018-01-27 23:07:02,450 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:02,450 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:02,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:02,451 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:02,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:02,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-01-27 23:07:02,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:02,687 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:07:02,697 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-27 23:07:02,714 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:02,718 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:02,723 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:02,730 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:02,741 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:02,746 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:02,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:02,777 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:07:02,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:02,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-27 23:07:02,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-27 23:07:02,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-27 23:07:02,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:07:02,799 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 6 states. [2018-01-27 23:07:02,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:02,821 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-01-27 23:07:02,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-27 23:07:02,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-01-27 23:07:02,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:02,823 INFO L225 Difference]: With dead ends: 135 [2018-01-27 23:07:02,824 INFO L226 Difference]: Without dead ends: 89 [2018-01-27 23:07:02,824 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 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:07:02,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-27 23:07:02,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-01-27 23:07:02,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-27 23:07:02,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-01-27 23:07:02,832 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 112 [2018-01-27 23:07:02,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:02,833 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-01-27 23:07:02,833 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-27 23:07:02,833 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-01-27 23:07:02,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-01-27 23:07:02,834 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:02,835 INFO L330 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 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:07:02,835 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:02,835 INFO L82 PathProgramCache]: Analyzing trace with hash 168012405, now seen corresponding path program 6 times [2018-01-27 23:07:02,835 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:02,835 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:02,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:02,836 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:02,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:02,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:03,023 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-01-27 23:07:03,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:03,024 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:07:03,031 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-27 23:07:03,047 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:03,063 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:03,068 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:03,074 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:03,081 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:03,096 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:03,101 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-01-27 23:07:03,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:03,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-01-27 23:07:03,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:07:03,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:07:03,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:07:03,163 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 8 states. [2018-01-27 23:07:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:03,287 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2018-01-27 23:07:03,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-27 23:07:03,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-01-27 23:07:03,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:03,289 INFO L225 Difference]: With dead ends: 155 [2018-01-27 23:07:03,289 INFO L226 Difference]: Without dead ends: 104 [2018-01-27 23:07:03,290 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:07:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-27 23:07:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2018-01-27 23:07:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-27 23:07:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2018-01-27 23:07:03,298 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 127 [2018-01-27 23:07:03,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:03,299 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2018-01-27 23:07:03,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:07:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-01-27 23:07:03,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-01-27 23:07:03,301 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:03,301 INFO L330 BasicCegarLoop]: trace histogram [15, 12, 12, 12, 12, 6, 5, 5, 5, 5, 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:07:03,301 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:03,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2126496645, now seen corresponding path program 7 times [2018-01-27 23:07:03,302 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:03,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:03,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:03,303 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:03,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:03,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-01-27 23:07:03,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:03,621 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:07:03,627 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:03,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 198 proven. 38 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-01-27 23:07:03,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:03,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-27 23:07:03,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:07:03,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:07:03,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:07:03,719 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 8 states. [2018-01-27 23:07:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:03,745 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2018-01-27 23:07:03,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:07:03,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 148 [2018-01-27 23:07:03,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:03,747 INFO L225 Difference]: With dead ends: 164 [2018-01-27 23:07:03,747 INFO L226 Difference]: Without dead ends: 102 [2018-01-27 23:07:03,747 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 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:07:03,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-27 23:07:03,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-01-27 23:07:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-27 23:07:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-01-27 23:07:03,755 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 148 [2018-01-27 23:07:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:03,756 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-01-27 23:07:03,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:07:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-01-27 23:07:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-01-27 23:07:03,758 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:03,758 INFO L330 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 6, 5, 5, 5, 5, 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:07:03,758 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:03,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1438757357, now seen corresponding path program 8 times [2018-01-27 23:07:03,759 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:03,759 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:03,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:03,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:03,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:03,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-01-27 23:07:03,976 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:03,976 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:07:03,981 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:07:04,000 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:04,028 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:04,040 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:04,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 302 proven. 10 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-01-27 23:07:04,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:04,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-27 23:07:04,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-27 23:07:04,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-27 23:07:04,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:07:04,211 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 6 states. [2018-01-27 23:07:04,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:04,253 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2018-01-27 23:07:04,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-27 23:07:04,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2018-01-27 23:07:04,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:04,254 INFO L225 Difference]: With dead ends: 154 [2018-01-27 23:07:04,254 INFO L226 Difference]: Without dead ends: 112 [2018-01-27 23:07:04,255 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:07:04,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-27 23:07:04,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-01-27 23:07:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-27 23:07:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-01-27 23:07:04,270 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 163 [2018-01-27 23:07:04,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:04,271 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-01-27 23:07:04,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-27 23:07:04,271 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-01-27 23:07:04,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-01-27 23:07:04,272 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:04,273 INFO L330 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 6, 5, 5, 5, 5, 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:07:04,273 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:04,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1528722203, now seen corresponding path program 9 times [2018-01-27 23:07:04,273 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:04,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:04,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:04,274 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:04,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:04,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-01-27 23:07:04,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:04,709 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) [2018-01-27 23:07:04,720 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:07:04,742 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:04,759 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:04,776 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:04,792 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:04,809 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:04,822 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:04,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 302 proven. 24 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-01-27 23:07:04,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:04,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-01-27 23:07:04,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-27 23:07:04,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-27 23:07:04,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-27 23:07:04,989 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 7 states. [2018-01-27 23:07:05,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:05,173 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2018-01-27 23:07:05,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-27 23:07:05,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 169 [2018-01-27 23:07:05,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:05,174 INFO L225 Difference]: With dead ends: 156 [2018-01-27 23:07:05,174 INFO L226 Difference]: Without dead ends: 114 [2018-01-27 23:07:05,175 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-27 23:07:05,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-27 23:07:05,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-27 23:07:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-27 23:07:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2018-01-27 23:07:05,186 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 169 [2018-01-27 23:07:05,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:05,187 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2018-01-27 23:07:05,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-27 23:07:05,187 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2018-01-27 23:07:05,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-01-27 23:07:05,188 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:05,188 INFO L330 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 6, 5, 5, 5, 5, 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:07:05,189 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:05,189 INFO L82 PathProgramCache]: Analyzing trace with hash 775900637, now seen corresponding path program 10 times [2018-01-27 23:07:05,189 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:05,189 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:05,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:05,190 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:05,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:07:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:07:05,464 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-27 23:07:05,486 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:07:05,493 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:07:05,498 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:07:05,504 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:07:05,505 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:07:05,506 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:07:05,540 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:07:05,540 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:07:05,540 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:07:05,540 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:07:05,540 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:07:05,540 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:07:05,541 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:07:05,541 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == sumErr0EnsuresViolation======== [2018-01-27 23:07:05,541 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:07:05,542 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:07:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-27 23:07:05,543 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:05,543 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:07:05,543 INFO L371 AbstractCegarLoop]: === Iteration 1 === [sumErr0EnsuresViolation]=== [2018-01-27 23:07:05,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1916362052, now seen corresponding path program 1 times [2018-01-27 23:07:05,543 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:05,543 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:05,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:05,544 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:05,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:05,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:05,550 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:07:05,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:07:05,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:07:05,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:07:05,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:07:05,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:07:05,551 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-01-27 23:07:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:05,554 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-01-27 23:07:05,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:07:05,554 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-27 23:07:05,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:05,555 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:07:05,555 INFO L226 Difference]: Without dead ends: 0 [2018-01-27 23:07:05,555 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:07:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-27 23:07:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-27 23:07:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-27 23:07:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-27 23:07:05,556 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-01-27 23:07:05,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:05,556 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-27 23:07:05,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:07:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-27 23:07:05,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-27 23:07:05,559 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:07:05,559 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:07:05,559 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:07:05,560 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:07:05,560 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:07:05,560 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:07:05,560 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:07:05,560 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-27 23:07:05,560 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:07:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:07:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-27 23:07:05,565 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:05,566 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:07:05,566 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-27 23:07:05,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1996453586, now seen corresponding path program 1 times [2018-01-27 23:07:05,566 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:05,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:05,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:05,567 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:05,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:05,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:05,581 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:07:05,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:07:05,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:07:05,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:07:05,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:07:05,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:07:05,582 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-01-27 23:07:05,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:05,586 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-01-27 23:07:05,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:07:05,586 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 44 [2018-01-27 23:07:05,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:05,587 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:07:05,587 INFO L226 Difference]: Without dead ends: 48 [2018-01-27 23:07:05,587 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:07:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-27 23:07:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-27 23:07:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-27 23:07:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-27 23:07:05,593 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 44 [2018-01-27 23:07:05,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:05,594 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-27 23:07:05,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:07:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-27 23:07:05,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-27 23:07:05,594 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:05,595 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:07:05,595 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-27 23:07:05,595 INFO L82 PathProgramCache]: Analyzing trace with hash -179793732, now seen corresponding path program 1 times [2018-01-27 23:07:05,595 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:05,595 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:05,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:05,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:05,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:05,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:05,661 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:07:05,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:07:05,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:07:05,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:07:05,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:07:05,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:07:05,662 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 3 states. [2018-01-27 23:07:05,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:05,763 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-01-27 23:07:05,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:07:05,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-01-27 23:07:05,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:05,764 INFO L225 Difference]: With dead ends: 89 [2018-01-27 23:07:05,764 INFO L226 Difference]: Without dead ends: 53 [2018-01-27 23:07:05,765 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:07:05,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-27 23:07:05,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-01-27 23:07:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-27 23:07:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-27 23:07:05,769 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 49 [2018-01-27 23:07:05,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:05,769 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-27 23:07:05,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:07:05,770 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-27 23:07:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-27 23:07:05,771 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:05,771 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:07:05,771 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-27 23:07:05,771 INFO L82 PathProgramCache]: Analyzing trace with hash 534973867, now seen corresponding path program 1 times [2018-01-27 23:07:05,772 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:05,772 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:05,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:05,773 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:05,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:05,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:05,847 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:07:05,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:05,848 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) [2018-01-27 23:07:05,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:07:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:05,898 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:05,982 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:07:06,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 23:07:06,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-01-27 23:07:06,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-27 23:07:06,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-27 23:07:06,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:07:06,002 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2018-01-27 23:07:06,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:06,011 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-01-27 23:07:06,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:07:06,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-01-27 23:07:06,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:06,012 INFO L225 Difference]: With dead ends: 90 [2018-01-27 23:07:06,012 INFO L226 Difference]: Without dead ends: 55 [2018-01-27 23:07:06,013 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:07:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-27 23:07:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-01-27 23:07:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-27 23:07:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-27 23:07:06,027 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 54 [2018-01-27 23:07:06,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:06,027 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-27 23:07:06,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-27 23:07:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-27 23:07:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-27 23:07:06,028 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:06,028 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:07:06,028 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-27 23:07:06,028 INFO L82 PathProgramCache]: Analyzing trace with hash -29908045, now seen corresponding path program 1 times [2018-01-27 23:07:06,028 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:06,029 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:06,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:06,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:06,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:06,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:06,118 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:07:06,119 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:07:06,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:07:06,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:07:06,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:07:06,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:07:06,120 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 3 states. [2018-01-27 23:07:06,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:06,185 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-27 23:07:06,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:07:06,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-01-27 23:07:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:06,186 INFO L225 Difference]: With dead ends: 78 [2018-01-27 23:07:06,186 INFO L226 Difference]: Without dead ends: 58 [2018-01-27 23:07:06,186 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:07:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-27 23:07:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-01-27 23:07:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-27 23:07:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-27 23:07:06,191 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 69 [2018-01-27 23:07:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:06,192 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-27 23:07:06,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:07:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-27 23:07:06,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-27 23:07:06,193 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:06,193 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:07:06,193 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-27 23:07:06,193 INFO L82 PathProgramCache]: Analyzing trace with hash -704975701, now seen corresponding path program 1 times [2018-01-27 23:07:06,193 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:06,193 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:06,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:06,195 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:06,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:06,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:06,373 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:07:06,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:06,373 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) [2018-01-27 23:07:06,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:07:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:06,427 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:06,456 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:07:06,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:06,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-27 23:07:06,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-27 23:07:06,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-27 23:07:06,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:07:06,490 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2018-01-27 23:07:06,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:06,688 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-01-27 23:07:06,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-27 23:07:06,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-01-27 23:07:06,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:06,689 INFO L225 Difference]: With dead ends: 102 [2018-01-27 23:07:06,689 INFO L226 Difference]: Without dead ends: 62 [2018-01-27 23:07:06,689 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 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:07:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-27 23:07:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-01-27 23:07:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-27 23:07:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-01-27 23:07:06,693 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 75 [2018-01-27 23:07:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:06,693 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-01-27 23:07:06,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-27 23:07:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-01-27 23:07:06,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-27 23:07:06,694 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:06,694 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:07:06,694 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-27 23:07:06,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1524698330, now seen corresponding path program 2 times [2018-01-27 23:07:06,695 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:06,695 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:06,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:06,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:06,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:06,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:07:06,834 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:07:06,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:06,834 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:07:06,839 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:07:06,851 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:06,852 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:06,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:07,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 23:07:07,211 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:07:07,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 23:07:07,238 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:07:07,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-27 23:07:07,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 23:07:07,544 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:07:07,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 23:07:07,545 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:07:07,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-27 23:07:07,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 23:07:07,725 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:07:07,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 23:07:07,752 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:07:07,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-27 23:07:08,064 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:07:08,093 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:07:08,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 23:07:08,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-01-27 23:07:08,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-27 23:07:08,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-27 23:07:08,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2018-01-27 23:07:08,128 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 9 states. [2018-01-27 23:07:08,746 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-27 23:07:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:08,940 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-01-27 23:07:08,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-27 23:07:08,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-01-27 23:07:08,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:08,941 INFO L225 Difference]: With dead ends: 106 [2018-01-27 23:07:08,941 INFO L226 Difference]: Without dead ends: 0 [2018-01-27 23:07:08,941 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=47, Invalid=112, Unknown=1, NotChecked=22, Total=182 [2018-01-27 23:07:08,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-27 23:07:08,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-27 23:07:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-27 23:07:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-27 23:07:08,942 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2018-01-27 23:07:08,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:08,942 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-27 23:07:08,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-27 23:07:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-27 23:07:08,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-27 23:07:08,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:07:08 BoogieIcfgContainer [2018-01-27 23:07:08,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-27 23:07:08,946 INFO L168 Benchmark]: Toolchain (without parser) took 11804.13 ms. Allocated memory was 303.0 MB in the beginning and 554.7 MB in the end (delta: 251.7 MB). Free memory was 262.3 MB in the beginning and 375.8 MB in the end (delta: -113.5 MB). Peak memory consumption was 138.2 MB. Max. memory is 5.3 GB. [2018-01-27 23:07:08,948 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 303.0 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-27 23:07:08,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.01 ms. Allocated memory is still 303.0 MB. Free memory was 261.3 MB in the beginning and 253.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-01-27 23:07:08,948 INFO L168 Benchmark]: Boogie Preprocessor took 60.61 ms. Allocated memory is still 303.0 MB. Free memory was 253.3 MB in the beginning and 251.3 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:07:08,949 INFO L168 Benchmark]: RCFGBuilder took 647.74 ms. Allocated memory is still 303.0 MB. Free memory was 251.3 MB in the beginning and 233.7 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-27 23:07:08,949 INFO L168 Benchmark]: TraceAbstraction took 10795.51 ms. Allocated memory was 303.0 MB in the beginning and 554.7 MB in the end (delta: 251.7 MB). Free memory was 233.7 MB in the beginning and 375.8 MB in the end (delta: -142.1 MB). Peak memory consumption was 109.5 MB. Max. memory is 5.3 GB. [2018-01-27 23:07:08,951 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.23 ms. Allocated memory is still 303.0 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 286.01 ms. Allocated memory is still 303.0 MB. Free memory was 261.3 MB in the beginning and 253.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 60.61 ms. Allocated memory is still 303.0 MB. Free memory was 253.3 MB in the beginning and 251.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 647.74 ms. Allocated memory is still 303.0 MB. Free memory was 251.3 MB in the beginning and 233.7 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10795.51 ms. Allocated memory was 303.0 MB in the beginning and 554.7 MB in the end (delta: 251.7 MB). Free memory was 233.7 MB in the beginning and 375.8 MB in the end (delta: -142.1 MB). Peak memory consumption was 109.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.2s 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: [L17] FCALL int x[5]; VAL [x={4294967297:0}] [L18] int temp; [L19] int ret; [L20] int ret2; [L21] int ret5; [L23] int i = 0; VAL [i=0, x={4294967297:0}] [L23] COND TRUE i < 5 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=0, x={4294967297:0}] [L23] i++ VAL [i=1, x={4294967297:0}] [L23] COND TRUE i < 5 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-3, i=1, x={4294967297:0}] [L23] i++ VAL [i=2, x={4294967297:0}] [L23] COND TRUE i < 5 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=2, x={4294967297:0}] [L23] i++ VAL [i=3, x={4294967297:0}] [L23] COND TRUE i < 5 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, i=3, x={4294967297:0}] [L23] i++ VAL [i=4, x={4294967297:0}] [L23] COND TRUE i < 5 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, i=4, x={4294967297:0}] [L23] i++ VAL [i=5, x={4294967297:0}] [L23] COND FALSE !(i < 5) VAL [i=5, x={4294967297:0}] [L27] CALL, EXPR sum(x) VAL [x={4294967297:0}] [L6] int i; [L7] long long ret; [L8] ret = 0 [L9] i = 0 VAL [i=0, ret=0, x={4294967297:0}, x={4294967297:0}] [L9] COND TRUE i < 5 VAL [i=0, ret=0, x={4294967297:0}, x={4294967297:0}] [L10] EXPR, FCALL x[i] VAL [i=0, ret=0, x={4294967297:0}, x={4294967297:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=1, ret=0, x={4294967297:0}, x={4294967297:0}] [L9] COND TRUE i < 5 VAL [i=1, ret=0, x={4294967297:0}, x={4294967297:0}] [L10] EXPR, FCALL x[i] VAL [i=1, ret=0, x={4294967297:0}, x={4294967297:0}, x[i]=-3] [L10] ret = ret + x[i] [L9] i++ VAL [i=2, ret=-3, x={4294967297:0}, x={4294967297:0}] [L9] COND TRUE i < 5 VAL [i=2, ret=-3, x={4294967297:0}, x={4294967297:0}] [L10] EXPR, FCALL x[i] VAL [i=2, ret=-3, x={4294967297:0}, x={4294967297:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=3, ret=-3, x={4294967297:0}, x={4294967297:0}] [L9] COND TRUE i < 5 VAL [i=3, ret=-3, x={4294967297:0}, x={4294967297:0}] [L10] EXPR, FCALL x[i] VAL [i=3, ret=-3, x={4294967297:0}, x={4294967297:0}, x[i]=1] [L10] ret = ret + x[i] [L9] i++ VAL [i=4, ret=-2, x={4294967297:0}, x={4294967297:0}] [L9] COND TRUE i < 5 VAL [i=4, ret=-2, x={4294967297:0}, x={4294967297:0}] [L10] EXPR, FCALL x[i] VAL [i=4, ret=-2, x={4294967297:0}, x={4294967297:0}, x[i]=1] [L10] ret = ret + x[i] [L9] i++ VAL [i=5, ret=-1, x={4294967297:0}, x={4294967297:0}] [L9] COND FALSE !(i < 5) VAL [i=5, ret=-1, x={4294967297:0}, x={4294967297:0}] [L12] RET return ret; VAL [\result=-1, i=5, ret=-1, x={4294967297:0}, x={4294967297:0}] [L27] EXPR sum(x) VAL [i=5, sum(x)=-1, x={4294967297:0}] [L27] ret = sum(x) [L29] EXPR, FCALL x[0] VAL [i=5, ret=-1, x={4294967297:0}, x[0]=0] [L29] temp=x[0] [L29] EXPR, FCALL x[1] VAL [i=5, ret=-1, temp=0, x={4294967297:0}, x[1]=-3] [L29] FCALL x[0] = x[1] VAL [i=5, ret=-1, temp=0, x={4294967297:0}, x[1]=-3] [L29] FCALL x[1] = temp VAL [i=5, ret=-1, temp=0, x={4294967297:0}] [L30] CALL, EXPR sum(x) VAL [x={4294967297:0}] [L6] int i; [L7] long long ret; [L8] ret = 0 [L9] i = 0 VAL [i=0, ret=0, x={4294967297:0}, x={4294967297:0}] [L9] COND TRUE i < 5 VAL [i=0, ret=0, x={4294967297:0}, x={4294967297:0}] [L10] EXPR, FCALL x[i] VAL [i=0, ret=0, x={4294967297:0}, x={4294967297:0}, x[i]=-3] [L10] ret = ret + x[i] [L9] i++ VAL [i=1, ret=-3, x={4294967297:0}, x={4294967297:0}] [L9] COND TRUE i < 5 VAL [i=1, ret=-3, x={4294967297:0}, x={4294967297:0}] [L10] EXPR, FCALL x[i] VAL [i=1, ret=-3, x={4294967297:0}, x={4294967297:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=2, ret=-3, x={4294967297:0}, x={4294967297:0}] [L9] COND TRUE i < 5 VAL [i=2, ret=-3, x={4294967297:0}, x={4294967297:0}] [L10] EXPR, FCALL x[i] VAL [i=2, ret=-3, x={4294967297:0}, x={4294967297:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=3, ret=-3, x={4294967297:0}, x={4294967297:0}] [L9] COND TRUE i < 5 VAL [i=3, ret=-3, x={4294967297:0}, x={4294967297:0}] [L10] EXPR, FCALL x[i] VAL [i=3, ret=-3, x={4294967297:0}, x={4294967297:0}, x[i]=1] [L10] ret = ret + x[i] [L9] i++ VAL [i=4, ret=-2, x={4294967297:0}, x={4294967297:0}] [L9] COND TRUE i < 5 VAL [i=4, ret=-2, x={4294967297:0}, x={4294967297:0}] [L10] EXPR, FCALL x[i] VAL [i=4, ret=-2, x={4294967297:0}, x={4294967297:0}, x[i]=1] [L10] ret = ret + x[i] [L9] i++ VAL [i=5, ret=-1, x={4294967297:0}, x={4294967297:0}] [L9] COND FALSE !(i < 5) VAL [i=5, ret=-1, x={4294967297:0}, x={4294967297:0}] [L12] RET return ret; VAL [\result=-1, i=5, ret=-1, x={4294967297:0}, x={4294967297:0}] [L30] EXPR sum(x) VAL [i=5, ret=-1, sum(x)=-1, temp=0, x={4294967297:0}] [L30] ret2 = sum(x) [L31] EXPR, FCALL x[0] VAL [i=5, ret=-1, ret2=-1, temp=0, x={4294967297:0}, x[0]=-3] [L31] temp=x[0] [L32] int i =0 ; VAL [i=5, i=0, ret=-1, ret2=-1, temp=-3, x={4294967297:0}] [L32] COND TRUE i<5 -1 VAL [i=5, i=0, ret=-1, ret2=-1, temp=-3, x={4294967297:0}] [L33] EXPR, FCALL x[i+1] VAL [i=0, i=5, ret=-1, ret2=-1, temp=-3, x={4294967297:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=5, i=0, ret=-1, ret2=-1, temp=-3, x={4294967297:0}, x[i+1]=0] [L32] i++ VAL [i=1, i=5, ret=-1, ret2=-1, temp=-3, x={4294967297:0}] [L32] COND TRUE i<5 -1 VAL [i=1, i=5, ret=-1, ret2=-1, temp=-3, x={4294967297:0}] [L33] EXPR, FCALL x[i+1] VAL [i=1, i=5, ret=-1, ret2=-1, temp=-3, x={4294967297:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=5, i=1, ret=-1, ret2=-1, temp=-3, x={4294967297:0}, x[i+1]=0] [L32] i++ VAL [i=2, i=5, ret=-1, ret2=-1, temp=-3, x={4294967297:0}] [L32] COND TRUE i<5 -1 VAL [i=2, i=5, ret=-1, ret2=-1, temp=-3, x={4294967297:0}] [L33] EXPR, FCALL x[i+1] VAL [i=5, i=2, ret=-1, ret2=-1, temp=-3, x={4294967297:0}, x[i+1]=1] [L33] FCALL x[i] = x[i+1] VAL [i=5, i=2, ret=-1, ret2=-1, temp=-3, x={4294967297:0}, x[i+1]=1] [L32] i++ VAL [i=3, i=5, ret=-1, ret2=-1, temp=-3, x={4294967297:0}] [L32] COND TRUE i<5 -1 VAL [i=5, i=3, ret=-1, ret2=-1, temp=-3, x={4294967297:0}] [L33] EXPR, FCALL x[i+1] VAL [i=5, i=3, ret=-1, ret2=-1, temp=-3, x={4294967297:0}, x[i+1]=1] [L33] FCALL x[i] = x[i+1] VAL [i=3, i=5, ret=-1, ret2=-1, temp=-3, x={4294967297:0}, x[i+1]=1] [L32] i++ VAL [i=5, i=4, ret=-1, ret2=-1, temp=-3, x={4294967297:0}] [L32] COND FALSE !(i<5 -1) VAL [i=5, i=4, ret=-1, ret2=-1, temp=-3, x={4294967297:0}] [L35] FCALL x[5 -1] = temp VAL [i=5, i=4, ret=-1, ret2=-1, temp=-3, x={4294967297:0}] [L36] CALL, EXPR sum(x) VAL [x={4294967297:0}] [L6] int i; [L7] long long ret; [L8] ret = 0 [L9] i = 0 VAL [i=0, ret=0, x={4294967297:0}, x={4294967297:0}] [L9] COND TRUE i < 5 VAL [i=0, ret=0, x={4294967297:0}, x={4294967297:0}] [L10] EXPR, FCALL x[i] VAL [i=0, ret=0, x={4294967297:0}, x={4294967297:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=1, ret=0, x={4294967297:0}, x={4294967297:0}] [L9] COND TRUE i < 5 VAL [i=1, ret=0, x={4294967297:0}, x={4294967297:0}] [L10] EXPR, FCALL x[i] VAL [i=1, ret=0, x={4294967297:0}, x={4294967297:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=2, ret=0, x={4294967297:0}, x={4294967297:0}] [L9] COND TRUE i < 5 VAL [i=2, ret=0, x={4294967297:0}, x={4294967297:0}] [L10] EXPR, FCALL x[i] VAL [i=2, ret=0, x={4294967297:0}, x={4294967297:0}, x[i]=1] [L10] ret = ret + x[i] [L9] i++ VAL [i=3, ret=1, x={4294967297:0}, x={4294967297:0}] [L9] COND TRUE i < 5 VAL [i=3, ret=1, x={4294967297:0}, x={4294967297:0}] [L10] EXPR, FCALL x[i] VAL [i=3, ret=1, x={4294967297:0}, x={4294967297:0}, x[i]=1] [L10] ret = ret + x[i] [L9] i++ VAL [i=4, ret=2, x={4294967297:0}, x={4294967297:0}] [L9] COND TRUE i < 5 VAL [i=4, ret=2, x={4294967297:0}, x={4294967297:0}] [L10] EXPR, FCALL x[i] VAL [i=4, ret=2, x={4294967297:0}, x={4294967297:0}, x[i]=-3] [L10] ret = ret + x[i] [L9] i++ VAL [i=5, ret=-1, x={4294967297:0}, x={4294967297:0}] [L9] COND FALSE !(i < 5) VAL [i=5, ret=-1, x={4294967297:0}, x={4294967297:0}] [L12] RET return ret; VAL [\result=-1, i=5, ret=-1, x={4294967297:0}, x={4294967297:0}] [L36] EXPR sum(x) VAL [i=5, i=4, ret=-1, ret2=-1, sum(x)=-1, temp=-3, x={4294967297:0}] [L36] ret5 = sum(x) [L38] COND FALSE !(ret != ret2 || ret !=ret5) VAL [i=5, i=4, ret=-1, ret2=-1, ret5=-1, temp=-3, x={4294967297:0}] [L41] return 1; VAL [\result=1, i=4, i=5, ret=-1, ret2=-1, ret5=-1, temp=-3, x={4294967297:0}] [L41] return 1; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. UNSAFE Result, 7.1s OverallTime, 14 OverallIterations, 18 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 659 SDtfs, 130 SDslu, 1823 SDs, 0 SdLazy, 263 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1180 GetRequests, 1132 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 36 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2599 NumberOfCodeBlocks, 2429 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2401 ConstructedInterpolants, 0 QuantifiedInterpolants, 353429 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2051 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 23 InterpolantComputations, 4 PerfectInterpolantSequences, 4968/5676 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: sumErr0EnsuresViolation 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: 57 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 - PositiveResult [Line: 15]: 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.3s OverallTime, 6 OverallIterations, 6 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 286 SDtfs, 75 SDslu, 330 SDs, 0 SdLazy, 131 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s 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.8s InterpolantComputationTime, 580 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 571 ConstructedInterpolants, 35 QuantifiedInterpolants, 91665 SizeOfPredicates, 5 NumberOfNonLiveVariables, 400 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 337/360 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/sum05_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-27_23-07-08-962.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sum05_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-27_23-07-08-962.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sum05_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-27_23-07-08-962.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sum05_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-27_23-07-08-962.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sum05_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-27_23-07-08-962.csv Received shutdown request...