./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-acceleration/diamond_true-unreach-call2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loop-acceleration/diamond_true-unreach-call2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3de88212c8693b9f87e164f2a8585947c848ea21 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 05:57:09,561 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 05:57:09,563 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 05:57:09,577 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 05:57:09,577 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 05:57:09,578 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 05:57:09,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 05:57:09,582 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 05:57:09,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 05:57:09,584 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 05:57:09,586 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 05:57:09,586 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 05:57:09,587 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 05:57:09,588 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 05:57:09,589 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 05:57:09,590 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 05:57:09,591 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 05:57:09,593 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 05:57:09,596 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 05:57:09,598 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 05:57:09,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 05:57:09,600 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 05:57:09,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 05:57:09,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 05:57:09,603 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 05:57:09,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 05:57:09,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 05:57:09,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 05:57:09,608 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 05:57:09,609 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 05:57:09,610 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 05:57:09,610 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 05:57:09,611 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 05:57:09,611 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 05:57:09,612 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 05:57:09,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 05:57:09,613 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 05:57:09,629 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 05:57:09,629 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 05:57:09,630 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 05:57:09,630 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 05:57:09,631 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 05:57:09,631 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 05:57:09,631 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 05:57:09,632 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 05:57:09,632 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 05:57:09,632 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 05:57:09,632 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 05:57:09,632 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 05:57:09,633 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 05:57:09,633 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 05:57:09,633 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 05:57:09,633 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 05:57:09,633 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 05:57:09,633 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 05:57:09,634 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 05:57:09,635 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 05:57:09,635 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 05:57:09,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 05:57:09,636 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 05:57:09,636 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 05:57:09,636 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 05:57:09,636 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 05:57:09,637 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 05:57:09,638 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 05:57:09,638 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3de88212c8693b9f87e164f2a8585947c848ea21 [2018-12-31 05:57:09,687 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 05:57:09,702 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 05:57:09,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 05:57:09,710 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 05:57:09,711 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 05:57:09,712 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-acceleration/diamond_true-unreach-call2.i [2018-12-31 05:57:09,773 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff831988a/177c8b46155045b39b82b2b2a264f7fb/FLAGe29cfe1b1 [2018-12-31 05:57:10,254 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 05:57:10,255 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-acceleration/diamond_true-unreach-call2.i [2018-12-31 05:57:10,262 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff831988a/177c8b46155045b39b82b2b2a264f7fb/FLAGe29cfe1b1 [2018-12-31 05:57:10,589 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff831988a/177c8b46155045b39b82b2b2a264f7fb [2018-12-31 05:57:10,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 05:57:10,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 05:57:10,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 05:57:10,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 05:57:10,601 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 05:57:10,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:57:10" (1/1) ... [2018-12-31 05:57:10,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f9b7a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:57:10, skipping insertion in model container [2018-12-31 05:57:10,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:57:10" (1/1) ... [2018-12-31 05:57:10,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 05:57:10,634 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 05:57:10,859 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:57:10,872 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 05:57:10,906 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:57:10,925 INFO L195 MainTranslator]: Completed translation [2018-12-31 05:57:10,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:57:10 WrapperNode [2018-12-31 05:57:10,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 05:57:10,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 05:57:10,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 05:57:10,927 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 05:57:10,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:57:10" (1/1) ... [2018-12-31 05:57:10,944 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:57:10" (1/1) ... [2018-12-31 05:57:10,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 05:57:10,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 05:57:10,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 05:57:10,972 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 05:57:10,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:57:10" (1/1) ... [2018-12-31 05:57:10,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:57:10" (1/1) ... [2018-12-31 05:57:10,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:57:10" (1/1) ... [2018-12-31 05:57:10,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:57:10" (1/1) ... [2018-12-31 05:57:10,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:57:10" (1/1) ... [2018-12-31 05:57:10,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:57:10" (1/1) ... [2018-12-31 05:57:10,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:57:10" (1/1) ... [2018-12-31 05:57:11,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 05:57:11,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 05:57:11,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 05:57:11,002 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 05:57:11,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:57:10" (1/1) ... No working directory specified, using /storage/repos/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-12-31 05:57:11,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 05:57:11,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 05:57:11,512 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 05:57:11,512 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-31 05:57:11,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:57:11 BoogieIcfgContainer [2018-12-31 05:57:11,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 05:57:11,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 05:57:11,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 05:57:11,519 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 05:57:11,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 05:57:10" (1/3) ... [2018-12-31 05:57:11,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9b78cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:57:11, skipping insertion in model container [2018-12-31 05:57:11,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:57:10" (2/3) ... [2018-12-31 05:57:11,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9b78cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:57:11, skipping insertion in model container [2018-12-31 05:57:11,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:57:11" (3/3) ... [2018-12-31 05:57:11,524 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-12-31 05:57:11,536 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 05:57:11,546 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 05:57:11,567 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 05:57:11,603 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 05:57:11,605 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 05:57:11,608 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 05:57:11,608 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 05:57:11,608 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 05:57:11,608 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 05:57:11,608 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 05:57:11,609 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 05:57:11,609 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 05:57:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-31 05:57:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-31 05:57:11,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:57:11,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-31 05:57:11,643 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:57:11,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:57:11,650 INFO L82 PathProgramCache]: Analyzing trace with hash 31771204, now seen corresponding path program 1 times [2018-12-31 05:57:11,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:57:11,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:57:11,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:57:11,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:57:11,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:57:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:57:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:57:11,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:57:11,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 05:57:11,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 05:57:11,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 05:57:11,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 05:57:11,794 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-12-31 05:57:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:57:11,809 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2018-12-31 05:57:11,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 05:57:11,811 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2018-12-31 05:57:11,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:57:11,822 INFO L225 Difference]: With dead ends: 26 [2018-12-31 05:57:11,823 INFO L226 Difference]: Without dead ends: 16 [2018-12-31 05:57:11,826 INFO L631 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-12-31 05:57:11,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-31 05:57:11,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-31 05:57:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-31 05:57:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2018-12-31 05:57:11,864 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 5 [2018-12-31 05:57:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:57:11,865 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 26 transitions. [2018-12-31 05:57:11,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 05:57:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2018-12-31 05:57:11,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-31 05:57:11,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:57:11,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-31 05:57:11,867 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:57:11,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:57:11,867 INFO L82 PathProgramCache]: Analyzing trace with hash 29864580, now seen corresponding path program 1 times [2018-12-31 05:57:11,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:57:11,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:57:11,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:57:11,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:57:11,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:57:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:57:12,040 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2018-12-31 05:57:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:57:12,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:57:12,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 05:57:12,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 05:57:12,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 05:57:12,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 05:57:12,051 INFO L87 Difference]: Start difference. First operand 16 states and 26 transitions. Second operand 3 states. [2018-12-31 05:57:12,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:57:12,250 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2018-12-31 05:57:12,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 05:57:12,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-31 05:57:12,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:57:12,257 INFO L225 Difference]: With dead ends: 22 [2018-12-31 05:57:12,257 INFO L226 Difference]: Without dead ends: 18 [2018-12-31 05:57:12,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 05:57:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-31 05:57:12,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-31 05:57:12,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 05:57:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2018-12-31 05:57:12,267 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 5 [2018-12-31 05:57:12,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:57:12,268 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 27 transitions. [2018-12-31 05:57:12,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 05:57:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 27 transitions. [2018-12-31 05:57:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 05:57:12,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:57:12,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:57:12,270 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:57:12,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:57:12,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1273519218, now seen corresponding path program 1 times [2018-12-31 05:57:12,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:57:12,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:57:12,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:57:12,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:57:12,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:57:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:57:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:57:12,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:57:12,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 05:57:12,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 05:57:12,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 05:57:12,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 05:57:12,399 INFO L87 Difference]: Start difference. First operand 17 states and 27 transitions. Second operand 3 states. [2018-12-31 05:57:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:57:12,815 INFO L93 Difference]: Finished difference Result 47 states and 77 transitions. [2018-12-31 05:57:12,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 05:57:12,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-31 05:57:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:57:12,816 INFO L225 Difference]: With dead ends: 47 [2018-12-31 05:57:12,817 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 05:57:12,817 INFO L631 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-12-31 05:57:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 05:57:12,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-12-31 05:57:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 05:57:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-12-31 05:57:12,824 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 16 [2018-12-31 05:57:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:57:12,824 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-12-31 05:57:12,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 05:57:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2018-12-31 05:57:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 05:57:12,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:57:12,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:57:12,826 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:57:12,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:57:12,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1974583796, now seen corresponding path program 1 times [2018-12-31 05:57:12,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:57:12,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:57:12,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:57:12,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:57:12,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:57:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:57:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:57:13,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:57:13,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-12-31 05:57:13,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:57:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:57:13,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:57:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:57:13,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:57:13,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-31 05:57:13,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 05:57:13,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 05:57:13,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-12-31 05:57:13,626 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 14 states. [2018-12-31 05:57:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:57:14,405 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2018-12-31 05:57:14,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 05:57:14,406 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-12-31 05:57:14,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:57:14,407 INFO L225 Difference]: With dead ends: 45 [2018-12-31 05:57:14,407 INFO L226 Difference]: Without dead ends: 41 [2018-12-31 05:57:14,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-12-31 05:57:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-31 05:57:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-12-31 05:57:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-31 05:57:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2018-12-31 05:57:14,414 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 16 [2018-12-31 05:57:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:57:14,415 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2018-12-31 05:57:14,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 05:57:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2018-12-31 05:57:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 05:57:14,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:57:14,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:57:14,416 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:57:14,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:57:14,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1309266250, now seen corresponding path program 1 times [2018-12-31 05:57:14,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:57:14,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:57:14,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:57:14,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:57:14,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:57:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:57:16,547 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2018-12-31 05:57:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:57:16,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:57:16,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 05:57:16,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 05:57:16,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 05:57:16,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 05:57:16,551 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand 3 states. [2018-12-31 05:57:16,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:57:16,671 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-12-31 05:57:16,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 05:57:16,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-31 05:57:16,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:57:16,674 INFO L225 Difference]: With dead ends: 58 [2018-12-31 05:57:16,675 INFO L226 Difference]: Without dead ends: 43 [2018-12-31 05:57:16,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 05:57:16,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-31 05:57:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-31 05:57:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-31 05:57:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-12-31 05:57:16,682 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 16 [2018-12-31 05:57:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:57:16,682 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-12-31 05:57:16,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 05:57:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-12-31 05:57:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 05:57:16,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:57:16,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:57:16,683 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:57:16,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:57:16,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1301479604, now seen corresponding path program 1 times [2018-12-31 05:57:16,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:57:16,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:57:16,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:57:16,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:57:16,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:57:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:57:19,014 WARN L181 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 51 DAG size of output: 5 [2018-12-31 05:57:23,110 WARN L181 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-12-31 05:57:25,359 WARN L181 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 76 DAG size of output: 20 [2018-12-31 05:57:37,588 WARN L181 SmtUtils]: Spent 8.15 s on a formula simplification. DAG size of input: 75 DAG size of output: 18 [2018-12-31 05:57:41,720 WARN L181 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 76 DAG size of output: 20 [2018-12-31 05:57:43,739 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse15 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse10 (* 2 .cse15))) (let ((.cse13 (* (- 2) .cse15)) (.cse8 (= .cse10 c_ULTIMATE.start_main_~y~0)) (.cse14 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse6 (<= .cse14 c_ULTIMATE.start_main_~y~0)) (.cse3 (not .cse8)) (.cse4 (< c_ULTIMATE.start_main_~y~0 .cse14)) (.cse12 (div (+ c_ULTIMATE.start_main_~y~0 .cse13) 4294967296)) (.cse11 (div (+ c_ULTIMATE.start_main_~y~0 .cse13 (- 2)) 4294967296))) (let ((.cse2 (+ .cse11 1)) (.cse0 (+ .cse12 1)) (.cse9 (and .cse3 .cse4)) (.cse1 (or .cse6 .cse8))) (and (<= c_ULTIMATE.start_main_~x~0 3) (or (and (<= .cse0 0) .cse1) (and (<= .cse2 0) .cse3 .cse4) (let ((.cse5 (+ .cse10 (* 4294967296 .cse12))) (.cse7 (+ (* 4294967296 .cse11) .cse10 2))) (and (or (and (<= .cse5 c_ULTIMATE.start_main_~y~0) .cse1) (and (or .cse6 (< .cse7 c_ULTIMATE.start_main_~y~0) .cse8) (or .cse9 (< .cse5 c_ULTIMATE.start_main_~y~0))) (and .cse3 .cse4 (<= .cse7 c_ULTIMATE.start_main_~y~0))) (or (not (= .cse5 c_ULTIMATE.start_main_~y~0)) .cse9) (or (and .cse3 .cse4 (<= c_ULTIMATE.start_main_~y~0 .cse7)) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse10 3)) .cse3 .cse4) (and (<= c_ULTIMATE.start_main_~y~0 .cse5) .cse1) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse10 1)) .cse1)) (or .cse6 .cse8 (not (= .cse7 c_ULTIMATE.start_main_~y~0)))))) (<= 3 c_ULTIMATE.start_main_~x~0) (or (and (or .cse6 (< 0 .cse2) .cse8) (or (< 0 .cse0) .cse9)) (and .cse3 .cse4 (<= 0 .cse11)) (and (<= 0 .cse12) .cse1)))))))) is different from false [2018-12-31 05:57:47,825 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse31 (div c_ULTIMATE.start_main_~x~0 2))) (let ((.cse0 (+ .cse31 3)) (.cse32 (+ c_ULTIMATE.start_main_~x~0 5))) (and (or (< 0 .cse0) (let ((.cse35 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse10 (* 2 .cse35))) (let ((.cse33 (* (- 2) .cse35)) (.cse25 (= .cse10 c_ULTIMATE.start_main_~y~0)) (.cse34 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse24 (<= .cse34 c_ULTIMATE.start_main_~y~0)) (.cse6 (not .cse25)) (.cse7 (< c_ULTIMATE.start_main_~y~0 .cse34)) (.cse28 (div (+ c_ULTIMATE.start_main_~y~0 .cse33) 4294967296)) (.cse27 (div (+ c_ULTIMATE.start_main_~y~0 .cse33 (- 2)) 4294967296))) (let ((.cse5 (+ .cse27 1)) (.cse3 (+ .cse28 1)) (.cse26 (and .cse6 .cse7)) (.cse4 (or .cse24 .cse25))) (and (let ((.cse12 (* 2 .cse31)) (.cse29 (* 4294967296 (div c_ULTIMATE.start_main_~x~0 4294967296)))) (let ((.cse30 (* (- 2) .cse31)) (.cse17 (<= .cse29 c_ULTIMATE.start_main_~x~0)) (.cse18 (= .cse12 c_ULTIMATE.start_main_~x~0))) (let ((.cse1 (or .cse17 .cse18)) (.cse2 (div (+ c_ULTIMATE.start_main_~x~0 .cse30) 4294967296)) (.cse14 (not .cse18)) (.cse19 (div (+ c_ULTIMATE.start_main_~x~0 .cse30 (- 2)) 4294967296)) (.cse15 (< c_ULTIMATE.start_main_~x~0 .cse29))) (or (and .cse1 (<= (+ .cse2 1) 0)) (and (<= .cse3 0) .cse4) (and (<= .cse5 0) .cse6 .cse7) (let ((.cse23 (* 4294967296 .cse28)) (.cse9 (* 4294967296 .cse27))) (let ((.cse20 (+ .cse9 .cse10 2)) (.cse22 (+ .cse10 .cse23))) (and (let ((.cse21 (* 4294967296 .cse2))) (let ((.cse13 (+ .cse9 .cse10 c_ULTIMATE.start_main_~x~0)) (.cse8 (+ .cse12 c_ULTIMATE.start_main_~y~0 .cse21)) (.cse11 (* 4294967296 .cse19)) (.cse16 (+ .cse10 c_ULTIMATE.start_main_~x~0 .cse23))) (or (and .cse6 .cse7 (or (and (<= .cse8 (+ .cse9 .cse10 c_ULTIMATE.start_main_~x~0 2)) .cse1) (and (<= (+ .cse11 .cse12 c_ULTIMATE.start_main_~y~0) .cse13) .cse14 .cse15))) (and .cse6 .cse7 (or (and .cse1 (<= .cse8 (+ .cse9 .cse10 c_ULTIMATE.start_main_~x~0 1))) (and .cse14 (<= (+ .cse11 .cse12 c_ULTIMATE.start_main_~y~0 1) .cse13) .cse15))) (and (or (and .cse1 (<= .cse8 .cse16)) (and .cse14 .cse15 (<= (+ .cse11 .cse12 c_ULTIMATE.start_main_~y~0 2) .cse16))) .cse4) (and (or (< 0 .cse2) (and .cse14 .cse15)) (or .cse17 .cse18 (< 0 .cse19))) (and .cse6 .cse7 (<= c_ULTIMATE.start_main_~y~0 .cse20)) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse10 3)) .cse6 .cse7) (and .cse4 (or (and .cse14 (<= (+ .cse11 .cse12 c_ULTIMATE.start_main_~y~0 3) .cse16) .cse15) (and (<= (+ .cse12 c_ULTIMATE.start_main_~y~0 .cse21 1) .cse16) .cse1))) (and (<= c_ULTIMATE.start_main_~y~0 .cse22) .cse4) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse10 1)) .cse4) (<= c_ULTIMATE.start_main_~x~0 .cse12)))) (or (and .cse6 .cse7 (<= (+ .cse9 .cse10 3) c_ULTIMATE.start_main_~y~0)) (and (<= (+ .cse10 .cse23 1) c_ULTIMATE.start_main_~y~0) .cse4) (and (or .cse24 (< .cse20 c_ULTIMATE.start_main_~y~0) .cse25) (or .cse26 (< .cse22 c_ULTIMATE.start_main_~y~0))))))) (and .cse14 (<= (+ .cse19 1) 0) .cse15))))) (<= 0 .cse32) (or (and (or .cse24 (< 0 .cse5) .cse25) (or (< 0 .cse3) .cse26)) (and .cse6 .cse7 (<= 0 .cse27)) (and (<= 0 .cse28) .cse4))))))))) (or (<= .cse0 0) (<= .cse32 0))))) is different from false [2018-12-31 05:58:02,103 WARN L181 SmtUtils]: Spent 10.18 s on a formula simplification. DAG size of input: 144 DAG size of output: 20 [2018-12-31 05:58:02,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-12-31 05:58:02,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:58:02,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-12-31 05:58:02,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:58:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:58:02,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:58:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:58:02,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:58:02,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-12-31 05:58:02,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 05:58:02,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 05:58:02,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=87, Unknown=6, NotChecked=38, Total=156 [2018-12-31 05:58:02,832 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 13 states. [2018-12-31 05:58:19,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:58:19,203 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-12-31 05:58:19,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 05:58:19,205 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-31 05:58:19,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:58:19,206 INFO L225 Difference]: With dead ends: 55 [2018-12-31 05:58:19,206 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 05:58:19,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 61.5s TimeCoverageRelationStatistics Valid=29, Invalid=105, Unknown=6, NotChecked=42, Total=182 [2018-12-31 05:58:19,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 05:58:19,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-31 05:58:19,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 05:58:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-31 05:58:19,211 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 16 [2018-12-31 05:58:19,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:58:19,211 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-31 05:58:19,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 05:58:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-31 05:58:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 05:58:19,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:58:19,214 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-31 05:58:19,214 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:58:19,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:58:19,216 INFO L82 PathProgramCache]: Analyzing trace with hash 489860484, now seen corresponding path program 2 times [2018-12-31 05:58:19,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:58:19,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:58:19,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:58:19,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:58:19,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:58:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:58:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:58:19,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:58:19,873 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-12-31 05:58:19,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:58:19,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:58:19,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:58:19,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:58:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:58:20,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:58:20,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-12-31 05:58:20,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-31 05:58:20,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-31 05:58:20,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-12-31 05:58:20,169 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 24 states. [2018-12-31 05:58:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:58:20,751 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-31 05:58:20,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-31 05:58:20,756 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2018-12-31 05:58:20,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:58:20,757 INFO L225 Difference]: With dead ends: 44 [2018-12-31 05:58:20,757 INFO L226 Difference]: Without dead ends: 40 [2018-12-31 05:58:20,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-12-31 05:58:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-31 05:58:20,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-12-31 05:58:20,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-31 05:58:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-31 05:58:20,768 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 27 [2018-12-31 05:58:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:58:20,768 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-31 05:58:20,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-31 05:58:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-31 05:58:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 05:58:20,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:58:20,772 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-12-31 05:58:20,773 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:58:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:58:20,773 INFO L82 PathProgramCache]: Analyzing trace with hash 902325004, now seen corresponding path program 3 times [2018-12-31 05:58:20,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:58:20,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:58:20,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:58:20,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:58:20,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:58:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:58:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:58:21,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:58:21,850 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-12-31 05:58:21,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 05:58:21,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-31 05:58:21,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:58:21,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:58:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:58:22,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:58:22,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-12-31 05:58:22,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-31 05:58:22,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-31 05:58:22,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-12-31 05:58:22,273 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 34 states. [2018-12-31 05:58:23,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:58:23,659 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-31 05:58:23,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-31 05:58:23,661 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 38 [2018-12-31 05:58:23,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:58:23,663 INFO L225 Difference]: With dead ends: 55 [2018-12-31 05:58:23,664 INFO L226 Difference]: Without dead ends: 51 [2018-12-31 05:58:23,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-12-31 05:58:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-31 05:58:23,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-12-31 05:58:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-31 05:58:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-31 05:58:23,670 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 38 [2018-12-31 05:58:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:58:23,671 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-31 05:58:23,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-31 05:58:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-31 05:58:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 05:58:23,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:58:23,674 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2018-12-31 05:58:23,675 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:58:23,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:58:23,675 INFO L82 PathProgramCache]: Analyzing trace with hash 241133700, now seen corresponding path program 4 times [2018-12-31 05:58:23,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:58:23,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:58:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:58:23,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:58:23,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:58:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:58:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:58:24,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:58:24,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:58:24,909 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 05:58:24,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 05:58:24,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:58:24,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:58:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:58:25,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:58:25,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-12-31 05:58:25,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-31 05:58:25,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-31 05:58:25,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-12-31 05:58:25,123 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 44 states. [2018-12-31 05:58:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:58:27,150 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-31 05:58:27,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-31 05:58:27,151 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 49 [2018-12-31 05:58:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:58:27,152 INFO L225 Difference]: With dead ends: 66 [2018-12-31 05:58:27,152 INFO L226 Difference]: Without dead ends: 62 [2018-12-31 05:58:27,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-12-31 05:58:27,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-31 05:58:27,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-12-31 05:58:27,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-31 05:58:27,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-31 05:58:27,160 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 49 [2018-12-31 05:58:27,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:58:27,162 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-31 05:58:27,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-31 05:58:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-31 05:58:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-31 05:58:27,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:58:27,165 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2018-12-31 05:58:27,165 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:58:27,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:58:27,165 INFO L82 PathProgramCache]: Analyzing trace with hash -722941940, now seen corresponding path program 5 times [2018-12-31 05:58:27,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:58:27,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:58:27,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:58:27,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:58:27,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:58:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:58:27,741 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2018-12-31 05:58:29,796 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2018-12-31 05:58:31,852 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:58:33,910 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:58:36,038 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:58:38,113 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:58:40,226 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:58:42,325 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:58:44,453 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:58:46,534 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:58:48,622 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:58:50,709 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:58:52,821 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:58:55,073 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:58:55,268 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:58:59,459 WARN L181 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:01,671 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:03,775 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:05,873 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:07,969 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:10,073 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:12,180 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:14,316 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:18,433 WARN L181 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:20,654 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:22,779 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:24,899 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:27,031 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:29,270 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:31,539 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:33,688 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:35,960 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:38,109 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:40,285 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:42,868 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:45,203 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:47,631 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 05:59:49,794 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-31 06:00:16,376 WARN L181 SmtUtils]: Spent 16.22 s on a formula simplification. DAG size of input: 120 DAG size of output: 27 [2018-12-31 06:00:18,405 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_ULTIMATE.start_main_~x~0 2)) (.cse30 (* 4294967296 (div c_ULTIMATE.start_main_~x~0 4294967296)))) (and (or (< 49 .cse0) (<= 100 c_ULTIMATE.start_main_~x~0)) (let ((.cse9 (* 2 .cse0))) (let ((.cse31 (* (- 2) .cse0)) (.cse5 (<= .cse30 c_ULTIMATE.start_main_~x~0)) (.cse6 (= .cse9 c_ULTIMATE.start_main_~x~0))) (let ((.cse23 (or .cse5 .cse6)) (.cse28 (div (+ c_ULTIMATE.start_main_~x~0 .cse31) 4294967296)) (.cse21 (not .cse6)) (.cse27 (div (+ c_ULTIMATE.start_main_~x~0 .cse31 (- 2)) 4294967296)) (.cse22 (< c_ULTIMATE.start_main_~x~0 .cse30))) (or (let ((.cse29 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse26 (* (- 2) .cse29)) (.cse2 (* 2 .cse29)) (.cse25 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse10 (<= .cse25 c_ULTIMATE.start_main_~y~0)) (.cse11 (= .cse2 c_ULTIMATE.start_main_~y~0)) (.cse24 (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse26) 4294967296))) (.cse14 (* 4294967296 .cse28)) (.cse8 (* 4294967296 .cse27)) (.cse1 (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse26 (- 2)) 4294967296)))) (let ((.cse17 (+ .cse1 .cse2 c_ULTIMATE.start_main_~x~0 2)) (.cse18 (+ .cse8 .cse9 c_ULTIMATE.start_main_~y~0)) (.cse7 (+ .cse1 .cse2 c_ULTIMATE.start_main_~x~0)) (.cse3 (+ .cse9 c_ULTIMATE.start_main_~y~0 .cse14)) (.cse19 (+ .cse8 .cse9 c_ULTIMATE.start_main_~y~0 2)) (.cse13 (+ .cse2 c_ULTIMATE.start_main_~x~0 .cse24)) (.cse15 (not .cse11)) (.cse16 (< c_ULTIMATE.start_main_~y~0 .cse25)) (.cse20 (or .cse10 .cse11))) (and (let ((.cse12 (and .cse15 .cse16)) (.cse4 (and .cse21 .cse22))) (or (and (or (and (or (< (+ .cse1 .cse2 c_ULTIMATE.start_main_~x~0 1) .cse3) .cse4) (or .cse5 .cse6 (< .cse7 (+ .cse8 .cse9 c_ULTIMATE.start_main_~y~0 1)))) .cse10 .cse11) (or .cse12 (and (or .cse5 .cse6 (< .cse13 (+ .cse8 .cse9 c_ULTIMATE.start_main_~y~0 3))) (or .cse4 (< .cse13 (+ .cse9 c_ULTIMATE.start_main_~y~0 .cse14 1)))))) (and (<= .cse7 (+ c_ULTIMATE.start_main_~y~0 98)) .cse15 .cse16) (and (or (and (or (< .cse17 .cse3) .cse4) (or .cse5 .cse6 (< .cse7 .cse18))) .cse10 .cse11) (or .cse12 (and (or (< .cse13 .cse19) .cse5 .cse6) (or .cse4 (< .cse13 .cse3))))) (and (<= .cse13 (+ c_ULTIMATE.start_main_~y~0 100)) .cse20))) (or (and .cse15 .cse16 (or (and (<= .cse3 .cse17) .cse23) (and (<= .cse18 .cse7) .cse21 .cse22))) (and (or (and .cse23 (<= .cse3 .cse13)) (and .cse21 .cse22 (<= .cse19 .cse13))) .cse20) (and .cse15 .cse16 (<= c_ULTIMATE.start_main_~y~0 (+ .cse1 .cse2 2))) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse2 .cse24)) .cse20))))))) (and .cse23 (<= (+ .cse28 1) 0)) (<= .cse0 49) (and .cse21 (<= (+ .cse27 1) 0) .cse22))))) (< .cse30 (+ c_ULTIMATE.start_main_~x~0 1)))) is different from false [2018-12-31 06:00:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:00:18,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:00:18,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-12-31 06:00:18,518 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 06:00:18,580 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-31 06:00:18,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:00:18,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:00:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:00:19,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:00:19,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53] total 58 [2018-12-31 06:00:19,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-31 06:00:19,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-31 06:00:19,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3185, Unknown=6, NotChecked=112, Total=3422 [2018-12-31 06:00:19,376 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 59 states. [2018-12-31 06:00:24,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:00:24,575 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-12-31 06:00:24,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-31 06:00:24,576 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 60 [2018-12-31 06:00:24,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:00:24,576 INFO L225 Difference]: With dead ends: 74 [2018-12-31 06:00:24,577 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 06:00:24,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 113.8s TimeCoverageRelationStatistics Valid=124, Invalid=3296, Unknown=6, NotChecked=114, Total=3540 [2018-12-31 06:00:24,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 06:00:24,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 06:00:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 06:00:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 06:00:24,579 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-12-31 06:00:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:00:24,580 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 06:00:24,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-31 06:00:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 06:00:24,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 06:00:24,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 06:00:24,841 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-12-31 06:00:24,845 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 12 33) the Hoare annotation is: (let ((.cse6 (div ULTIMATE.start_main_~y~0 2))) (let ((.cse4 (* 2 .cse6)) (.cse5 (* 4294967296 (div (+ ULTIMATE.start_main_~y~0 (* (- 2) .cse6)) 4294967296)))) (let ((.cse3 (+ .cse4 .cse5))) (let ((.cse0 (+ .cse4 ULTIMATE.start_main_~x~0 .cse5)) (.cse1 (= .cse3 ULTIMATE.start_main_~y~0))) (or (and (<= .cse0 (+ ULTIMATE.start_main_~y~0 80)) (<= 80 ULTIMATE.start_main_~x~0) .cse1) (and (<= .cse0 (+ ULTIMATE.start_main_~y~0 100)) (<= 100 ULTIMATE.start_main_~x~0) .cse1) (and (<= ULTIMATE.start_main_~x~0 0) (<= 0 ULTIMATE.start_main_~x~0)) (and (<= .cse0 (+ ULTIMATE.start_main_~y~0 20)) (<= 20 ULTIMATE.start_main_~x~0) .cse1) (let ((.cse2 (+ ULTIMATE.start_main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (< .cse3 ULTIMATE.start_main_~y~0))) (and (<= 60 ULTIMATE.start_main_~x~0) (<= .cse0 (+ ULTIMATE.start_main_~y~0 60)) .cse1) (and (<= 40 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 40) .cse1)))))) [2018-12-31 06:00:24,845 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-12-31 06:00:24,845 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-12-31 06:00:24,845 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-12-31 06:00:24,845 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-12-31 06:00:24,845 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 06:00:24,845 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 06:00:24,847 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 33) no Hoare annotation was computed. [2018-12-31 06:00:24,847 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-12-31 06:00:24,847 INFO L451 ceAbstractionStarter]: At program point L4-2(lines 1 35) the Hoare annotation is: true [2018-12-31 06:00:24,847 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 06:00:24,848 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-12-31 06:00:24,848 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-12-31 06:00:24,848 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-12-31 06:00:24,848 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-12-31 06:00:24,848 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-12-31 06:00:24,848 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-12-31 06:00:24,848 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-12-31 06:00:24,849 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-12-31 06:00:24,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 06:00:24 BoogieIcfgContainer [2018-12-31 06:00:24,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 06:00:24,868 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 06:00:24,869 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 06:00:24,869 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 06:00:24,869 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:57:11" (3/4) ... [2018-12-31 06:00:24,873 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 06:00:24,886 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-31 06:00:24,886 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 06:00:24,958 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 06:00:24,962 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 06:00:24,963 INFO L168 Benchmark]: Toolchain (without parser) took 194369.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.2 MB). Free memory was 950.0 MB in the beginning and 1.0 GB in the end (delta: -77.5 MB). Peak memory consumption was 152.7 MB. Max. memory is 11.5 GB. [2018-12-31 06:00:24,969 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 06:00:24,970 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.26 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 06:00:24,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.15 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 06:00:24,970 INFO L168 Benchmark]: Boogie Preprocessor took 29.34 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 06:00:24,971 INFO L168 Benchmark]: RCFGBuilder took 511.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 06:00:24,971 INFO L168 Benchmark]: TraceAbstraction took 193352.94 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 114.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.7 MB). Peak memory consumption was 172.0 MB. Max. memory is 11.5 GB. [2018-12-31 06:00:24,973 INFO L168 Benchmark]: Witness Printer took 93.33 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 06:00:24,977 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.26 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.15 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.34 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 511.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 193352.94 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 114.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.7 MB). Peak memory consumption was 172.0 MB. Max. memory is 11.5 GB. * Witness Printer took 93.33 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 80 && 80 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 100 && 100 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || (x <= 0 && 0 <= x)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 20 && 20 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((0 <= x + 5 && x + 5 <= 0) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) < y)) || ((60 <= x && 2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 60) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((40 <= x && x <= 40) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 193.2s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 27.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 127 SDtfs, 48 SDslu, 154 SDs, 0 SdLazy, 7152 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 195 SyntacticMatches, 20 SemanticMatches, 181 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 181.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=9, 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, 10 MinimizatonAttempts, 14 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 10 NumberOfFragments, 245 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 146 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 164.7s InterpolantComputationTime, 454 NumberOfCodeBlocks, 454 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 438 ConstructedInterpolants, 0 QuantifiedInterpolants, 440828 SizeOfPredicates, 12 NumberOfNonLiveVariables, 730 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 2/474 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...