./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-acceleration/underapprox_true-unreach-call1_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/underapprox_true-unreach-call1_true-termination.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 6a0edfd90480f917557019c272eaa2ec2221428a .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 17:24:01,199 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 17:24:01,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 17:24:01,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 17:24:01,214 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 17:24:01,215 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 17:24:01,216 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 17:24:01,218 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 17:24:01,220 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 17:24:01,221 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 17:24:01,222 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 17:24:01,222 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 17:24:01,223 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 17:24:01,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 17:24:01,226 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 17:24:01,227 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 17:24:01,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 17:24:01,230 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 17:24:01,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 17:24:01,234 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 17:24:01,235 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 17:24:01,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 17:24:01,240 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 17:24:01,240 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 17:24:01,240 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 17:24:01,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 17:24:01,243 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 17:24:01,244 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 17:24:01,244 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 17:24:01,246 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 17:24:01,246 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 17:24:01,248 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 17:24:01,248 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 17:24:01,248 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 17:24:01,249 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 17:24:01,250 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 17:24:01,251 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 17:24:01,266 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 17:24:01,266 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 17:24:01,268 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 17:24:01,268 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 17:24:01,268 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 17:24:01,268 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 17:24:01,268 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 17:24:01,268 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 17:24:01,269 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 17:24:01,269 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 17:24:01,270 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 17:24:01,270 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 17:24:01,270 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 17:24:01,270 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 17:24:01,270 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 17:24:01,270 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 17:24:01,271 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 17:24:01,271 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 17:24:01,271 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 17:24:01,271 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 17:24:01,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 17:24:01,272 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 17:24:01,273 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 17:24:01,273 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 17:24:01,274 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 17:24:01,274 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 17:24:01,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 17:24:01,274 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 -> 6a0edfd90480f917557019c272eaa2ec2221428a [2019-01-14 17:24:01,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 17:24:01,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 17:24:01,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 17:24:01,330 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 17:24:01,330 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 17:24:01,331 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-acceleration/underapprox_true-unreach-call1_true-termination.i [2019-01-14 17:24:01,398 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388ebf78e/b44b54580b4940c18bcecf7e6e93ea01/FLAGc5d07dd43 [2019-01-14 17:24:01,850 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 17:24:01,850 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-acceleration/underapprox_true-unreach-call1_true-termination.i [2019-01-14 17:24:01,856 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388ebf78e/b44b54580b4940c18bcecf7e6e93ea01/FLAGc5d07dd43 [2019-01-14 17:24:02,227 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388ebf78e/b44b54580b4940c18bcecf7e6e93ea01 [2019-01-14 17:24:02,231 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 17:24:02,232 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 17:24:02,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 17:24:02,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 17:24:02,237 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 17:24:02,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:24:02" (1/1) ... [2019-01-14 17:24:02,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@389c3b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:24:02, skipping insertion in model container [2019-01-14 17:24:02,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:24:02" (1/1) ... [2019-01-14 17:24:02,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 17:24:02,271 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 17:24:02,479 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:24:02,486 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 17:24:02,505 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:24:02,527 INFO L195 MainTranslator]: Completed translation [2019-01-14 17:24:02,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:24:02 WrapperNode [2019-01-14 17:24:02,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 17:24:02,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 17:24:02,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 17:24:02,531 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 17:24:02,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:24:02" (1/1) ... [2019-01-14 17:24:02,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:24:02" (1/1) ... [2019-01-14 17:24:02,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 17:24:02,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 17:24:02,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 17:24:02,578 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 17:24:02,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:24:02" (1/1) ... [2019-01-14 17:24:02,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:24:02" (1/1) ... [2019-01-14 17:24:02,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:24:02" (1/1) ... [2019-01-14 17:24:02,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:24:02" (1/1) ... [2019-01-14 17:24:02,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:24:02" (1/1) ... [2019-01-14 17:24:02,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:24:02" (1/1) ... [2019-01-14 17:24:02,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:24:02" (1/1) ... [2019-01-14 17:24:02,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 17:24:02,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 17:24:02,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 17:24:02,623 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 17:24:02,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:24:02" (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 [2019-01-14 17:24:02,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 17:24:02,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 17:24:02,989 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 17:24:02,989 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 17:24:02,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:24:02 BoogieIcfgContainer [2019-01-14 17:24:02,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 17:24:02,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 17:24:02,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 17:24:02,995 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 17:24:02,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 05:24:02" (1/3) ... [2019-01-14 17:24:02,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259ba75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:24:02, skipping insertion in model container [2019-01-14 17:24:02,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:24:02" (2/3) ... [2019-01-14 17:24:02,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259ba75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:24:02, skipping insertion in model container [2019-01-14 17:24:02,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:24:02" (3/3) ... [2019-01-14 17:24:02,998 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_true-unreach-call1_true-termination.i [2019-01-14 17:24:03,008 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 17:24:03,016 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 17:24:03,032 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 17:24:03,065 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 17:24:03,065 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 17:24:03,065 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 17:24:03,066 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 17:24:03,066 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 17:24:03,066 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 17:24:03,066 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 17:24:03,066 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 17:24:03,066 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 17:24:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-14 17:24:03,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 17:24:03,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:24:03,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 17:24:03,089 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:24:03,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:24:03,095 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2019-01-14 17:24:03,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:24:03,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:24:03,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:24:03,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:24:03,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:24:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:24:03,444 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2019-01-14 17:24:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:24:03,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:24:03,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 17:24:03,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 17:24:03,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 17:24:03,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:24:03,465 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-14 17:24:03,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:24:03,496 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-14 17:24:03,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 17:24:03,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-14 17:24:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:24:03,509 INFO L225 Difference]: With dead ends: 17 [2019-01-14 17:24:03,510 INFO L226 Difference]: Without dead ends: 7 [2019-01-14 17:24:03,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:24:03,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-14 17:24:03,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-14 17:24:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 17:24:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-14 17:24:03,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-14 17:24:03,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:24:03,543 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-14 17:24:03,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 17:24:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-14 17:24:03,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 17:24:03,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:24:03,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 17:24:03,544 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:24:03,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:24:03,545 INFO L82 PathProgramCache]: Analyzing trace with hash 925620370, now seen corresponding path program 1 times [2019-01-14 17:24:03,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:24:03,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:24:03,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:24:03,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:24:03,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:24:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:24:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:24:03,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:24:03,686 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 [2019-01-14 17:24:03,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:24:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:24:03,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:24:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:24:03,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:24:03,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-01-14 17:24:03,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:24:03,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:24:03,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:24:03,836 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-01-14 17:24:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:24:03,882 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-14 17:24:03,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:24:03,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-14 17:24:03,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:24:03,883 INFO L225 Difference]: With dead ends: 12 [2019-01-14 17:24:03,884 INFO L226 Difference]: Without dead ends: 8 [2019-01-14 17:24:03,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:24:03,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-14 17:24:03,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-14 17:24:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 17:24:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-14 17:24:03,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-14 17:24:03,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:24:03,889 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-14 17:24:03,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:24:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-14 17:24:03,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 17:24:03,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:24:03,890 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-14 17:24:03,890 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:24:03,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:24:03,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1368874232, now seen corresponding path program 2 times [2019-01-14 17:24:03,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:24:03,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:24:03,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:24:03,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:24:03,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:24:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:24:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:24:04,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:24:04,109 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 [2019-01-14 17:24:04,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 17:24:04,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 17:24:04,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:24:04,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:24:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:24:04,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:24:04,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 17:24:04,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:24:04,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:24:04,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:24:04,367 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-01-14 17:24:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:24:04,430 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-14 17:24:04,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 17:24:04,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-01-14 17:24:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:24:04,431 INFO L225 Difference]: With dead ends: 13 [2019-01-14 17:24:04,431 INFO L226 Difference]: Without dead ends: 9 [2019-01-14 17:24:04,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:24:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-14 17:24:04,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-14 17:24:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 17:24:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-14 17:24:04,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-14 17:24:04,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:24:04,436 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-14 17:24:04,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:24:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-14 17:24:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 17:24:04,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:24:04,440 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-01-14 17:24:04,440 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:24:04,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:24:04,442 INFO L82 PathProgramCache]: Analyzing trace with hash 516237138, now seen corresponding path program 3 times [2019-01-14 17:24:04,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:24:04,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:24:04,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:24:04,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:24:04,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:24:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:24:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:24:04,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:24:04,612 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 [2019-01-14 17:24:04,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 17:24:04,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 17:24:04,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:24:04,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:24:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:24:04,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:24:04,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 17:24:04,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 17:24:04,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 17:24:04,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:24:04,724 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-01-14 17:24:04,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:24:04,873 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-14 17:24:04,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:24:04,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-14 17:24:04,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:24:04,876 INFO L225 Difference]: With dead ends: 14 [2019-01-14 17:24:04,877 INFO L226 Difference]: Without dead ends: 10 [2019-01-14 17:24:04,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:24:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-14 17:24:04,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 17:24:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 17:24:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-14 17:24:04,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-14 17:24:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:24:04,881 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-14 17:24:04,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 17:24:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-14 17:24:04,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 17:24:04,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:24:04,882 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-01-14 17:24:04,882 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:24:04,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:24:04,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1174852536, now seen corresponding path program 4 times [2019-01-14 17:24:04,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:24:04,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:24:04,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:24:04,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:24:04,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:24:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:24:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:24:05,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:24:05,073 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 [2019-01-14 17:24:05,085 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 17:24:05,096 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 17:24:05,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:24:05,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:24:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:24:05,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:24:05,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 17:24:05,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 17:24:05,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 17:24:05,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:24:05,147 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-01-14 17:24:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:24:05,221 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-14 17:24:05,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 17:24:05,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-14 17:24:05,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:24:05,223 INFO L225 Difference]: With dead ends: 15 [2019-01-14 17:24:05,223 INFO L226 Difference]: Without dead ends: 11 [2019-01-14 17:24:05,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:24:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-14 17:24:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-14 17:24:05,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 17:24:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-14 17:24:05,227 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-14 17:24:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:24:05,228 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-14 17:24:05,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 17:24:05,228 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-14 17:24:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 17:24:05,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:24:05,229 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-01-14 17:24:05,229 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:24:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:24:05,230 INFO L82 PathProgramCache]: Analyzing trace with hash -2059024878, now seen corresponding path program 5 times [2019-01-14 17:24:05,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:24:05,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:24:05,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:24:05,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:24:05,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:24:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:24:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:24:05,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:24:05,872 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 [2019-01-14 17:24:05,883 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 17:24:05,896 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-01-14 17:24:05,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:24:05,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:24:05,929 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:24:05,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:24:05,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 17:24:05,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 17:24:05,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 17:24:05,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 17:24:05,950 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2019-01-14 17:24:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:24:06,003 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-14 17:24:06,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 17:24:06,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-01-14 17:24:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:24:06,005 INFO L225 Difference]: With dead ends: 16 [2019-01-14 17:24:06,005 INFO L226 Difference]: Without dead ends: 12 [2019-01-14 17:24:06,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 17:24:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-14 17:24:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-14 17:24:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 17:24:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-14 17:24:06,009 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-14 17:24:06,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:24:06,010 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-14 17:24:06,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 17:24:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-14 17:24:06,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 17:24:06,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:24:06,011 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-01-14 17:24:06,011 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:24:06,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:24:06,011 INFO L82 PathProgramCache]: Analyzing trace with hash 596403592, now seen corresponding path program 6 times [2019-01-14 17:24:06,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:24:06,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:24:06,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:24:06,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:24:06,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:24:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:24:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:24:22,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:24:22,507 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 [2019-01-14 17:24:22,518 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 17:24:22,568 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-01-14 17:24:22,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:24:22,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:24:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:24:23,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:24:23,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-01-14 17:24:23,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 17:24:23,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 17:24:23,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=220, Unknown=7, NotChecked=0, Total=272 [2019-01-14 17:24:23,369 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 17 states. [2019-01-14 17:24:23,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:24:23,638 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-01-14 17:24:23,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 17:24:23,640 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 11 [2019-01-14 17:24:23,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:24:23,641 INFO L225 Difference]: With dead ends: 20 [2019-01-14 17:24:23,642 INFO L226 Difference]: Without dead ends: 14 [2019-01-14 17:24:23,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=56, Invalid=279, Unknown=7, NotChecked=0, Total=342 [2019-01-14 17:24:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-14 17:24:23,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-14 17:24:23,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 17:24:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-14 17:24:23,647 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-01-14 17:24:23,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:24:23,647 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-14 17:24:23,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 17:24:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-14 17:24:23,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 17:24:23,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:24:23,648 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2019-01-14 17:24:23,648 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:24:23,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:24:23,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1966493384, now seen corresponding path program 7 times [2019-01-14 17:24:23,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:24:23,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:24:23,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:24:23,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:24:23,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:24:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:24:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 17:24:23,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:24:23,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:24:23,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:24:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:24:23,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:24:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 17:24:24,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:24:24,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-14 17:24:24,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 17:24:24,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 17:24:24,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-14 17:24:24,096 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 10 states. [2019-01-14 17:24:24,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:24:24,139 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-14 17:24:24,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 17:24:24,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-01-14 17:24:24,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:24:24,140 INFO L225 Difference]: With dead ends: 14 [2019-01-14 17:24:24,140 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 17:24:24,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-14 17:24:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 17:24:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 17:24:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 17:24:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 17:24:24,142 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-01-14 17:24:24,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:24:24,142 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 17:24:24,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 17:24:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 17:24:24,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 17:24:24,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 17:24:24,284 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-01-14 17:24:24,289 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 17:24:24,290 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 11 14) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~x~0 3) (exists ((v_ULTIMATE.start_main_~y~0_7 Int)) (and (= (* 8 v_ULTIMATE.start_main_~y~0_7) ULTIMATE.start_main_~y~0) (<= v_ULTIMATE.start_main_~y~0_7 1) (<= 1 v_ULTIMATE.start_main_~y~0_7))) (<= 3 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~x~0 0) (<= 1 ULTIMATE.start_main_~y~0) (<= 0 ULTIMATE.start_main_~x~0)) (and (<= 1 ULTIMATE.start_main_~x~0) (exists ((v_ULTIMATE.start_main_~y~0_7 Int)) (and (= ULTIMATE.start_main_~y~0 (* 2 v_ULTIMATE.start_main_~y~0_7)) (<= v_ULTIMATE.start_main_~y~0_7 1) (<= 1 v_ULTIMATE.start_main_~y~0_7))) (<= ULTIMATE.start_main_~x~0 1)) (and (exists ((v_ULTIMATE.start_main_~y~0_7 Int)) (and (= ULTIMATE.start_main_~y~0 (* 16 v_ULTIMATE.start_main_~y~0_7)) (<= v_ULTIMATE.start_main_~y~0_7 1) (<= 1 v_ULTIMATE.start_main_~y~0_7))) (<= ULTIMATE.start_main_~x~0 4) (<= 4 ULTIMATE.start_main_~x~0)) (and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6) (exists ((v_ULTIMATE.start_main_~y~0_7 Int)) (and (= ULTIMATE.start_main_~y~0 (* 64 v_ULTIMATE.start_main_~y~0_7)) (<= v_ULTIMATE.start_main_~y~0_7 1) (<= 1 v_ULTIMATE.start_main_~y~0_7)))) (and (<= ULTIMATE.start_main_~x~0 2) (<= 2 ULTIMATE.start_main_~x~0) (exists ((v_ULTIMATE.start_main_~y~0_7 Int)) (and (<= v_ULTIMATE.start_main_~y~0_7 1) (= ULTIMATE.start_main_~y~0 (* 4 v_ULTIMATE.start_main_~y~0_7)) (<= 1 v_ULTIMATE.start_main_~y~0_7)))) (and (exists ((v_ULTIMATE.start_main_~y~0_7 Int)) (and (= ULTIMATE.start_main_~y~0 (* 32 v_ULTIMATE.start_main_~y~0_7)) (<= v_ULTIMATE.start_main_~y~0_7 1) (<= 1 v_ULTIMATE.start_main_~y~0_7))) (<= 5 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 5))) [2019-01-14 17:24:24,290 INFO L448 ceAbstractionStarter]: For program point L11-3(lines 11 14) no Hoare annotation was computed. [2019-01-14 17:24:24,290 INFO L448 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2019-01-14 17:24:24,290 INFO L451 ceAbstractionStarter]: At program point L3-2(lines 1 16) the Hoare annotation is: true [2019-01-14 17:24:24,290 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 17:24:24,290 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 17:24:24,291 INFO L448 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2019-01-14 17:24:24,291 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2019-01-14 17:24:24,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,310 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,310 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,310 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,310 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,311 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,311 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,311 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,311 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,311 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,313 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,313 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,313 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 05:24:24 BoogieIcfgContainer [2019-01-14 17:24:24,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 17:24:24,317 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 17:24:24,317 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 17:24:24,317 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 17:24:24,318 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:24:02" (3/4) ... [2019-01-14 17:24:24,322 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 17:24:24,334 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-14 17:24:24,334 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 17:24:24,360 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((x <= 3 && (\exists v_ULTIMATE.start_main_~y~0_7 : int :: (8 * v_ULTIMATE.start_main_~y~0_7 == y && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7)) && 3 <= x) || (((y <= 1 && x <= 0) && 1 <= y) && 0 <= x)) || ((1 <= x && (\exists v_ULTIMATE.start_main_~y~0_7 : int :: (y == 2 * v_ULTIMATE.start_main_~y~0_7 && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7)) && x <= 1)) || (((\exists v_ULTIMATE.start_main_~y~0_7 : int :: (y == 16 * v_ULTIMATE.start_main_~y~0_7 && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7) && x <= 4) && 4 <= x)) || ((6 <= x && x <= 6) && (\exists v_ULTIMATE.start_main_~y~0_7 : int :: (y == 64 * v_ULTIMATE.start_main_~y~0_7 && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7))) || ((x <= 2 && 2 <= x) && (\exists v_ULTIMATE.start_main_~y~0_7 : int :: (v_ULTIMATE.start_main_~y~0_7 <= 1 && y == 4 * v_ULTIMATE.start_main_~y~0_7) && 1 <= v_ULTIMATE.start_main_~y~0_7))) || (((\exists v_ULTIMATE.start_main_~y~0_7 : int :: (y == 32 * v_ULTIMATE.start_main_~y~0_7 && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7) && 5 <= x) && x <= 5) [2019-01-14 17:24:24,375 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 17:24:24,375 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 17:24:24,376 INFO L168 Benchmark]: Toolchain (without parser) took 22144.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 944.6 MB in the beginning and 856.0 MB in the end (delta: 88.7 MB). Peak memory consumption was 229.2 MB. Max. memory is 11.5 GB. [2019-01-14 17:24:24,378 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:24:24,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.08 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 933.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 17:24:24,379 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.34 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:24:24,380 INFO L168 Benchmark]: Boogie Preprocessor took 42.31 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:24:24,381 INFO L168 Benchmark]: RCFGBuilder took 368.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-14 17:24:24,382 INFO L168 Benchmark]: TraceAbstraction took 21325.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 856.0 MB in the end (delta: 260.7 MB). Peak memory consumption was 260.7 MB. Max. memory is 11.5 GB. [2019-01-14 17:24:24,383 INFO L168 Benchmark]: Witness Printer took 58.26 ms. Allocated memory is still 1.2 GB. Free memory is still 856.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:24:24,388 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.08 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 933.9 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 47.34 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.31 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 368.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21325.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 856.0 MB in the end (delta: 260.7 MB). Peak memory consumption was 260.7 MB. Max. memory is 11.5 GB. * Witness Printer took 58.26 ms. Allocated memory is still 1.2 GB. Free memory is still 856.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 11]: Loop Invariant [2019-01-14 17:24:24,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-14 17:24:24,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] Derived loop invariant: (((((((x <= 3 && (\exists v_ULTIMATE.start_main_~y~0_7 : int :: (8 * v_ULTIMATE.start_main_~y~0_7 == y && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7)) && 3 <= x) || (((y <= 1 && x <= 0) && 1 <= y) && 0 <= x)) || ((1 <= x && (\exists v_ULTIMATE.start_main_~y~0_7 : int :: (y == 2 * v_ULTIMATE.start_main_~y~0_7 && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7)) && x <= 1)) || (((\exists v_ULTIMATE.start_main_~y~0_7 : int :: (y == 16 * v_ULTIMATE.start_main_~y~0_7 && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7) && x <= 4) && 4 <= x)) || ((6 <= x && x <= 6) && (\exists v_ULTIMATE.start_main_~y~0_7 : int :: (y == 64 * v_ULTIMATE.start_main_~y~0_7 && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7))) || ((x <= 2 && 2 <= x) && (\exists v_ULTIMATE.start_main_~y~0_7 : int :: (v_ULTIMATE.start_main_~y~0_7 <= 1 && y == 4 * v_ULTIMATE.start_main_~y~0_7) && 1 <= v_ULTIMATE.start_main_~y~0_7))) || (((\exists v_ULTIMATE.start_main_~y~0_7 : int :: (y == 32 * v_ULTIMATE.start_main_~y~0_7 && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7) && 5 <= x) && x <= 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. SAFE Result, 21.2s OverallTime, 8 OverallIterations, 8 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 2 SDslu, 99 SDs, 0 SdLazy, 267 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 19.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=7, 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 10 NumberOfFragments, 135 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 19.5s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 118 ConstructedInterpolants, 8 QuantifiedInterpolants, 7010 SizeOfPredicates, 8 NumberOfNonLiveVariables, 243 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 30/184 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...