./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c -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 45b185c6c694406b0734db5727dff1b8fd93ebcf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 16:08:12,108 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:08:12,111 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:08:12,123 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:08:12,124 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:08:12,125 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:08:12,127 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:08:12,129 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:08:12,131 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:08:12,132 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:08:12,133 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:08:12,133 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:08:12,135 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:08:12,136 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:08:12,137 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:08:12,138 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:08:12,139 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:08:12,141 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:08:12,143 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:08:12,145 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:08:12,146 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:08:12,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:08:12,150 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:08:12,151 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:08:12,151 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:08:12,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:08:12,154 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:08:12,154 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:08:12,156 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:08:12,157 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:08:12,157 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:08:12,158 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:08:12,159 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:08:12,159 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:08:12,160 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:08:12,161 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:08:12,161 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 16:08:12,178 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:08:12,178 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:08:12,179 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:08:12,179 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:08:12,181 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:08:12,181 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:08:12,181 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:08:12,181 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:08:12,181 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:08:12,182 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 16:08:12,182 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:08:12,182 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:08:12,182 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:08:12,182 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:08:12,184 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:08:12,184 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:08:12,184 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:08:12,184 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:08:12,184 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:08:12,185 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:08:12,185 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:08:12,185 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:08:12,185 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:08:12,185 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:08:12,186 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:08:12,187 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:08:12,187 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:08:12,187 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 16:08:12,187 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:08:12,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 16:08:12,188 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 -> 45b185c6c694406b0734db5727dff1b8fd93ebcf [2018-11-28 16:08:12,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:08:12,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:08:12,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:08:12,280 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:08:12,281 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:08:12,282 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-28 16:08:12,348 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/471d40d5e/99e99b59cfab48bfb91fd62d558b0d5c/FLAG14be291f8 [2018-11-28 16:08:12,788 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:08:12,788 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-28 16:08:12,798 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/471d40d5e/99e99b59cfab48bfb91fd62d558b0d5c/FLAG14be291f8 [2018-11-28 16:08:13,151 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/471d40d5e/99e99b59cfab48bfb91fd62d558b0d5c [2018-11-28 16:08:13,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:08:13,157 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:08:13,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:08:13,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:08:13,163 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:08:13,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:08:13" (1/1) ... [2018-11-28 16:08:13,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bce2f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:13, skipping insertion in model container [2018-11-28 16:08:13,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:08:13" (1/1) ... [2018-11-28 16:08:13,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:08:13,218 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:08:13,538 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:08:13,547 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:08:13,612 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:08:13,629 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:08:13,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:13 WrapperNode [2018-11-28 16:08:13,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:08:13,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:08:13,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:08:13,631 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:08:13,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:13" (1/1) ... [2018-11-28 16:08:13,650 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:13" (1/1) ... [2018-11-28 16:08:13,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:08:13,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:08:13,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:08:13,659 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:08:13,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:13" (1/1) ... [2018-11-28 16:08:13,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:13" (1/1) ... [2018-11-28 16:08:13,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:13" (1/1) ... [2018-11-28 16:08:13,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:13" (1/1) ... [2018-11-28 16:08:13,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:13" (1/1) ... [2018-11-28 16:08:13,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:13" (1/1) ... [2018-11-28 16:08:13,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:13" (1/1) ... [2018-11-28 16:08:13,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:08:13,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:08:13,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:08:13,778 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:08:13,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:13" (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-11-28 16:08:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:08:13,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:08:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2018-11-28 16:08:13,843 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2018-11-28 16:08:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-11-28 16:08:13,844 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-11-28 16:08:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:08:13,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:08:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:08:13,844 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:08:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 16:08:13,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 16:08:14,437 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:08:14,438 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 16:08:14,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:08:14 BoogieIcfgContainer [2018-11-28 16:08:14,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:08:14,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:08:14,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:08:14,443 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:08:14,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:08:13" (1/3) ... [2018-11-28 16:08:14,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1810f834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:08:14, skipping insertion in model container [2018-11-28 16:08:14,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:13" (2/3) ... [2018-11-28 16:08:14,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1810f834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:08:14, skipping insertion in model container [2018-11-28 16:08:14,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:08:14" (3/3) ... [2018-11-28 16:08:14,446 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-28 16:08:14,457 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:08:14,465 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:08:14,480 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:08:14,513 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:08:14,514 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:08:14,514 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:08:14,515 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:08:14,515 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:08:14,515 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:08:14,515 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:08:14,515 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:08:14,515 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:08:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-28 16:08:14,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 16:08:14,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:14,547 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:14,549 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:14,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:14,554 INFO L82 PathProgramCache]: Analyzing trace with hash -848954410, now seen corresponding path program 1 times [2018-11-28 16:08:14,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:14,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:14,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:14,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:14,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 16:08:14,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:08:14,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:08:14,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:08:14,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:08:14,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:08:14,848 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-11-28 16:08:14,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:14,941 INFO L93 Difference]: Finished difference Result 118 states and 174 transitions. [2018-11-28 16:08:14,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:08:14,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-28 16:08:14,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:14,957 INFO L225 Difference]: With dead ends: 118 [2018-11-28 16:08:14,957 INFO L226 Difference]: Without dead ends: 52 [2018-11-28 16:08:14,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:08:14,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-28 16:08:15,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-28 16:08:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 16:08:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2018-11-28 16:08:15,017 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 48 [2018-11-28 16:08:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:15,019 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2018-11-28 16:08:15,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:08:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2018-11-28 16:08:15,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 16:08:15,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:15,031 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:15,031 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:15,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash -796554308, now seen corresponding path program 1 times [2018-11-28 16:08:15,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:15,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:15,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:15,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:15,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 16:08:15,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:08:15,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 16:08:15,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 16:08:15,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 16:08:15,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 16:08:15,158 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand 4 states. [2018-11-28 16:08:15,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:15,276 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2018-11-28 16:08:15,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 16:08:15,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-28 16:08:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:15,279 INFO L225 Difference]: With dead ends: 64 [2018-11-28 16:08:15,279 INFO L226 Difference]: Without dead ends: 52 [2018-11-28 16:08:15,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:08:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-28 16:08:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-28 16:08:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 16:08:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2018-11-28 16:08:15,292 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 50 [2018-11-28 16:08:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:15,292 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2018-11-28 16:08:15,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 16:08:15,294 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2018-11-28 16:08:15,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 16:08:15,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:15,298 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:15,298 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:15,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:15,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1817622662, now seen corresponding path program 1 times [2018-11-28 16:08:15,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:15,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:15,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:15,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:15,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:15,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:15,468 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-11-28 16:08:15,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:15,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:15,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:15,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2018-11-28 16:08:15,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 16:08:15,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 16:08:15,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 16:08:15,780 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand 9 states. [2018-11-28 16:08:16,115 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 16:08:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:17,015 INFO L93 Difference]: Finished difference Result 147 states and 207 transitions. [2018-11-28 16:08:17,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 16:08:17,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-28 16:08:17,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:17,022 INFO L225 Difference]: With dead ends: 147 [2018-11-28 16:08:17,023 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 16:08:17,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-28 16:08:17,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 16:08:17,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-11-28 16:08:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 16:08:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2018-11-28 16:08:17,048 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 112 transitions. Word has length 50 [2018-11-28 16:08:17,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:17,049 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 112 transitions. [2018-11-28 16:08:17,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 16:08:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2018-11-28 16:08:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 16:08:17,057 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:17,057 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:17,057 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:17,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:17,058 INFO L82 PathProgramCache]: Analyzing trace with hash -30301019, now seen corresponding path program 1 times [2018-11-28 16:08:17,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:17,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:17,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:17,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:17,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:17,176 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:17,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:17,176 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-11-28 16:08:17,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:17,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 16:08:17,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:08:17,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-28 16:08:17,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 16:08:17,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 16:08:17,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 16:08:17,304 INFO L87 Difference]: Start difference. First operand 82 states and 112 transitions. Second operand 4 states. [2018-11-28 16:08:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:17,448 INFO L93 Difference]: Finished difference Result 161 states and 225 transitions. [2018-11-28 16:08:17,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 16:08:17,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-28 16:08:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:17,451 INFO L225 Difference]: With dead ends: 161 [2018-11-28 16:08:17,451 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 16:08:17,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:08:17,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 16:08:17,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2018-11-28 16:08:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-28 16:08:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2018-11-28 16:08:17,471 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 55 [2018-11-28 16:08:17,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:17,472 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2018-11-28 16:08:17,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 16:08:17,472 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2018-11-28 16:08:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 16:08:17,474 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:17,475 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:17,475 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:17,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:17,475 INFO L82 PathProgramCache]: Analyzing trace with hash 410874573, now seen corresponding path program 1 times [2018-11-28 16:08:17,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:17,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:17,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:17,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:17,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:17,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:17,537 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-11-28 16:08:17,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:17,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 16:08:17,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:08:17,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-28 16:08:17,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 16:08:17,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 16:08:17,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 16:08:17,607 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand 4 states. [2018-11-28 16:08:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:17,750 INFO L93 Difference]: Finished difference Result 175 states and 249 transitions. [2018-11-28 16:08:17,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 16:08:17,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-28 16:08:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:17,752 INFO L225 Difference]: With dead ends: 175 [2018-11-28 16:08:17,752 INFO L226 Difference]: Without dead ends: 106 [2018-11-28 16:08:17,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:08:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-28 16:08:17,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2018-11-28 16:08:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-28 16:08:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2018-11-28 16:08:17,773 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 56 [2018-11-28 16:08:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:17,773 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2018-11-28 16:08:17,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 16:08:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2018-11-28 16:08:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 16:08:17,775 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:17,776 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:17,776 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:17,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:17,776 INFO L82 PathProgramCache]: Analyzing trace with hash -227603191, now seen corresponding path program 1 times [2018-11-28 16:08:17,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:17,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:17,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:17,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:17,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:17,996 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 16:08:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:18,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:18,056 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-11-28 16:08:18,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:18,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 16:08:18,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:08:18,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-11-28 16:08:18,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 16:08:18,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 16:08:18,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 16:08:18,221 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand 9 states. [2018-11-28 16:08:18,598 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-28 16:08:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:18,960 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2018-11-28 16:08:18,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 16:08:18,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-11-28 16:08:18,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:18,963 INFO L225 Difference]: With dead ends: 185 [2018-11-28 16:08:18,963 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 16:08:18,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-28 16:08:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 16:08:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2018-11-28 16:08:18,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 16:08:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2018-11-28 16:08:18,986 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 56 [2018-11-28 16:08:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:18,987 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2018-11-28 16:08:18,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 16:08:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2018-11-28 16:08:18,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 16:08:18,988 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:18,990 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:18,990 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:18,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:18,991 INFO L82 PathProgramCache]: Analyzing trace with hash 743896390, now seen corresponding path program 1 times [2018-11-28 16:08:18,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:18,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:18,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:18,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:18,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:19,382 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 16:08:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:19,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:19,515 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-11-28 16:08:19,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:19,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 16:08:19,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:19,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 12 [2018-11-28 16:08:19,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 16:08:19,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 16:08:19,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-28 16:08:19,847 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand 12 states. [2018-11-28 16:08:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:23,192 INFO L93 Difference]: Finished difference Result 187 states and 254 transitions. [2018-11-28 16:08:23,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 16:08:23,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-11-28 16:08:23,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:23,196 INFO L225 Difference]: With dead ends: 187 [2018-11-28 16:08:23,196 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 16:08:23,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2018-11-28 16:08:23,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 16:08:23,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 85. [2018-11-28 16:08:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 16:08:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions. [2018-11-28 16:08:23,215 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 57 [2018-11-28 16:08:23,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:23,216 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 114 transitions. [2018-11-28 16:08:23,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 16:08:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2018-11-28 16:08:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 16:08:23,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:23,218 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:23,218 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:23,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:23,219 INFO L82 PathProgramCache]: Analyzing trace with hash 2063636268, now seen corresponding path program 1 times [2018-11-28 16:08:23,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:23,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:23,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:23,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:23,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:23,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:23,420 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-11-28 16:08:23,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:23,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 16:08:23,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:23,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-28 16:08:23,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 16:08:23,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 16:08:23,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:08:23,506 INFO L87 Difference]: Start difference. First operand 85 states and 114 transitions. Second operand 5 states. [2018-11-28 16:08:23,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:23,668 INFO L93 Difference]: Finished difference Result 169 states and 228 transitions. [2018-11-28 16:08:23,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 16:08:23,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-28 16:08:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:23,670 INFO L225 Difference]: With dead ends: 169 [2018-11-28 16:08:23,671 INFO L226 Difference]: Without dead ends: 94 [2018-11-28 16:08:23,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:08:23,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-28 16:08:23,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2018-11-28 16:08:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 16:08:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2018-11-28 16:08:23,701 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 58 [2018-11-28 16:08:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:23,701 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2018-11-28 16:08:23,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 16:08:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2018-11-28 16:08:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 16:08:23,711 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:23,711 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:23,711 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:23,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:23,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2121428149, now seen corresponding path program 1 times [2018-11-28 16:08:23,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:23,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:23,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:23,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:23,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:23,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:23,880 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-11-28 16:08:23,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:23,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 16:08:24,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:24,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2018-11-28 16:08:24,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 16:08:24,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 16:08:24,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-28 16:08:24,407 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand 11 states. [2018-11-28 16:08:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:25,093 INFO L93 Difference]: Finished difference Result 198 states and 267 transitions. [2018-11-28 16:08:25,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 16:08:25,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-11-28 16:08:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:25,097 INFO L225 Difference]: With dead ends: 198 [2018-11-28 16:08:25,098 INFO L226 Difference]: Without dead ends: 111 [2018-11-28 16:08:25,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-28 16:08:25,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-28 16:08:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 88. [2018-11-28 16:08:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 16:08:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 115 transitions. [2018-11-28 16:08:25,121 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 115 transitions. Word has length 60 [2018-11-28 16:08:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:25,122 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 115 transitions. [2018-11-28 16:08:25,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 16:08:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2018-11-28 16:08:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 16:08:25,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:25,125 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:25,125 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:25,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:25,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1179266224, now seen corresponding path program 1 times [2018-11-28 16:08:25,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:25,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:25,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:25,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:25,215 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:25,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:25,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 16:08:25,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:25,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 16:08:25,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 16:08:25,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 16:08:25,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 16:08:25,292 INFO L87 Difference]: Start difference. First operand 88 states and 115 transitions. Second operand 6 states. [2018-11-28 16:08:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:25,501 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2018-11-28 16:08:25,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 16:08:25,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-11-28 16:08:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:25,506 INFO L225 Difference]: With dead ends: 182 [2018-11-28 16:08:25,506 INFO L226 Difference]: Without dead ends: 104 [2018-11-28 16:08:25,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-28 16:08:25,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-28 16:08:25,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 90. [2018-11-28 16:08:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-28 16:08:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 118 transitions. [2018-11-28 16:08:25,520 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 118 transitions. Word has length 62 [2018-11-28 16:08:25,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:25,520 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 118 transitions. [2018-11-28 16:08:25,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 16:08:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 118 transitions. [2018-11-28 16:08:25,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 16:08:25,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:25,522 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:25,522 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:25,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:25,522 INFO L82 PathProgramCache]: Analyzing trace with hash -430731599, now seen corresponding path program 1 times [2018-11-28 16:08:25,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:25,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:25,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:25,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:25,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:26,142 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 16:08:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:26,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:26,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:26,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:26,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 16:08:26,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:26,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 14 [2018-11-28 16:08:26,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 16:08:26,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 16:08:26,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-28 16:08:26,573 INFO L87 Difference]: Start difference. First operand 90 states and 118 transitions. Second operand 14 states. [2018-11-28 16:08:27,477 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-28 16:08:27,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:27,820 INFO L93 Difference]: Finished difference Result 198 states and 263 transitions. [2018-11-28 16:08:27,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-28 16:08:27,821 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2018-11-28 16:08:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:27,823 INFO L225 Difference]: With dead ends: 198 [2018-11-28 16:08:27,823 INFO L226 Difference]: Without dead ends: 113 [2018-11-28 16:08:27,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2018-11-28 16:08:27,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-28 16:08:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 76. [2018-11-28 16:08:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 16:08:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2018-11-28 16:08:27,838 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 64 [2018-11-28 16:08:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:27,839 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2018-11-28 16:08:27,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 16:08:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2018-11-28 16:08:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 16:08:27,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:27,840 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:27,840 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:27,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:27,841 INFO L82 PathProgramCache]: Analyzing trace with hash -589993096, now seen corresponding path program 1 times [2018-11-28 16:08:27,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:27,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:27,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:27,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:27,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:28,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:28,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:28,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:28,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 16:08:28,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:28,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 16:08:28,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 16:08:28,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 16:08:28,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:08:28,417 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand 7 states. [2018-11-28 16:08:28,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:28,650 INFO L93 Difference]: Finished difference Result 165 states and 209 transitions. [2018-11-28 16:08:28,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 16:08:28,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-11-28 16:08:28,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:28,652 INFO L225 Difference]: With dead ends: 165 [2018-11-28 16:08:28,652 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 16:08:28,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-11-28 16:08:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 16:08:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 78. [2018-11-28 16:08:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 16:08:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2018-11-28 16:08:28,666 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 69 [2018-11-28 16:08:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:28,666 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2018-11-28 16:08:28,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 16:08:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2018-11-28 16:08:28,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 16:08:28,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:28,669 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:28,669 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:28,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:28,671 INFO L82 PathProgramCache]: Analyzing trace with hash 943129273, now seen corresponding path program 1 times [2018-11-28 16:08:28,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:28,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:28,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:28,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:28,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:28,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:28,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:28,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:28,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:29,003 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-28 16:08:29,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:29,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2018-11-28 16:08:29,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 16:08:29,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 16:08:29,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-11-28 16:08:29,023 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 16 states. [2018-11-28 16:08:29,336 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 16:08:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:30,560 INFO L93 Difference]: Finished difference Result 201 states and 262 transitions. [2018-11-28 16:08:30,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 16:08:30,562 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2018-11-28 16:08:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:30,564 INFO L225 Difference]: With dead ends: 201 [2018-11-28 16:08:30,564 INFO L226 Difference]: Without dead ends: 133 [2018-11-28 16:08:30,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 16:08:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-28 16:08:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 96. [2018-11-28 16:08:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 16:08:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2018-11-28 16:08:30,589 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 71 [2018-11-28 16:08:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:30,590 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2018-11-28 16:08:30,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 16:08:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2018-11-28 16:08:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 16:08:30,591 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:30,591 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:30,591 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:30,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:30,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1201821761, now seen corresponding path program 1 times [2018-11-28 16:08:30,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:30,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:30,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:30,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:30,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:30,926 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:30,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:30,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:30,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:30,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 16:08:31,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:31,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-28 16:08:31,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 16:08:31,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 16:08:31,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-28 16:08:31,003 INFO L87 Difference]: Start difference. First operand 96 states and 126 transitions. Second operand 8 states. [2018-11-28 16:08:31,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:31,396 INFO L93 Difference]: Finished difference Result 212 states and 279 transitions. [2018-11-28 16:08:31,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 16:08:31,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-11-28 16:08:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:31,400 INFO L225 Difference]: With dead ends: 212 [2018-11-28 16:08:31,400 INFO L226 Difference]: Without dead ends: 126 [2018-11-28 16:08:31,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-11-28 16:08:31,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-28 16:08:31,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 98. [2018-11-28 16:08:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 16:08:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2018-11-28 16:08:31,416 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 72 [2018-11-28 16:08:31,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:31,417 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2018-11-28 16:08:31,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 16:08:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2018-11-28 16:08:31,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 16:08:31,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:31,418 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:31,418 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:31,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:31,419 INFO L82 PathProgramCache]: Analyzing trace with hash 903805378, now seen corresponding path program 1 times [2018-11-28 16:08:31,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:31,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:31,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:31,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:31,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:31,651 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:31,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:31,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:31,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:31,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-28 16:08:31,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:31,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2018-11-28 16:08:31,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 16:08:31,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 16:08:31,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-11-28 16:08:31,870 INFO L87 Difference]: Start difference. First operand 98 states and 129 transitions. Second operand 17 states. [2018-11-28 16:08:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:33,879 INFO L93 Difference]: Finished difference Result 222 states and 293 transitions. [2018-11-28 16:08:33,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-28 16:08:33,880 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2018-11-28 16:08:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:33,881 INFO L225 Difference]: With dead ends: 222 [2018-11-28 16:08:33,881 INFO L226 Difference]: Without dead ends: 112 [2018-11-28 16:08:33,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=208, Invalid=1514, Unknown=0, NotChecked=0, Total=1722 [2018-11-28 16:08:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-28 16:08:33,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 79. [2018-11-28 16:08:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-28 16:08:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2018-11-28 16:08:33,893 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 74 [2018-11-28 16:08:33,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:33,894 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2018-11-28 16:08:33,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 16:08:33,894 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2018-11-28 16:08:33,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 16:08:33,895 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:33,895 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:33,895 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:33,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:33,896 INFO L82 PathProgramCache]: Analyzing trace with hash 613414087, now seen corresponding path program 2 times [2018-11-28 16:08:33,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:33,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:33,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:33,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:33,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 16:08:34,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:34,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:34,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 16:08:34,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 16:08:34,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:08:34,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 16:08:34,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:34,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-28 16:08:34,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 16:08:34,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 16:08:34,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-28 16:08:34,889 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 9 states. [2018-11-28 16:08:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:35,061 INFO L93 Difference]: Finished difference Result 173 states and 212 transitions. [2018-11-28 16:08:35,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 16:08:35,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-11-28 16:08:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:35,064 INFO L225 Difference]: With dead ends: 173 [2018-11-28 16:08:35,064 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 16:08:35,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-28 16:08:35,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 16:08:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2018-11-28 16:08:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-28 16:08:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2018-11-28 16:08:35,076 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 79 [2018-11-28 16:08:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:35,077 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2018-11-28 16:08:35,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 16:08:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2018-11-28 16:08:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 16:08:35,078 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:35,078 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:35,078 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:35,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:35,079 INFO L82 PathProgramCache]: Analyzing trace with hash -847324280, now seen corresponding path program 2 times [2018-11-28 16:08:35,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:35,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:35,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:35,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:08:35,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 55 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 16:08:35,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:35,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:35,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 16:08:35,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 16:08:35,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:08:35,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-28 16:08:35,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:35,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2018-11-28 16:08:35,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 16:08:35,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 16:08:35,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-28 16:08:35,850 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand 18 states. [2018-11-28 16:08:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:37,220 INFO L93 Difference]: Finished difference Result 182 states and 228 transitions. [2018-11-28 16:08:37,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 16:08:37,221 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2018-11-28 16:08:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:37,223 INFO L225 Difference]: With dead ends: 182 [2018-11-28 16:08:37,223 INFO L226 Difference]: Without dead ends: 106 [2018-11-28 16:08:37,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2018-11-28 16:08:37,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-28 16:08:37,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 85. [2018-11-28 16:08:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 16:08:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2018-11-28 16:08:37,238 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 81 [2018-11-28 16:08:37,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:37,238 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2018-11-28 16:08:37,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 16:08:37,238 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2018-11-28 16:08:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 16:08:37,239 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:37,239 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:37,239 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:37,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:37,240 INFO L82 PathProgramCache]: Analyzing trace with hash 354457994, now seen corresponding path program 1 times [2018-11-28 16:08:37,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:37,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:37,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:37,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:08:37,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 16:08:38,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:38,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:38,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:38,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 26 proven. 57 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 16:08:38,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:38,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-28 16:08:38,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 16:08:38,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 16:08:38,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-28 16:08:38,362 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 10 states. [2018-11-28 16:08:38,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:38,577 INFO L93 Difference]: Finished difference Result 189 states and 231 transitions. [2018-11-28 16:08:38,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 16:08:38,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2018-11-28 16:08:38,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:38,580 INFO L225 Difference]: With dead ends: 189 [2018-11-28 16:08:38,580 INFO L226 Difference]: Without dead ends: 111 [2018-11-28 16:08:38,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-28 16:08:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-28 16:08:38,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 87. [2018-11-28 16:08:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 16:08:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2018-11-28 16:08:38,593 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 82 [2018-11-28 16:08:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:38,594 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2018-11-28 16:08:38,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 16:08:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2018-11-28 16:08:38,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-28 16:08:38,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:38,595 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:38,595 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:38,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:38,596 INFO L82 PathProgramCache]: Analyzing trace with hash -481117557, now seen corresponding path program 1 times [2018-11-28 16:08:38,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:38,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:38,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 4 proven. 74 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 16:08:38,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:38,788 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:38,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:38,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-28 16:08:39,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:39,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-28 16:08:39,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 16:08:39,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 16:08:39,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-11-28 16:08:39,145 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 19 states. [2018-11-28 16:08:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:40,182 INFO L93 Difference]: Finished difference Result 197 states and 242 transitions. [2018-11-28 16:08:40,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 16:08:40,182 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-28 16:08:40,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:40,184 INFO L225 Difference]: With dead ends: 197 [2018-11-28 16:08:40,184 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 16:08:40,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2018-11-28 16:08:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 16:08:40,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2018-11-28 16:08:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 16:08:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2018-11-28 16:08:40,199 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 84 [2018-11-28 16:08:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:40,199 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2018-11-28 16:08:40,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 16:08:40,199 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2018-11-28 16:08:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 16:08:40,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:40,200 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:40,201 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:40,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:40,201 INFO L82 PathProgramCache]: Analyzing trace with hash 887832869, now seen corresponding path program 1 times [2018-11-28 16:08:40,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:40,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:40,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:40,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:40,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 4 proven. 87 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 16:08:40,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:40,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:40,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:40,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 26 proven. 77 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 16:08:40,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:40,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-28 16:08:40,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 16:08:40,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 16:08:40,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-11-28 16:08:40,494 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand 11 states. [2018-11-28 16:08:40,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:40,940 INFO L93 Difference]: Finished difference Result 199 states and 242 transitions. [2018-11-28 16:08:40,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 16:08:40,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-28 16:08:40,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:40,943 INFO L225 Difference]: With dead ends: 199 [2018-11-28 16:08:40,943 INFO L226 Difference]: Without dead ends: 118 [2018-11-28 16:08:40,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-11-28 16:08:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-28 16:08:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2018-11-28 16:08:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-28 16:08:40,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2018-11-28 16:08:40,964 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 85 [2018-11-28 16:08:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:40,964 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2018-11-28 16:08:40,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 16:08:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2018-11-28 16:08:40,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 16:08:40,967 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:40,968 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:40,968 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:40,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:40,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1299513318, now seen corresponding path program 1 times [2018-11-28 16:08:40,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:40,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:40,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:40,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:40,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:41,601 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 4 proven. 95 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 16:08:41,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:41,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:41,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:41,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-28 16:08:41,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:41,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-11-28 16:08:41,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 16:08:41,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 16:08:41,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-11-28 16:08:41,894 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand 20 states. [2018-11-28 16:08:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:44,828 INFO L93 Difference]: Finished difference Result 184 states and 226 transitions. [2018-11-28 16:08:44,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-28 16:08:44,829 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 87 [2018-11-28 16:08:44,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:44,829 INFO L225 Difference]: With dead ends: 184 [2018-11-28 16:08:44,829 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 16:08:44,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 16:08:44,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 16:08:44,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 16:08:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 16:08:44,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 16:08:44,831 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2018-11-28 16:08:44,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:44,832 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 16:08:44,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 16:08:44,832 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 16:08:44,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 16:08:44,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 16:08:44,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:44,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:44,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:45,088 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 56 [2018-11-28 16:08:45,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:45,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:45,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:45,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:45,290 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 99 [2018-11-28 16:08:45,635 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 66 [2018-11-28 16:08:45,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:45,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:45,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:45,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:45,953 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 76 [2018-11-28 16:08:46,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:46,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:46,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:46,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:46,062 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 82 [2018-11-28 16:08:46,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:46,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:46,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:46,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:46,252 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 76 [2018-11-28 16:08:46,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:46,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:46,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:46,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:46,368 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 94 [2018-11-28 16:08:46,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:46,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:46,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:46,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:08:46,587 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 94 [2018-11-28 16:08:46,809 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 77 [2018-11-28 16:08:47,849 WARN L180 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2018-11-28 16:08:48,346 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2018-11-28 16:08:48,860 WARN L180 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2018-11-28 16:08:50,329 WARN L180 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 166 DAG size of output: 22 [2018-11-28 16:08:50,354 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 16:08:50,354 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:08:50,354 INFO L448 ceAbstractionStarter]: For program point mulfltEXIT(lines 137 209) no Hoare annotation was computed. [2018-11-28 16:08:50,354 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2018-11-28 16:08:50,354 INFO L448 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2018-11-28 16:08:50,354 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2018-11-28 16:08:50,355 INFO L448 ceAbstractionStarter]: For program point mulfltFINAL(lines 137 209) no Hoare annotation was computed. [2018-11-28 16:08:50,355 INFO L451 ceAbstractionStarter]: At program point mulfltENTRY(lines 137 209) the Hoare annotation is: true [2018-11-28 16:08:50,355 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2018-11-28 16:08:50,355 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-11-28 16:08:50,355 INFO L448 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2018-11-28 16:08:50,355 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2018-11-28 16:08:50,355 INFO L444 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (let ((.cse0 (= 0 mulflt_~__retres10~1)) (.cse3 (not (= 0 (mod |mulflt_#in~b| 4294967296)))) (.cse2 (mod |mulflt_#in~a| 4294967296))) (or (and (exists ((v_mulflt_~a_6 Int)) (< (mod v_mulflt_~a_6 4294967296) (mod |mulflt_#in~b| 4294967296))) .cse0) (and (exists ((mulflt_~b Int)) (let ((.cse1 (mod mulflt_~b 4294967296))) (and (<= .cse1 (mod |mulflt_#in~a| 4294967296)) (not (= .cse1 0))))) (<= (mod mulflt_~b 4294967296) .cse2) (= mulflt_~a |mulflt_#in~a|) .cse3) (and (= mulflt_~b |mulflt_#in~b|) .cse0) (and (= mulflt_~b |mulflt_#in~a|) .cse3 (not (= .cse2 0))))) [2018-11-28 16:08:50,355 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2018-11-28 16:08:50,355 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-11-28 16:08:50,356 INFO L448 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-11-28 16:08:50,356 INFO L444 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (let ((.cse0 (<= |base2flt_#in~e| base2flt_~e)) (.cse1 (<= base2flt_~e |base2flt_#in~e|))) (or (and (= 0 base2flt_~__retres4~0) .cse0 (= base2flt_~m |base2flt_#in~m|) .cse1) (or (<= (+ |base2flt_#in~m| 4261412865) 0) (<= 16777216 |base2flt_#in~m|)) (and .cse0 (<= (+ |base2flt_#in~e| 128) 0)) (and (<= 127 |base2flt_#in~e|) .cse1) (forall ((base2flt_~m Int)) (or (< base2flt_~m |base2flt_#in~m|) (< |base2flt_#in~m| base2flt_~m) (< 0 (mod base2flt_~m 4294967296)))))) [2018-11-28 16:08:50,356 INFO L448 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-11-28 16:08:50,356 INFO L448 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-11-28 16:08:50,356 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-28 16:08:50,356 INFO L444 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (and (forall ((base2flt_~m Int)) (or (< base2flt_~m |base2flt_#in~m|) (< |base2flt_#in~m| base2flt_~m) (< 0 (mod base2flt_~m 4294967296)))) (<= base2flt_~e |base2flt_#in~e|)) [2018-11-28 16:08:50,356 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-11-28 16:08:50,356 INFO L451 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-11-28 16:08:50,356 INFO L448 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-11-28 16:08:50,357 INFO L444 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (or (let ((.cse1 (div base2flt_~m 4294967296))) (let ((.cse0 (+ .cse1 1))) (and (or (<= |base2flt_#in~m| base2flt_~m) (< 0 .cse0)) (or (<= .cse0 0) (<= (+ (* 4294967296 .cse1) 16777216) |base2flt_#in~m|))))) (forall ((base2flt_~m Int)) (or (< base2flt_~m |base2flt_#in~m|) (< |base2flt_#in~m| base2flt_~m) (< 0 (mod base2flt_~m 4294967296))))) [2018-11-28 16:08:50,357 INFO L448 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-11-28 16:08:50,357 INFO L444 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: (let ((.cse2 (div base2flt_~m 4294967296))) (let ((.cse0 (+ .cse2 1))) (let ((.cse1 (<= .cse0 0))) (and (<= |base2flt_#in~e| base2flt_~e) (or (<= |base2flt_#in~m| base2flt_~m) (< 0 .cse0)) (or .cse1 (<= (+ (* 4294967296 .cse2) 16777216) |base2flt_#in~m|)) (or (<= base2flt_~m |base2flt_#in~m|) .cse1))))) [2018-11-28 16:08:50,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:08:50,357 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 16:08:50,357 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 16:08:50,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 16:08:50,357 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2018-11-28 16:08:50,357 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 210 266) no Hoare annotation was computed. [2018-11-28 16:08:50,357 INFO L448 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2018-11-28 16:08:50,358 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2018-11-28 16:08:50,358 INFO L448 ceAbstractionStarter]: For program point L246-1(lines 246 262) no Hoare annotation was computed. [2018-11-28 16:08:50,358 INFO L448 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2018-11-28 16:08:50,358 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 210 266) no Hoare annotation was computed. [2018-11-28 16:08:50,358 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2018-11-28 16:08:50,358 INFO L448 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2018-11-28 16:08:50,358 INFO L444 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-28 16:08:50,358 INFO L448 ceAbstractionStarter]: For program point L230-1(line 230) no Hoare annotation was computed. [2018-11-28 16:08:50,358 INFO L451 ceAbstractionStarter]: At program point L228(line 228) the Hoare annotation is: true [2018-11-28 16:08:50,358 INFO L448 ceAbstractionStarter]: For program point L228-1(line 228) no Hoare annotation was computed. [2018-11-28 16:08:50,359 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 210 266) the Hoare annotation is: true [2018-11-28 16:08:50,359 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2018-11-28 16:08:50,359 INFO L444 ceAbstractionStarter]: At program point L247-2(lines 247 256) the Hoare annotation is: (and (= main_~tmp___1~0 0) (= main_~tmp___0~0 0)) [2018-11-28 16:08:50,359 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2018-11-28 16:08:50,359 INFO L444 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-28 16:08:50,359 INFO L444 ceAbstractionStarter]: At program point L233-2(lines 233 242) the Hoare annotation is: (let ((.cse0 (= 0 main_~zero~0))) (or (and (= main_~b~0 0) .cse0) (and (<= 1 main_~tmp~2) (<= 1 main_~sa~0)) (and (<= (mod main_~a~0 4294967296) 0) .cse0) (<= (+ main_~sa~0 1) 0))) [2018-11-28 16:08:50,359 INFO L448 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-28 16:08:50,359 INFO L444 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-28 16:08:50,359 INFO L448 ceAbstractionStarter]: For program point L229-1(line 229) no Hoare annotation was computed. [2018-11-28 16:08:50,360 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-11-28 16:08:50,360 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-11-28 16:08:50,360 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-11-28 16:08:50,360 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-11-28 16:08:50,360 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-11-28 16:08:50,360 INFO L448 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-11-28 16:08:50,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-28 16:08:50,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-28 16:08:50,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-28 16:08:50,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-28 16:08:50,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-28 16:08:50,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-28 16:08:50,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:08:50 BoogieIcfgContainer [2018-11-28 16:08:50,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:08:50,388 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:08:50,388 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:08:50,388 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:08:50,388 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:08:14" (3/4) ... [2018-11-28 16:08:50,392 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 16:08:50,400 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 16:08:50,400 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mulflt [2018-11-28 16:08:50,400 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-11-28 16:08:50,400 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 16:08:50,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-28 16:08:50,407 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-11-28 16:08:50,408 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-28 16:08:50,408 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 16:08:50,442 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == __retres4 && \old(e) <= e) && m == \old(m)) && e <= \old(e)) || \old(m) + 4261412865 <= 0 || 16777216 <= \old(m)) || (\old(e) <= e && \old(e) + 128 <= 0)) || (127 <= \old(e) && e <= \old(e))) || (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) [2018-11-28 16:08:50,442 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) && e <= \old(e) [2018-11-28 16:08:50,442 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(e) <= e && (\old(m) <= m || 0 < m / 4294967296 + 1)) && (m / 4294967296 + 1 <= 0 || 4294967296 * (m / 4294967296) + 16777216 <= \old(m))) && (m <= \old(m) || m / 4294967296 + 1 <= 0) [2018-11-28 16:08:50,442 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(m) <= m || 0 < m / 4294967296 + 1) && (m / 4294967296 + 1 <= 0 || 4294967296 * (m / 4294967296) + 16777216 <= \old(m))) || (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) [2018-11-28 16:08:50,444 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) && 0 == __retres10) || ((((\exists mulflt_~b : int :: mulflt_~b % 4294967296 <= \old(a) % 4294967296 && !(mulflt_~b % 4294967296 == 0)) && b % 4294967296 <= \old(a) % 4294967296) && a == \old(a)) && !(0 == \old(b) % 4294967296))) || (b == \old(b) && 0 == __retres10)) || ((b == \old(a) && !(0 == \old(b) % 4294967296)) && !(\old(a) % 4294967296 == 0)) [2018-11-28 16:08:50,490 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 16:08:50,490 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:08:50,494 INFO L168 Benchmark]: Toolchain (without parser) took 37338.52 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 404.2 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -315.4 MB). Peak memory consumption was 88.8 MB. Max. memory is 11.5 GB. [2018-11-28 16:08:50,495 INFO L168 Benchmark]: CDTParser took 0.19 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-11-28 16:08:50,495 INFO L168 Benchmark]: CACSL2BoogieTranslator took 471.94 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-28 16:08:50,501 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.68 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:08:50,501 INFO L168 Benchmark]: Boogie Preprocessor took 118.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -173.6 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-11-28 16:08:50,502 INFO L168 Benchmark]: RCFGBuilder took 660.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-28 16:08:50,502 INFO L168 Benchmark]: TraceAbstraction took 35947.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 281.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -176.8 MB). Peak memory consumption was 507.1 MB. Max. memory is 11.5 GB. [2018-11-28 16:08:50,502 INFO L168 Benchmark]: Witness Printer took 102.85 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:08:50,507 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.19 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 471.94 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.68 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 118.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -173.6 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 660.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35947.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 281.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -176.8 MB). Peak memory consumption was 507.1 MB. Max. memory is 11.5 GB. * Witness Printer took 102.85 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: 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: 25]: Loop Invariant [2018-11-28 16:08:50,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: ((\old(m) <= m || 0 < m / 4294967296 + 1) && (m / 4294967296 + 1 <= 0 || 4294967296 * (m / 4294967296) + 16777216 <= \old(m))) || (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) - InvariantResult [Line: 18]: Loop Invariant [2018-11-28 16:08:50,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: ((((((0 == __retres4 && \old(e) <= e) && m == \old(m)) && e <= \old(e)) || \old(m) + 4261412865 <= 0 || 16777216 <= \old(m)) || (\old(e) <= e && \old(e) + 128 <= 0)) || (127 <= \old(e) && e <= \old(e))) || (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) - InvariantResult [Line: 147]: Loop Invariant [2018-11-28 16:08:50,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-28 16:08:50,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-28 16:08:50,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-28 16:08:50,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-28 16:08:50,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-28 16:08:50,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] Derived loop invariant: ((((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) && 0 == __retres10) || ((((\exists mulflt_~b : int :: mulflt_~b % 4294967296 <= \old(a) % 4294967296 && !(mulflt_~b % 4294967296 == 0)) && b % 4294967296 <= \old(a) % 4294967296) && a == \old(a)) && !(0 == \old(b) % 4294967296))) || (b == \old(b) && 0 == __retres10)) || ((b == \old(a) && !(0 == \old(b) % 4294967296)) && !(\old(a) % 4294967296 == 0)) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((\old(e) <= e && (\old(m) <= m || 0 < m / 4294967296 + 1)) && (m / 4294967296 + 1 <= 0 || 4294967296 * (m / 4294967296) + 16777216 <= \old(m))) && (m <= \old(m) || m / 4294967296 + 1 <= 0) - InvariantResult [Line: 27]: Loop Invariant [2018-11-28 16:08:50,541 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,541 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,541 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,541 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) && e <= \old(e) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 59 locations, 1 error locations. SAFE Result, 35.8s OverallTime, 21 OverallIterations, 8 TraceHistogramMax, 18.6s AutomataDifference, 0.0s DeadEndRemovalTime, 5.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1305 SDtfs, 1053 SDslu, 8656 SDs, 0 SdLazy, 5347 SolverSat, 146 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1615 GetRequests, 1287 SyntacticMatches, 11 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=14, 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.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 392 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 407 PreInvPairs, 1346 NumberOfFragments, 285 HoareAnnotationTreeSize, 407 FomulaSimplifications, 840292544 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 18 FomulaSimplificationsInter, 103597 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 2702 NumberOfCodeBlocks, 2702 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2662 ConstructedInterpolants, 36 QuantifiedInterpolants, 440968 SizeOfPredicates, 53 NumberOfNonLiveVariables, 3493 ConjunctsInSsa, 248 ConjunctsInUnsatCore, 40 InterpolantComputations, 5 PerfectInterpolantSequences, 1241/2228 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...