./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.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 d2a071cc6090a217f48ed180b566a651717a8e39 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 d2a071cc6090a217f48ed180b566a651717a8e39 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 15:57:13,406 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 15:57:13,408 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 15:57:13,420 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 15:57:13,420 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 15:57:13,421 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 15:57:13,422 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 15:57:13,424 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 15:57:13,425 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 15:57:13,426 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 15:57:13,427 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 15:57:13,427 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 15:57:13,428 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 15:57:13,429 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 15:57:13,430 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 15:57:13,431 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 15:57:13,432 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 15:57:13,434 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 15:57:13,435 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 15:57:13,437 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 15:57:13,438 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 15:57:13,439 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 15:57:13,441 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 15:57:13,442 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 15:57:13,442 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 15:57:13,443 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 15:57:13,444 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 15:57:13,445 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 15:57:13,445 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 15:57:13,446 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 15:57:13,447 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 15:57:13,447 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 15:57:13,447 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 15:57:13,448 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 15:57:13,448 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 15:57:13,449 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 15:57:13,449 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 15:57:13,468 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 15:57:13,469 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 15:57:13,470 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 15:57:13,470 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 15:57:13,470 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 15:57:13,470 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 15:57:13,470 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 15:57:13,471 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 15:57:13,471 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 15:57:13,472 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 15:57:13,472 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 15:57:13,472 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 15:57:13,472 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 15:57:13,472 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 15:57:13,472 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 15:57:13,473 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 15:57:13,473 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 15:57:13,473 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 15:57:13,473 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 15:57:13,473 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 15:57:13,473 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 15:57:13,475 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:57:13,475 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 15:57:13,475 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 15:57:13,476 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 15:57:13,476 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 15:57:13,476 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 15:57:13,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 15:57:13,477 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 -> d2a071cc6090a217f48ed180b566a651717a8e39 [2018-12-30 15:57:13,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 15:57:13,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 15:57:13,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 15:57:13,541 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 15:57:13,541 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 15:57:13,542 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-12-30 15:57:13,602 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4fc83cb/6b4c50f96cd14f60a77e786d017a1446/FLAG34198187e [2018-12-30 15:57:14,073 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 15:57:14,073 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-12-30 15:57:14,080 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4fc83cb/6b4c50f96cd14f60a77e786d017a1446/FLAG34198187e [2018-12-30 15:57:14,424 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4fc83cb/6b4c50f96cd14f60a77e786d017a1446 [2018-12-30 15:57:14,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 15:57:14,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 15:57:14,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 15:57:14,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 15:57:14,435 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 15:57:14,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:57:14" (1/1) ... [2018-12-30 15:57:14,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1509bd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:14, skipping insertion in model container [2018-12-30 15:57:14,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:57:14" (1/1) ... [2018-12-30 15:57:14,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 15:57:14,464 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 15:57:14,686 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:57:14,694 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 15:57:14,717 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:57:14,735 INFO L195 MainTranslator]: Completed translation [2018-12-30 15:57:14,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:14 WrapperNode [2018-12-30 15:57:14,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 15:57:14,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 15:57:14,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 15:57:14,738 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 15:57:14,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:14" (1/1) ... [2018-12-30 15:57:14,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:14" (1/1) ... [2018-12-30 15:57:14,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 15:57:14,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 15:57:14,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 15:57:14,778 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 15:57:14,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:14" (1/1) ... [2018-12-30 15:57:14,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:14" (1/1) ... [2018-12-30 15:57:14,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:14" (1/1) ... [2018-12-30 15:57:14,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:14" (1/1) ... [2018-12-30 15:57:14,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:14" (1/1) ... [2018-12-30 15:57:14,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:14" (1/1) ... [2018-12-30 15:57:14,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:14" (1/1) ... [2018-12-30 15:57:14,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 15:57:14,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 15:57:14,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 15:57:14,810 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 15:57:14,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:57:14,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 15:57:14,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 15:57:15,186 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 15:57:15,186 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 15:57:15,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:57:15 BoogieIcfgContainer [2018-12-30 15:57:15,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 15:57:15,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 15:57:15,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 15:57:15,191 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 15:57:15,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 03:57:14" (1/3) ... [2018-12-30 15:57:15,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f50829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:57:15, skipping insertion in model container [2018-12-30 15:57:15,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:14" (2/3) ... [2018-12-30 15:57:15,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f50829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:57:15, skipping insertion in model container [2018-12-30 15:57:15,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:57:15" (3/3) ... [2018-12-30 15:57:15,194 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1_true-unreach-call_true-no-overflow.i [2018-12-30 15:57:15,204 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 15:57:15,211 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 15:57:15,228 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 15:57:15,259 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 15:57:15,259 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 15:57:15,260 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 15:57:15,260 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 15:57:15,260 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 15:57:15,260 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 15:57:15,260 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 15:57:15,260 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 15:57:15,260 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 15:57:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2018-12-30 15:57:15,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-30 15:57:15,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:15,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-30 15:57:15,286 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:15,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:15,292 INFO L82 PathProgramCache]: Analyzing trace with hash 30139652, now seen corresponding path program 1 times [2018-12-30 15:57:15,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:57:15,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:57:15,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:15,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:57:15,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:57:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:15,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:57:15,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 15:57:15,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-30 15:57:15,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-30 15:57:15,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-30 15:57:15,432 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-12-30 15:57:15,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:15,448 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-12-30 15:57:15,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-30 15:57:15,449 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2018-12-30 15:57:15,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:15,458 INFO L225 Difference]: With dead ends: 20 [2018-12-30 15:57:15,458 INFO L226 Difference]: Without dead ends: 8 [2018-12-30 15:57:15,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-30 15:57:15,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-30 15:57:15,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-30 15:57:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-30 15:57:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-30 15:57:15,496 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2018-12-30 15:57:15,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:15,497 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-30 15:57:15,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-30 15:57:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-30 15:57:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-30 15:57:15,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:15,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-30 15:57:15,499 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:15,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:15,499 INFO L82 PathProgramCache]: Analyzing trace with hash 29811951, now seen corresponding path program 1 times [2018-12-30 15:57:15,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:57:15,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:57:15,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:15,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:57:15,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:57:15,735 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2018-12-30 15:57:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:15,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:57:15,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 15:57:15,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:57:15,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:57:15,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:57:15,738 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 3 states. [2018-12-30 15:57:15,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:15,763 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-12-30 15:57:15,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:57:15,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-30 15:57:15,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:15,765 INFO L225 Difference]: With dead ends: 15 [2018-12-30 15:57:15,765 INFO L226 Difference]: Without dead ends: 11 [2018-12-30 15:57:15,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:57:15,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-30 15:57:15,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-12-30 15:57:15,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-30 15:57:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-30 15:57:15,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2018-12-30 15:57:15,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:15,772 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-30 15:57:15,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:57:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-30 15:57:15,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-30 15:57:15,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:15,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:57:15,773 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:15,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:15,776 INFO L82 PathProgramCache]: Analyzing trace with hash 608596189, now seen corresponding path program 1 times [2018-12-30 15:57:15,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:57:15,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:57:15,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:15,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:57:15,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:57:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:15,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:57:15,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:57:15,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:57:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:57:15,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:57:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:16,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:57:16,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-12-30 15:57:16,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 15:57:16,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 15:57:16,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 15:57:16,051 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-12-30 15:57:16,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:16,098 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-12-30 15:57:16,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 15:57:16,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-12-30 15:57:16,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:16,101 INFO L225 Difference]: With dead ends: 18 [2018-12-30 15:57:16,102 INFO L226 Difference]: Without dead ends: 14 [2018-12-30 15:57:16,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 15:57:16,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-30 15:57:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-12-30 15:57:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-30 15:57:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-30 15:57:16,107 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 8 [2018-12-30 15:57:16,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:16,108 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-30 15:57:16,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 15:57:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-30 15:57:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-30 15:57:16,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:16,110 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-12-30 15:57:16,110 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:16,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1123862993, now seen corresponding path program 2 times [2018-12-30 15:57:16,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:57:16,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:57:16,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:16,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:57:16,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:57:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:16,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:57:16,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:57:16,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-30 15:57:16,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-30 15:57:16,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:57:16,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:57:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:16,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:57:16,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-30 15:57:16,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 15:57:16,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 15:57:16,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-30 15:57:16,651 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2018-12-30 15:57:16,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:16,728 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-12-30 15:57:16,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 15:57:16,729 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-30 15:57:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:16,730 INFO L225 Difference]: With dead ends: 21 [2018-12-30 15:57:16,730 INFO L226 Difference]: Without dead ends: 17 [2018-12-30 15:57:16,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-30 15:57:16,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-30 15:57:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-12-30 15:57:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-30 15:57:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-12-30 15:57:16,736 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2018-12-30 15:57:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:16,736 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-12-30 15:57:16,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 15:57:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2018-12-30 15:57:16,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-30 15:57:16,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:16,737 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2018-12-30 15:57:16,737 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:16,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:16,738 INFO L82 PathProgramCache]: Analyzing trace with hash -193357923, now seen corresponding path program 3 times [2018-12-30 15:57:16,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:57:16,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:57:16,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:16,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:57:16,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:57:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:16,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:57:16,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:57:16,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-30 15:57:16,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-30 15:57:16,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:57:16,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:57:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:17,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:57:17,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-30 15:57:17,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 15:57:17,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 15:57:17,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-30 15:57:17,229 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 9 states. [2018-12-30 15:57:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:17,330 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-12-30 15:57:17,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 15:57:17,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-12-30 15:57:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:17,333 INFO L225 Difference]: With dead ends: 24 [2018-12-30 15:57:17,333 INFO L226 Difference]: Without dead ends: 20 [2018-12-30 15:57:17,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-30 15:57:17,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-30 15:57:17,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-12-30 15:57:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-30 15:57:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-12-30 15:57:17,339 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 14 [2018-12-30 15:57:17,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:17,339 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-12-30 15:57:17,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 15:57:17,339 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2018-12-30 15:57:17,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 15:57:17,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:17,340 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2018-12-30 15:57:17,341 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:17,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:17,341 INFO L82 PathProgramCache]: Analyzing trace with hash 764254063, now seen corresponding path program 4 times [2018-12-30 15:57:17,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:57:17,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:57:17,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:17,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:57:17,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:57:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:17,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:57:17,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:57:17,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-30 15:57:17,565 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-30 15:57:17,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:57:17,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:57:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:18,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:57:18,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-12-30 15:57:18,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-30 15:57:18,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-30 15:57:18,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-30 15:57:18,016 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 11 states. [2018-12-30 15:57:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:18,235 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-12-30 15:57:18,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 15:57:18,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-12-30 15:57:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:18,238 INFO L225 Difference]: With dead ends: 27 [2018-12-30 15:57:18,238 INFO L226 Difference]: Without dead ends: 23 [2018-12-30 15:57:18,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-30 15:57:18,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-30 15:57:18,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-12-30 15:57:18,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-30 15:57:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-12-30 15:57:18,245 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 17 [2018-12-30 15:57:18,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:18,245 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-12-30 15:57:18,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-30 15:57:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2018-12-30 15:57:18,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 15:57:18,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:18,251 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1] [2018-12-30 15:57:18,252 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:18,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:18,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1810148957, now seen corresponding path program 5 times [2018-12-30 15:57:18,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:57:18,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:57:18,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:18,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:57:18,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:57:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:18,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:57:18,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:57:18,516 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-30 15:57:18,532 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-30 15:57:18,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:57:18,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:57:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:18,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:57:18,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-30 15:57:18,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-30 15:57:18,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-30 15:57:18,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-12-30 15:57:18,733 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 13 states. [2018-12-30 15:57:18,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:18,890 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-12-30 15:57:18,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 15:57:18,892 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-12-30 15:57:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:18,893 INFO L225 Difference]: With dead ends: 30 [2018-12-30 15:57:18,893 INFO L226 Difference]: Without dead ends: 26 [2018-12-30 15:57:18,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-12-30 15:57:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-30 15:57:18,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-12-30 15:57:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-30 15:57:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-12-30 15:57:18,900 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 20 [2018-12-30 15:57:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:18,901 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-12-30 15:57:18,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-30 15:57:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2018-12-30 15:57:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 15:57:18,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:18,902 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1] [2018-12-30 15:57:18,902 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:18,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:18,902 INFO L82 PathProgramCache]: Analyzing trace with hash 77203631, now seen corresponding path program 6 times [2018-12-30 15:57:18,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:57:18,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:57:18,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:18,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:57:18,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:57:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:19,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:57:19,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:57:19,304 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-30 15:57:19,341 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-12-30 15:57:19,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:57:19,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:57:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:19,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:57:19,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-12-30 15:57:19,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-30 15:57:19,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-30 15:57:19,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-12-30 15:57:19,808 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 15 states. [2018-12-30 15:57:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:20,002 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2018-12-30 15:57:20,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 15:57:20,007 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-12-30 15:57:20,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:20,008 INFO L225 Difference]: With dead ends: 33 [2018-12-30 15:57:20,008 INFO L226 Difference]: Without dead ends: 29 [2018-12-30 15:57:20,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-12-30 15:57:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-30 15:57:20,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-12-30 15:57:20,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-30 15:57:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2018-12-30 15:57:20,015 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 23 [2018-12-30 15:57:20,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:20,015 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-12-30 15:57:20,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-30 15:57:20,015 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2018-12-30 15:57:20,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 15:57:20,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:20,016 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1] [2018-12-30 15:57:20,017 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:20,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:20,017 INFO L82 PathProgramCache]: Analyzing trace with hash -590105315, now seen corresponding path program 7 times [2018-12-30 15:57:20,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:57:20,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:57:20,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:20,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:57:20,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:57:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:20,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:57:20,179 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 [2018-12-30 15:57:20,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:57:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:57:20,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:57:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:20,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:57:20,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-12-30 15:57:20,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-30 15:57:20,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-30 15:57:20,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-12-30 15:57:20,513 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 17 states. [2018-12-30 15:57:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:21,050 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-12-30 15:57:21,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 15:57:21,051 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-12-30 15:57:21,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:21,052 INFO L225 Difference]: With dead ends: 36 [2018-12-30 15:57:21,052 INFO L226 Difference]: Without dead ends: 32 [2018-12-30 15:57:21,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-12-30 15:57:21,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-30 15:57:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-30 15:57:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-30 15:57:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-12-30 15:57:21,060 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 26 [2018-12-30 15:57:21,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:21,060 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-12-30 15:57:21,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-30 15:57:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2018-12-30 15:57:21,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 15:57:21,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:21,061 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1] [2018-12-30 15:57:21,062 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:21,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:21,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1012697583, now seen corresponding path program 8 times [2018-12-30 15:57:21,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:57:21,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:57:21,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:21,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:57:21,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:57:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 15:57:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 15:57:21,183 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-30 15:57:21,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 03:57:21 BoogieIcfgContainer [2018-12-30 15:57:21,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 15:57:21,223 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 15:57:21,223 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 15:57:21,223 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 15:57:21,224 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:57:15" (3/4) ... [2018-12-30 15:57:21,229 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-30 15:57:21,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 15:57:21,230 INFO L168 Benchmark]: Toolchain (without parser) took 6801.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -240.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:57:21,233 INFO L168 Benchmark]: CDTParser took 0.17 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. [2018-12-30 15:57:21,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.59 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 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. [2018-12-30 15:57:21,236 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.05 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. [2018-12-30 15:57:21,237 INFO L168 Benchmark]: Boogie Preprocessor took 31.55 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. [2018-12-30 15:57:21,238 INFO L168 Benchmark]: RCFGBuilder took 377.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -161.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-30 15:57:21,240 INFO L168 Benchmark]: TraceAbstraction took 6034.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -89.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:57:21,241 INFO L168 Benchmark]: Witness Printer took 6.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:57:21,248 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 306.59 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 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 40.05 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 31.55 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 377.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -161.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6034.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -89.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 6.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 22, overapproximation of bitwiseAnd at line 23. Possible FailurePath: [L14] unsigned char x; [L15] unsigned char y; [L16] unsigned char c; [L18] x = 37 [L19] y = 0 [L20] c = 0 [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND FALSE !(c < (unsigned char)8) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. UNSAFE Result, 5.9s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 125 SDtfs, 136 SDslu, 565 SDs, 0 SdLazy, 585 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 82 SyntacticMatches, 12 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 16 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 232 ConstructedInterpolants, 70 QuantifiedInterpolants, 53060 SizeOfPredicates, 7 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 0/392 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2018-12-30 15:57:23,495 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 15:57:23,496 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 15:57:23,508 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 15:57:23,508 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 15:57:23,509 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 15:57:23,511 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 15:57:23,513 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 15:57:23,514 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 15:57:23,515 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 15:57:23,516 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 15:57:23,516 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 15:57:23,517 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 15:57:23,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 15:57:23,520 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 15:57:23,521 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 15:57:23,522 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 15:57:23,524 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 15:57:23,526 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 15:57:23,527 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 15:57:23,529 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 15:57:23,530 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 15:57:23,536 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 15:57:23,536 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 15:57:23,536 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 15:57:23,537 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 15:57:23,540 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 15:57:23,541 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 15:57:23,542 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 15:57:23,545 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 15:57:23,546 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 15:57:23,547 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 15:57:23,547 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 15:57:23,547 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 15:57:23,556 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 15:57:23,557 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 15:57:23,557 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-30 15:57:23,582 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 15:57:23,582 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 15:57:23,584 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 15:57:23,584 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 15:57:23,584 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 15:57:23,584 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 15:57:23,584 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 15:57:23,585 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 15:57:23,586 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 15:57:23,586 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 15:57:23,586 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 15:57:23,586 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 15:57:23,586 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-30 15:57:23,586 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-30 15:57:23,587 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 15:57:23,587 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 15:57:23,587 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 15:57:23,587 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 15:57:23,587 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 15:57:23,588 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 15:57:23,588 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 15:57:23,588 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 15:57:23,588 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:57:23,588 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 15:57:23,588 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 15:57:23,590 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 15:57:23,590 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-30 15:57:23,590 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 15:57:23,590 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-30 15:57:23,590 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-30 15:57:23,591 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 -> d2a071cc6090a217f48ed180b566a651717a8e39 [2018-12-30 15:57:23,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 15:57:23,663 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 15:57:23,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 15:57:23,671 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 15:57:23,672 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 15:57:23,672 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-12-30 15:57:23,738 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0904f79/fb03d24e1e1f4429a3c8195dddc7c335/FLAGa7de3ac5f [2018-12-30 15:57:24,191 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 15:57:24,192 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-12-30 15:57:24,197 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0904f79/fb03d24e1e1f4429a3c8195dddc7c335/FLAGa7de3ac5f [2018-12-30 15:57:24,553 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0904f79/fb03d24e1e1f4429a3c8195dddc7c335 [2018-12-30 15:57:24,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 15:57:24,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 15:57:24,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 15:57:24,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 15:57:24,563 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 15:57:24,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:57:24" (1/1) ... [2018-12-30 15:57:24,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774878b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:24, skipping insertion in model container [2018-12-30 15:57:24,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:57:24" (1/1) ... [2018-12-30 15:57:24,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 15:57:24,594 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 15:57:24,764 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:57:24,772 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 15:57:24,793 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:57:24,815 INFO L195 MainTranslator]: Completed translation [2018-12-30 15:57:24,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:24 WrapperNode [2018-12-30 15:57:24,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 15:57:24,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 15:57:24,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 15:57:24,817 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 15:57:24,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:24" (1/1) ... [2018-12-30 15:57:24,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:24" (1/1) ... [2018-12-30 15:57:24,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 15:57:24,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 15:57:24,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 15:57:24,858 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 15:57:24,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:24" (1/1) ... [2018-12-30 15:57:24,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:24" (1/1) ... [2018-12-30 15:57:24,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:24" (1/1) ... [2018-12-30 15:57:24,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:24" (1/1) ... [2018-12-30 15:57:24,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:24" (1/1) ... [2018-12-30 15:57:24,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:24" (1/1) ... [2018-12-30 15:57:24,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:24" (1/1) ... [2018-12-30 15:57:24,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 15:57:24,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 15:57:24,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 15:57:24,892 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 15:57:24,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:57:25,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 15:57:25,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 15:57:25,191 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 15:57:25,191 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 15:57:25,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:57:25 BoogieIcfgContainer [2018-12-30 15:57:25,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 15:57:25,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 15:57:25,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 15:57:25,196 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 15:57:25,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 03:57:24" (1/3) ... [2018-12-30 15:57:25,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acad5c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:57:25, skipping insertion in model container [2018-12-30 15:57:25,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:57:24" (2/3) ... [2018-12-30 15:57:25,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acad5c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:57:25, skipping insertion in model container [2018-12-30 15:57:25,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:57:25" (3/3) ... [2018-12-30 15:57:25,199 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1_true-unreach-call_true-no-overflow.i [2018-12-30 15:57:25,208 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 15:57:25,215 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 15:57:25,231 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 15:57:25,262 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 15:57:25,263 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 15:57:25,263 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 15:57:25,263 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 15:57:25,263 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 15:57:25,263 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 15:57:25,264 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 15:57:25,264 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 15:57:25,264 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 15:57:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2018-12-30 15:57:25,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-30 15:57:25,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:25,285 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-30 15:57:25,288 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:25,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:25,294 INFO L82 PathProgramCache]: Analyzing trace with hash 30139652, now seen corresponding path program 1 times [2018-12-30 15:57:25,298 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:57:25,299 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:57:25,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:57:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:57:25,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:57:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:25,394 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 15:57:25,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:57:25,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 15:57:25,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-30 15:57:25,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-30 15:57:25,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-30 15:57:25,425 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-12-30 15:57:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:25,444 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-12-30 15:57:25,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-30 15:57:25,446 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2018-12-30 15:57:25,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:25,457 INFO L225 Difference]: With dead ends: 20 [2018-12-30 15:57:25,457 INFO L226 Difference]: Without dead ends: 8 [2018-12-30 15:57:25,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-30 15:57:25,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-30 15:57:25,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-30 15:57:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-30 15:57:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-30 15:57:25,496 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2018-12-30 15:57:25,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:25,497 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-30 15:57:25,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-30 15:57:25,497 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-30 15:57:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-30 15:57:25,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:25,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-30 15:57:25,498 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:25,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:25,499 INFO L82 PathProgramCache]: Analyzing trace with hash 29811951, now seen corresponding path program 1 times [2018-12-30 15:57:25,499 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:57:25,499 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:57:25,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:57:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:57:25,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:57:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:25,578 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 15:57:25,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:57:25,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 15:57:25,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:57:25,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:57:25,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:57:25,583 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 3 states. [2018-12-30 15:57:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:25,638 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-12-30 15:57:25,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:57:25,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-30 15:57:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:25,639 INFO L225 Difference]: With dead ends: 15 [2018-12-30 15:57:25,640 INFO L226 Difference]: Without dead ends: 11 [2018-12-30 15:57:25,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:57:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-30 15:57:25,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-12-30 15:57:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-30 15:57:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-30 15:57:25,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2018-12-30 15:57:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:25,645 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-30 15:57:25,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:57:25,646 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-30 15:57:25,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-30 15:57:25,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:25,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:57:25,646 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:25,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:25,647 INFO L82 PathProgramCache]: Analyzing trace with hash 608596189, now seen corresponding path program 1 times [2018-12-30 15:57:25,647 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:57:25,647 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:57:25,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:57:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:57:25,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:57:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:25,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-30 15:57:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:25,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:57:25,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-12-30 15:57:25,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 15:57:25,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 15:57:25,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:57:25,786 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2018-12-30 15:57:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:25,883 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2018-12-30 15:57:25,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 15:57:25,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-12-30 15:57:25,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:25,886 INFO L225 Difference]: With dead ends: 22 [2018-12-30 15:57:25,887 INFO L226 Difference]: Without dead ends: 18 [2018-12-30 15:57:25,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-30 15:57:25,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-30 15:57:25,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-30 15:57:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-30 15:57:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-12-30 15:57:25,894 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 8 [2018-12-30 15:57:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:25,894 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-12-30 15:57:25,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 15:57:25,895 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2018-12-30 15:57:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 15:57:25,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:25,896 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2018-12-30 15:57:25,896 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:25,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:25,897 INFO L82 PathProgramCache]: Analyzing trace with hash 764254063, now seen corresponding path program 2 times [2018-12-30 15:57:25,897 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:57:25,897 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:57:25,925 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-30 15:57:25,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-30 15:57:25,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:57:25,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:57:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-30 15:57:26,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-30 15:57:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-30 15:57:26,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:57:26,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-30 15:57:26,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 15:57:26,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 15:57:26,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-30 15:57:26,397 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 7 states. [2018-12-30 15:57:26,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:26,815 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-12-30 15:57:26,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 15:57:26,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-30 15:57:26,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:26,818 INFO L225 Difference]: With dead ends: 42 [2018-12-30 15:57:26,818 INFO L226 Difference]: Without dead ends: 30 [2018-12-30 15:57:26,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-30 15:57:26,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-30 15:57:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-30 15:57:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-30 15:57:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-12-30 15:57:26,825 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2018-12-30 15:57:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:26,825 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-30 15:57:26,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 15:57:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-12-30 15:57:26,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 15:57:26,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:26,827 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2018-12-30 15:57:26,828 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:26,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:26,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1079677803, now seen corresponding path program 1 times [2018-12-30 15:57:26,830 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:57:26,830 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:57:26,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:57:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:57:26,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:57:26,984 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:26,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-30 15:57:27,367 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:27,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:57:27,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-12-30 15:57:27,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-30 15:57:27,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-30 15:57:27,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-30 15:57:27,377 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 12 states. [2018-12-30 15:57:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:27,825 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2018-12-30 15:57:27,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 15:57:27,829 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-12-30 15:57:27,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:27,830 INFO L225 Difference]: With dead ends: 34 [2018-12-30 15:57:27,830 INFO L226 Difference]: Without dead ends: 30 [2018-12-30 15:57:27,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-30 15:57:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-30 15:57:27,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-30 15:57:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-30 15:57:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-12-30 15:57:27,838 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2018-12-30 15:57:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:27,838 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-12-30 15:57:27,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-30 15:57:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-12-30 15:57:27,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 15:57:27,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:27,839 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1] [2018-12-30 15:57:27,840 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:27,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:27,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1115460629, now seen corresponding path program 2 times [2018-12-30 15:57:27,841 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:57:27,841 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:57:27,859 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-30 15:57:27,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-30 15:57:27,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:57:27,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:57:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 51 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-30 15:57:28,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-30 15:57:28,274 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 51 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-30 15:57:28,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:57:28,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-30 15:57:28,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-30 15:57:28,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-30 15:57:28,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-12-30 15:57:28,278 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 13 states. [2018-12-30 15:57:29,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:29,111 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2018-12-30 15:57:29,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-30 15:57:29,112 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-12-30 15:57:29,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:29,113 INFO L225 Difference]: With dead ends: 69 [2018-12-30 15:57:29,114 INFO L226 Difference]: Without dead ends: 54 [2018-12-30 15:57:29,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2018-12-30 15:57:29,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-30 15:57:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2018-12-30 15:57:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-30 15:57:29,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-12-30 15:57:29,124 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 29 [2018-12-30 15:57:29,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:29,125 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-12-30 15:57:29,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-30 15:57:29,125 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-12-30 15:57:29,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 15:57:29,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:29,126 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1] [2018-12-30 15:57:29,127 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:29,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:29,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1658007635, now seen corresponding path program 3 times [2018-12-30 15:57:29,127 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:57:29,127 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:57:29,150 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-30 15:57:29,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-30 15:57:29,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:57:29,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:57:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 83 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-30 15:57:29,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-30 15:57:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (8)] Exception during sending of exit command (exit): Broken pipe [2018-12-30 15:57:31,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:57:31,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-12-30 15:57:31,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-30 15:57:31,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-30 15:57:31,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2018-12-30 15:57:31,446 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 32 states. [2018-12-30 15:57:35,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:35,797 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2018-12-30 15:57:35,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-30 15:57:35,798 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 29 [2018-12-30 15:57:35,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:35,802 INFO L225 Difference]: With dead ends: 121 [2018-12-30 15:57:35,803 INFO L226 Difference]: Without dead ends: 117 [2018-12-30 15:57:35,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=439, Invalid=2641, Unknown=0, NotChecked=0, Total=3080 [2018-12-30 15:57:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-30 15:57:35,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 83. [2018-12-30 15:57:35,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-30 15:57:35,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2018-12-30 15:57:35,825 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 29 [2018-12-30 15:57:35,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:35,825 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2018-12-30 15:57:35,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-30 15:57:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2018-12-30 15:57:35,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 15:57:35,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:35,828 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1] [2018-12-30 15:57:35,828 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:35,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:35,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1399842197, now seen corresponding path program 4 times [2018-12-30 15:57:35,829 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:57:35,829 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:57:35,861 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-30 15:57:35,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-30 15:57:35,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:57:35,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:57:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-30 15:57:36,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-30 15:57:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-30 15:57:36,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:57:36,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-12-30 15:57:36,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-30 15:57:36,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-30 15:57:36,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-12-30 15:57:36,290 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 16 states. [2018-12-30 15:57:36,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:36,814 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2018-12-30 15:57:36,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-30 15:57:36,816 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-12-30 15:57:36,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:36,817 INFO L225 Difference]: With dead ends: 100 [2018-12-30 15:57:36,817 INFO L226 Difference]: Without dead ends: 43 [2018-12-30 15:57:36,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-12-30 15:57:36,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-30 15:57:36,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-12-30 15:57:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-30 15:57:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-12-30 15:57:36,825 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 29 [2018-12-30 15:57:36,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:36,826 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-12-30 15:57:36,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-30 15:57:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-12-30 15:57:36,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-30 15:57:36,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:57:36,827 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1] [2018-12-30 15:57:36,828 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:57:36,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:57:36,828 INFO L82 PathProgramCache]: Analyzing trace with hash 14702237, now seen corresponding path program 5 times [2018-12-30 15:57:36,828 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:57:36,828 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:57:36,850 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-12-30 15:57:36,901 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-12-30 15:57:36,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:57:36,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:57:37,947 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:57:37,947 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (10)] Exception during sending of exit command (exit): Broken pipe [2018-12-30 15:57:37,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:57:37,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-30 15:57:37,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-30 15:57:37,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-30 15:57:37,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2018-12-30 15:57:37,957 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 18 states. [2018-12-30 15:57:38,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:57:38,285 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-12-30 15:57:38,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-30 15:57:38,287 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-12-30 15:57:38,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:57:38,287 INFO L225 Difference]: With dead ends: 37 [2018-12-30 15:57:38,287 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 15:57:38,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2018-12-30 15:57:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 15:57:38,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 15:57:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 15:57:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 15:57:38,292 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-12-30 15:57:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:57:38,292 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 15:57:38,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-30 15:57:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 15:57:38,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 15:57:38,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 15:57:39,159 WARN L181 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2018-12-30 15:57:39,162 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 15:57:39,163 INFO L451 ceAbstractionStarter]: At program point L31(lines 12 32) the Hoare annotation is: true [2018-12-30 15:57:39,163 INFO L444 ceAbstractionStarter]: At program point L21-2(lines 21 28) the Hoare annotation is: (let ((.cse2 (not (= (_ bv0 32) ((_ zero_extend 24) ULTIMATE.start_main_~bit~0)))) (.cse14 (= (_ bv5 8) ULTIMATE.start_main_~y~0)) (.cse0 (= (_ bv1 8) ULTIMATE.start_main_~y~0)) (.cse16 ((_ zero_extend 24) ULTIMATE.start_main_~c~0)) (.cse1 (= (_ bv37 8) ULTIMATE.start_main_~x~0)) (.cse11 (= ULTIMATE.start_main_~bit~0 (_ bv0 8)))) (or (and .cse0 .cse1 .cse2 (= (_ bv1 8) ULTIMATE.start_main_~c~0)) (and .cse1 (exists ((v_ULTIMATE.start_main_~c~0_63 (_ BitVec 8))) (let ((.cse7 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_63))) (let ((.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 (_ bv1 32)))))) (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse9 (_ bv1 32)))))) (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 (_ bv1 32)))))) (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 (_ bv1 32)))))) (let ((.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 (_ bv1 32)))))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse8 (_ bv1 32)))))) (let ((.cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 (_ bv1 32)))))) (and (bvslt .cse3 (_ bv8 32)) (bvslt .cse4 (_ bv8 32)) (bvslt .cse5 (_ bv8 32)) (bvslt .cse6 (_ bv8 32)) (bvslt .cse7 (_ bv8 32)) (bvslt .cse8 (_ bv8 32)) (= ((_ extract 7 0) (bvadd .cse4 (_ bv1 32))) ULTIMATE.start_main_~c~0) (bvslt .cse9 (_ bv8 32)) (bvslt .cse10 (_ bv8 32)))))))))))) .cse11 (exists ((v_ULTIMATE.start_main_~c~0_39 (_ BitVec 8))) (let ((.cse12 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_39))) (let ((.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 (_ bv1 32)))) (_ bv1 32)))))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse12))) (_ bv5 32))) ULTIMATE.start_main_~y~0) (= ((_ extract 7 0) (bvadd .cse13 (_ bv1 32))) ULTIMATE.start_main_~c~0) (bvslt .cse13 (_ bv8 32))))))) (and (= (_ bv4 8) ULTIMATE.start_main_~c~0) .cse1 .cse11 .cse14) (and (= (_ bv0 8) ULTIMATE.start_main_~c~0) .cse1 (= (_ bv0 8) ULTIMATE.start_main_~y~0)) (and .cse1 .cse11 (= (_ bv5 8) ULTIMATE.start_main_~c~0) .cse14) (and .cse1 (= (_ bv3 8) ULTIMATE.start_main_~c~0) .cse2 .cse14) (and (exists ((v_ULTIMATE.start_main_~c~0_39 (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_39))) (and (= ULTIMATE.start_main_~c~0 ((_ extract 7 0) (bvadd .cse15 (_ bv1 32)))) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse15))) (_ bv5 32))) ULTIMATE.start_main_~y~0)))) .cse1 (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 (_ bv1 32)))) (_ bv8 32)) (exists ((v_ULTIMATE.start_main_~c~0_63 (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_63))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 (_ bv1 32)))))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse21 (_ bv1 32)))))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 (_ bv1 32)))))) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse17 (_ bv1 32)))))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 (_ bv1 32)))))) (and (bvslt .cse17 (_ bv8 32)) (bvslt .cse18 (_ bv8 32)) (bvslt .cse19 (_ bv8 32)) (bvslt .cse20 (_ bv8 32)) (= ((_ extract 7 0) (bvadd .cse20 (_ bv1 32))) ULTIMATE.start_main_~c~0) (bvslt .cse21 (_ bv8 32)) (bvslt .cse22 (_ bv8 32)))))))))) (= (bvadd ULTIMATE.start_main_~bit~0 (_ bv224 8)) (_ bv0 8))) (and (= (_ bv2 8) ULTIMATE.start_main_~c~0) .cse0 .cse1 .cse11) (and (exists ((v_ULTIMATE.start_main_~c~0_39 (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_39))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse23))) (_ bv5 32))) ULTIMATE.start_main_~y~0) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 (_ bv1 32)))) (_ bv1 32))) ULTIMATE.start_main_~c~0)))) (bvslt .cse16 (_ bv8 32)) .cse1 .cse11 (exists ((v_ULTIMATE.start_main_~c~0_63 (_ BitVec 8))) (let ((.cse27 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_63))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse27 (_ bv1 32)))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 (_ bv1 32)))))) (let ((.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 (_ bv1 32)))))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 (_ bv1 32)))))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 (_ bv1 32)))))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 (_ bv1 32)))))) (and (bvslt .cse24 (_ bv8 32)) (bvslt .cse25 (_ bv8 32)) (bvslt .cse26 (_ bv8 32)) (= ULTIMATE.start_main_~c~0 ((_ extract 7 0) (bvadd .cse25 (_ bv1 32)))) (bvslt .cse27 (_ bv8 32)) (bvslt .cse28 (_ bv8 32)) (bvslt .cse29 (_ bv8 32)) (bvslt .cse30 (_ bv8 32)))))))))))))) [2018-12-30 15:57:39,163 INFO L448 ceAbstractionStarter]: For program point L21-3(lines 21 28) no Hoare annotation was computed. [2018-12-30 15:57:39,164 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-12-30 15:57:39,164 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-12-30 15:57:39,164 INFO L451 ceAbstractionStarter]: At program point L5-2(lines 4 9) the Hoare annotation is: true [2018-12-30 15:57:39,164 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 15:57:39,164 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 15:57:39,164 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-12-30 15:57:39,164 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 26) no Hoare annotation was computed. [2018-12-30 15:57:39,164 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-12-30 15:57:39,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 03:57:39 BoogieIcfgContainer [2018-12-30 15:57:39,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 15:57:39,227 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 15:57:39,227 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 15:57:39,227 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 15:57:39,228 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:57:25" (3/4) ... [2018-12-30 15:57:39,233 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 15:57:39,244 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 15:57:39,244 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 15:57:39,276 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1bv8 == y && 37bv8 == x) && !(0bv32 == ~zero_extendFrom8To32(bit))) && 1bv8 == c) || (((37bv8 == x && (\exists v_ULTIMATE.start_main_~c~0_63 : bv8 :: (((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0_39 : bv8 :: (~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_39))[7:0]), 5bv32)[7:0] == y && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_39), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_39), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)))) || (((4bv8 == c && 37bv8 == x) && bit == 0bv8) && 5bv8 == y)) || ((0bv8 == c && 37bv8 == x) && 0bv8 == y)) || (((37bv8 == x && bit == 0bv8) && 5bv8 == c) && 5bv8 == y)) || (((37bv8 == x && 3bv8 == c) && !(0bv32 == ~zero_extendFrom8To32(bit))) && 5bv8 == y)) || (((((\exists v_ULTIMATE.start_main_~c~0_39 : bv8 :: c == ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_39), 1bv32)[7:0] && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_39))[7:0]), 5bv32)[7:0] == y) && 37bv8 == x) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32)) && (\exists v_ULTIMATE.start_main_~c~0_63 : bv8 :: (((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && ~bvadd64(bit, 224bv8) == 0bv8)) || (((2bv8 == c && 1bv8 == y) && 37bv8 == x) && bit == 0bv8)) || (((((\exists v_ULTIMATE.start_main_~c~0_39 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_39))[7:0]), 5bv32)[7:0] == y && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_39), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && 37bv8 == x) && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0_63 : bv8 :: ((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) [2018-12-30 15:57:39,297 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 15:57:39,297 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 15:57:39,298 INFO L168 Benchmark]: Toolchain (without parser) took 14741.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 266.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -123.0 MB). Peak memory consumption was 143.4 MB. Max. memory is 11.5 GB. [2018-12-30 15:57:39,300 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:57:39,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.41 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-30 15:57:39,302 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.33 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:57:39,302 INFO L168 Benchmark]: Boogie Preprocessor took 33.18 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-30 15:57:39,304 INFO L168 Benchmark]: RCFGBuilder took 300.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-30 15:57:39,305 INFO L168 Benchmark]: TraceAbstraction took 14033.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 128.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.0 MB). Peak memory consumption was 167.5 MB. Max. memory is 11.5 GB. [2018-12-30 15:57:39,306 INFO L168 Benchmark]: Witness Printer took 69.97 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:57:39,312 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.41 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 41.33 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.18 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 300.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14033.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 128.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.0 MB). Peak memory consumption was 167.5 MB. Max. memory is 11.5 GB. * Witness Printer took 69.97 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. 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_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21]: Loop Invariant [2018-12-30 15:57:39,323 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,337 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,337 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,337 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,338 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,338 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,338 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,338 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,339 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,343 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,343 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,343 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,344 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,344 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,344 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,344 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,346 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,346 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,346 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,351 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,355 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,355 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,363 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,363 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,363 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,363 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_39,QUANTIFIED] [2018-12-30 15:57:39,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] [2018-12-30 15:57:39,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_63,QUANTIFIED] Derived loop invariant: ((((((((((1bv8 == y && 37bv8 == x) && !(0bv32 == ~zero_extendFrom8To32(bit))) && 1bv8 == c) || (((37bv8 == x && (\exists v_ULTIMATE.start_main_~c~0_63 : bv8 :: (((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0_39 : bv8 :: (~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_39))[7:0]), 5bv32)[7:0] == y && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_39), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_39), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)))) || (((4bv8 == c && 37bv8 == x) && bit == 0bv8) && 5bv8 == y)) || ((0bv8 == c && 37bv8 == x) && 0bv8 == y)) || (((37bv8 == x && bit == 0bv8) && 5bv8 == c) && 5bv8 == y)) || (((37bv8 == x && 3bv8 == c) && !(0bv32 == ~zero_extendFrom8To32(bit))) && 5bv8 == y)) || (((((\exists v_ULTIMATE.start_main_~c~0_39 : bv8 :: c == ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_39), 1bv32)[7:0] && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_39))[7:0]), 5bv32)[7:0] == y) && 37bv8 == x) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32)) && (\exists v_ULTIMATE.start_main_~c~0_63 : bv8 :: (((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && ~bvadd64(bit, 224bv8) == 0bv8)) || (((2bv8 == c && 1bv8 == y) && 37bv8 == x) && bit == 0bv8)) || (((((\exists v_ULTIMATE.start_main_~c~0_39 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_39))[7:0]), 5bv32)[7:0] == y && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_39), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && 37bv8 == x) && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0_63 : bv8 :: ((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_63), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. SAFE Result, 13.9s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 94 SDtfs, 262 SDslu, 413 SDs, 0 SdLazy, 1090 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred 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, 9 MinimizatonAttempts, 70 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 14 NumberOfFragments, 640 HoareAnnotationTreeSize, 3 FomulaSimplifications, 202 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 569 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 171 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 285 ConstructedInterpolants, 46 QuantifiedInterpolants, 127343 SizeOfPredicates, 26 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 409/759 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...