./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/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-0ed9222-m [2019-01-11 21:17:08,824 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:17:08,826 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:17:08,837 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:17:08,837 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:17:08,839 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:17:08,840 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:17:08,842 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:17:08,844 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:17:08,845 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:17:08,846 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:17:08,846 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:17:08,847 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:17:08,848 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:17:08,849 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:17:08,850 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:17:08,851 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:17:08,853 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:17:08,855 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:17:08,857 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:17:08,858 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:17:08,859 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:17:08,862 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:17:08,863 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:17:08,863 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:17:08,864 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:17:08,865 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:17:08,866 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:17:08,867 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:17:08,868 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:17:08,869 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:17:08,869 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:17:08,869 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:17:08,870 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:17:08,871 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:17:08,872 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:17:08,872 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:17:08,887 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:17:08,887 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:17:08,888 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:17:08,889 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:17:08,889 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:17:08,889 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:17:08,890 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:17:08,890 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:17:08,890 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:17:08,890 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:17:08,890 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:17:08,890 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:17:08,891 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:17:08,892 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:17:08,892 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:17:08,892 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:17:08,892 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:17:08,892 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:17:08,892 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:17:08,893 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:17:08,893 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:17:08,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:17:08,893 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:17:08,893 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:17:08,894 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:17:08,895 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:17:08,895 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:17:08,895 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:17:08,896 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 [2019-01-11 21:17:08,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:17:08,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:17:08,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:17:08,947 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:17:08,947 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:17:08,948 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 [2019-01-11 21:17:08,998 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17558e75e/42fd6e6189c24c6b8ab122923966c1c3/FLAGf04e69527 [2019-01-11 21:17:09,473 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:17:09,473 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-11 21:17:09,481 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17558e75e/42fd6e6189c24c6b8ab122923966c1c3/FLAGf04e69527 [2019-01-11 21:17:09,815 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17558e75e/42fd6e6189c24c6b8ab122923966c1c3 [2019-01-11 21:17:09,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:17:09,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:17:09,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:17:09,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:17:09,825 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:17:09,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:17:09" (1/1) ... [2019-01-11 21:17:09,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43fcd915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:09, skipping insertion in model container [2019-01-11 21:17:09,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:17:09" (1/1) ... [2019-01-11 21:17:09,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:17:09,866 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:17:10,158 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:17:10,167 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:17:10,211 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:17:10,225 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:17:10,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:10 WrapperNode [2019-01-11 21:17:10,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:17:10,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:17:10,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:17:10,227 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:17:10,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:10" (1/1) ... [2019-01-11 21:17:10,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:10" (1/1) ... [2019-01-11 21:17:10,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:17:10,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:17:10,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:17:10,350 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:17:10,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:10" (1/1) ... [2019-01-11 21:17:10,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:10" (1/1) ... [2019-01-11 21:17:10,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:10" (1/1) ... [2019-01-11 21:17:10,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:10" (1/1) ... [2019-01-11 21:17:10,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:10" (1/1) ... [2019-01-11 21:17:10,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:10" (1/1) ... [2019-01-11 21:17:10,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:10" (1/1) ... [2019-01-11 21:17:10,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:17:10,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:17:10,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:17:10,385 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:17:10,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:17:10,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:17:10,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:17:11,207 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:17:11,208 INFO L286 CfgBuilder]: Removed 24 assue(true) statements. [2019-01-11 21:17:11,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:17:11 BoogieIcfgContainer [2019-01-11 21:17:11,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:17:11,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:17:11,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:17:11,213 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:17:11,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:17:09" (1/3) ... [2019-01-11 21:17:11,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653230e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:17:11, skipping insertion in model container [2019-01-11 21:17:11,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:10" (2/3) ... [2019-01-11 21:17:11,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653230e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:17:11, skipping insertion in model container [2019-01-11 21:17:11,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:17:11" (3/3) ... [2019-01-11 21:17:11,216 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-11 21:17:11,226 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:17:11,233 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:17:11,248 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:17:11,279 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:17:11,279 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:17:11,279 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:17:11,280 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:17:11,280 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:17:11,280 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:17:11,280 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:17:11,280 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:17:11,280 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:17:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-01-11 21:17:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-11 21:17:11,303 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:11,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:11,306 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:11,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:11,312 INFO L82 PathProgramCache]: Analyzing trace with hash -991589482, now seen corresponding path program 1 times [2019-01-11 21:17:11,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:11,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:11,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:11,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:11,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:11,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:11,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:11,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:11,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:11,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:11,551 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2019-01-11 21:17:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:11,640 INFO L93 Difference]: Finished difference Result 149 states and 250 transitions. [2019-01-11 21:17:11,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:11,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-11 21:17:11,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:11,659 INFO L225 Difference]: With dead ends: 149 [2019-01-11 21:17:11,663 INFO L226 Difference]: Without dead ends: 67 [2019-01-11 21:17:11,667 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 [2019-01-11 21:17:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-11 21:17:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-11 21:17:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-11 21:17:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2019-01-11 21:17:11,721 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 24 [2019-01-11 21:17:11,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:11,722 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2019-01-11 21:17:11,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2019-01-11 21:17:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 21:17:11,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:11,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:11,725 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:11,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:11,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1791855548, now seen corresponding path program 1 times [2019-01-11 21:17:11,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:11,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:11,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:11,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:11,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:11,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:11,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 21:17:11,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:17:11,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:17:11,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:17:11,821 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand 4 states. [2019-01-11 21:17:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:11,903 INFO L93 Difference]: Finished difference Result 87 states and 128 transitions. [2019-01-11 21:17:11,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:17:11,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-01-11 21:17:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:11,906 INFO L225 Difference]: With dead ends: 87 [2019-01-11 21:17:11,906 INFO L226 Difference]: Without dead ends: 67 [2019-01-11 21:17:11,908 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 [2019-01-11 21:17:11,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-11 21:17:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-11 21:17:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-11 21:17:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2019-01-11 21:17:11,918 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 26 [2019-01-11 21:17:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:11,919 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2019-01-11 21:17:11,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:17:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2019-01-11 21:17:11,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 21:17:11,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:11,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:11,922 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2050020986, now seen corresponding path program 1 times [2019-01-11 21:17:11,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:11,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:11,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:11,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:11,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:12,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:12,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:12,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:12,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:12,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:12,026 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand 3 states. [2019-01-11 21:17:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:12,189 INFO L93 Difference]: Finished difference Result 121 states and 176 transitions. [2019-01-11 21:17:12,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:12,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-11 21:17:12,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:12,191 INFO L225 Difference]: With dead ends: 121 [2019-01-11 21:17:12,191 INFO L226 Difference]: Without dead ends: 75 [2019-01-11 21:17:12,192 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 [2019-01-11 21:17:12,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-11 21:17:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2019-01-11 21:17:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-11 21:17:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2019-01-11 21:17:12,200 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 26 [2019-01-11 21:17:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:12,201 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2019-01-11 21:17:12,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2019-01-11 21:17:12,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-11 21:17:12,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:12,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:12,204 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:12,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:12,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1329816874, now seen corresponding path program 1 times [2019-01-11 21:17:12,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:12,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:12,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:12,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:12,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:12,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:12,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 21:17:12,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:17:12,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:17:12,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:17:12,326 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand 4 states. [2019-01-11 21:17:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:12,500 INFO L93 Difference]: Finished difference Result 155 states and 220 transitions. [2019-01-11 21:17:12,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:17:12,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-01-11 21:17:12,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:12,502 INFO L225 Difference]: With dead ends: 155 [2019-01-11 21:17:12,502 INFO L226 Difference]: Without dead ends: 90 [2019-01-11 21:17:12,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:17:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-11 21:17:12,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-01-11 21:17:12,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 21:17:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2019-01-11 21:17:12,511 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 29 [2019-01-11 21:17:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:12,511 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2019-01-11 21:17:12,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:17:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2019-01-11 21:17:12,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 21:17:12,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:12,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:12,513 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:12,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:12,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1760271131, now seen corresponding path program 1 times [2019-01-11 21:17:12,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:12,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:12,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:12,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:12,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:12,709 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-11 21:17:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:12,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:12,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:12,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:12,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:12,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:12,717 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand 3 states. [2019-01-11 21:17:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:13,005 INFO L93 Difference]: Finished difference Result 108 states and 153 transitions. [2019-01-11 21:17:13,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:13,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-01-11 21:17:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:13,007 INFO L225 Difference]: With dead ends: 108 [2019-01-11 21:17:13,007 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 21:17:13,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 21:17:13,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-11 21:17:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-11 21:17:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2019-01-11 21:17:13,024 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 30 [2019-01-11 21:17:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:13,025 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2019-01-11 21:17:13,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2019-01-11 21:17:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-11 21:17:13,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:13,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:13,030 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:13,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:13,030 INFO L82 PathProgramCache]: Analyzing trace with hash -171839511, now seen corresponding path program 1 times [2019-01-11 21:17:13,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:13,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:13,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:13,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:13,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:13,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:13,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 21:17:13,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:17:13,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:17:13,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:17:13,210 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand 4 states. [2019-01-11 21:17:13,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:13,391 INFO L93 Difference]: Finished difference Result 110 states and 154 transitions. [2019-01-11 21:17:13,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:17:13,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-01-11 21:17:13,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:13,394 INFO L225 Difference]: With dead ends: 110 [2019-01-11 21:17:13,394 INFO L226 Difference]: Without dead ends: 63 [2019-01-11 21:17:13,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:17:13,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-11 21:17:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-01-11 21:17:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-11 21:17:13,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2019-01-11 21:17:13,405 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 31 [2019-01-11 21:17:13,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:13,406 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2019-01-11 21:17:13,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:17:13,406 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2019-01-11 21:17:13,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-11 21:17:13,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:13,408 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-11 21:17:13,409 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:13,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:13,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2115361752, now seen corresponding path program 1 times [2019-01-11 21:17:13,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:13,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:13,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:13,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:13,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:13,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:13,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:13,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:13,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:13,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:17:13,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-01-11 21:17:13,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:17:13,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:17:13,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:17:13,797 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand 5 states. [2019-01-11 21:17:13,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:13,980 INFO L93 Difference]: Finished difference Result 133 states and 184 transitions. [2019-01-11 21:17:13,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:17:13,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-11 21:17:13,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:13,987 INFO L225 Difference]: With dead ends: 133 [2019-01-11 21:17:13,987 INFO L226 Difference]: Without dead ends: 87 [2019-01-11 21:17:13,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:17:13,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-11 21:17:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 61. [2019-01-11 21:17:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 21:17:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2019-01-11 21:17:13,997 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 32 [2019-01-11 21:17:13,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:13,997 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2019-01-11 21:17:13,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:17:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2019-01-11 21:17:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-11 21:17:13,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:13,999 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-11 21:17:13,999 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:13,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:13,999 INFO L82 PathProgramCache]: Analyzing trace with hash 431286119, now seen corresponding path program 1 times [2019-01-11 21:17:13,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:14,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:14,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:14,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:14,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:14,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:14,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:14,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:14,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:17:14,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:17:14,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-01-11 21:17:14,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 21:17:14,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 21:17:14,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-11 21:17:14,677 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand 9 states. [2019-01-11 21:17:15,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:15,602 INFO L93 Difference]: Finished difference Result 141 states and 193 transitions. [2019-01-11 21:17:15,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 21:17:15,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-01-11 21:17:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:15,604 INFO L225 Difference]: With dead ends: 141 [2019-01-11 21:17:15,604 INFO L226 Difference]: Without dead ends: 94 [2019-01-11 21:17:15,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2019-01-11 21:17:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-11 21:17:15,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 62. [2019-01-11 21:17:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-11 21:17:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2019-01-11 21:17:15,612 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 34 [2019-01-11 21:17:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:15,612 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2019-01-11 21:17:15,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 21:17:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2019-01-11 21:17:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-11 21:17:15,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:15,615 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-11 21:17:15,615 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:15,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:15,615 INFO L82 PathProgramCache]: Analyzing trace with hash 575905444, now seen corresponding path program 1 times [2019-01-11 21:17:15,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:15,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:15,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:15,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:15,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:15,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:15,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:15,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:15,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:15,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:17:15,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-01-11 21:17:15,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 21:17:15,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 21:17:15,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:17:15,793 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand 6 states. [2019-01-11 21:17:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:15,946 INFO L93 Difference]: Finished difference Result 136 states and 184 transitions. [2019-01-11 21:17:15,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 21:17:15,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-01-11 21:17:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:15,947 INFO L225 Difference]: With dead ends: 136 [2019-01-11 21:17:15,948 INFO L226 Difference]: Without dead ends: 90 [2019-01-11 21:17:15,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:17:15,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-11 21:17:15,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 64. [2019-01-11 21:17:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-11 21:17:15,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2019-01-11 21:17:15,954 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 37 [2019-01-11 21:17:15,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:15,955 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2019-01-11 21:17:15,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 21:17:15,955 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2019-01-11 21:17:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-11 21:17:15,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:15,958 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-11 21:17:15,958 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:15,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:15,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1518183843, now seen corresponding path program 1 times [2019-01-11 21:17:15,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:15,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:15,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:15,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:15,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:16,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:16,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:16,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:16,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-11 21:17:16,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:17:16,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-01-11 21:17:16,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 21:17:16,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 21:17:16,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-11 21:17:16,353 INFO L87 Difference]: Start difference. First operand 64 states and 85 transitions. Second operand 10 states. [2019-01-11 21:17:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:16,672 INFO L93 Difference]: Finished difference Result 126 states and 168 transitions. [2019-01-11 21:17:16,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 21:17:16,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-01-11 21:17:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:16,676 INFO L225 Difference]: With dead ends: 126 [2019-01-11 21:17:16,676 INFO L226 Difference]: Without dead ends: 79 [2019-01-11 21:17:16,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-01-11 21:17:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-11 21:17:16,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2019-01-11 21:17:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-11 21:17:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2019-01-11 21:17:16,684 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 39 [2019-01-11 21:17:16,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:16,685 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2019-01-11 21:17:16,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 21:17:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2019-01-11 21:17:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-11 21:17:16,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:16,688 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:16,688 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:16,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash 895397540, now seen corresponding path program 1 times [2019-01-11 21:17:16,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:16,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:16,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:16,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:16,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-11 21:17:16,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:16,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-11 21:17:16,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 21:17:16,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 21:17:16,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:17:16,768 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand 6 states. [2019-01-11 21:17:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:16,886 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2019-01-11 21:17:16,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 21:17:16,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-01-11 21:17:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:16,889 INFO L225 Difference]: With dead ends: 75 [2019-01-11 21:17:16,889 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 21:17:16,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-11 21:17:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 21:17:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-11 21:17:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-11 21:17:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2019-01-11 21:17:16,895 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 40 [2019-01-11 21:17:16,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:16,895 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2019-01-11 21:17:16,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 21:17:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2019-01-11 21:17:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-11 21:17:16,896 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:16,896 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:16,896 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:16,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:16,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1599993153, now seen corresponding path program 1 times [2019-01-11 21:17:16,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:16,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:16,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:16,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:16,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:17,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:17,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:17,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:17,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:17,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:17:17,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2019-01-11 21:17:17,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 21:17:17,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 21:17:17,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:17:17,494 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand 7 states. [2019-01-11 21:17:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:17,678 INFO L93 Difference]: Finished difference Result 139 states and 178 transitions. [2019-01-11 21:17:17,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 21:17:17,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-11 21:17:17,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:17,683 INFO L225 Difference]: With dead ends: 139 [2019-01-11 21:17:17,683 INFO L226 Difference]: Without dead ends: 93 [2019-01-11 21:17:17,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 21:17:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-11 21:17:17,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 67. [2019-01-11 21:17:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-11 21:17:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2019-01-11 21:17:17,695 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 41 [2019-01-11 21:17:17,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:17,695 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2019-01-11 21:17:17,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 21:17:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2019-01-11 21:17:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-11 21:17:17,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:17,698 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-11 21:17:17,699 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:17,699 INFO L82 PathProgramCache]: Analyzing trace with hash 639640994, now seen corresponding path program 1 times [2019-01-11 21:17:17,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:17,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:17,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:17,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:17,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-11 21:17:18,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:18,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-11 21:17:18,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 21:17:18,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 21:17:18,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:17:18,120 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand 7 states. [2019-01-11 21:17:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:18,305 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2019-01-11 21:17:18,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 21:17:18,306 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-01-11 21:17:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:18,307 INFO L225 Difference]: With dead ends: 96 [2019-01-11 21:17:18,307 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 21:17:18,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-01-11 21:17:18,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 21:17:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2019-01-11 21:17:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-11 21:17:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2019-01-11 21:17:18,312 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 43 [2019-01-11 21:17:18,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:18,312 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-01-11 21:17:18,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 21:17:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2019-01-11 21:17:18,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-11 21:17:18,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:18,313 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-11 21:17:18,314 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:18,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:18,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2053101997, now seen corresponding path program 1 times [2019-01-11 21:17:18,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:18,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:18,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:18,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:18,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:18,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:18,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:18,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:18,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-11 21:17:18,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:17:18,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2019-01-11 21:17:18,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 21:17:18,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 21:17:18,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-01-11 21:17:18,803 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand 13 states. [2019-01-11 21:17:19,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:19,396 INFO L93 Difference]: Finished difference Result 141 states and 178 transitions. [2019-01-11 21:17:19,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-11 21:17:19,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-01-11 21:17:19,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:19,398 INFO L225 Difference]: With dead ends: 141 [2019-01-11 21:17:19,398 INFO L226 Difference]: Without dead ends: 74 [2019-01-11 21:17:19,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-01-11 21:17:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-11 21:17:19,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2019-01-11 21:17:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-11 21:17:19,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2019-01-11 21:17:19,406 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 47 [2019-01-11 21:17:19,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:19,407 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-01-11 21:17:19,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 21:17:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2019-01-11 21:17:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-11 21:17:19,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:19,410 INFO L402 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1] [2019-01-11 21:17:19,410 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:19,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:19,410 INFO L82 PathProgramCache]: Analyzing trace with hash 14146971, now seen corresponding path program 1 times [2019-01-11 21:17:19,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:19,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:19,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:19,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:19,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:19,790 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:19,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:19,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:19,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:17:19,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2019-01-11 21:17:19,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 21:17:19,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 21:17:19,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-11 21:17:19,878 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 8 states. [2019-01-11 21:17:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:19,980 INFO L93 Difference]: Finished difference Result 142 states and 173 transitions. [2019-01-11 21:17:19,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 21:17:19,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-01-11 21:17:19,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:19,982 INFO L225 Difference]: With dead ends: 142 [2019-01-11 21:17:19,982 INFO L226 Difference]: Without dead ends: 96 [2019-01-11 21:17:19,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 21:17:19,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-11 21:17:19,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 70. [2019-01-11 21:17:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-11 21:17:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2019-01-11 21:17:19,989 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 52 [2019-01-11 21:17:19,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:19,989 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2019-01-11 21:17:19,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 21:17:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2019-01-11 21:17:19,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-11 21:17:19,990 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:19,990 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:19,991 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:19,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:19,991 INFO L82 PathProgramCache]: Analyzing trace with hash -36498052, now seen corresponding path program 1 times [2019-01-11 21:17:19,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:19,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:19,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:20,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:20,165 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 [2019-01-11 21:17:20,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:20,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-11 21:17:20,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:17:20,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2019-01-11 21:17:20,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-11 21:17:20,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-11 21:17:20,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-01-11 21:17:20,440 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 15 states. [2019-01-11 21:17:21,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:21,640 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2019-01-11 21:17:21,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-11 21:17:21,641 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-01-11 21:17:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:21,641 INFO L225 Difference]: With dead ends: 109 [2019-01-11 21:17:21,641 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:17:21,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2019-01-11 21:17:21,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:17:21,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:17:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:17:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:17:21,643 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2019-01-11 21:17:21,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:21,644 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:17:21,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-11 21:17:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:17:21,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:17:21,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:17:21,950 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2019-01-11 21:17:21,951 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2019-01-11 21:17:21,951 INFO L448 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2019-01-11 21:17:21,951 INFO L448 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2019-01-11 21:17:21,951 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2019-01-11 21:17:21,951 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2019-01-11 21:17:21,952 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 24) no Hoare annotation was computed. [2019-01-11 21:17:21,952 INFO L448 ceAbstractionStarter]: For program point L19-3(lines 19 24) no Hoare annotation was computed. [2019-01-11 21:17:21,952 INFO L444 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (and (<= 0 ULTIMATE.start_base2flt_~e) (= ULTIMATE.start_base2flt_~__retres4~0 0) (= ULTIMATE.start_base2flt_~m 0)) [2019-01-11 21:17:21,952 INFO L444 ceAbstractionStarter]: At program point L69-1(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-01-11 21:17:21,952 INFO L444 ceAbstractionStarter]: At program point L69-2(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-01-11 21:17:21,952 INFO L444 ceAbstractionStarter]: At program point L69-3(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-01-11 21:17:21,952 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:17:21,953 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2019-01-11 21:17:21,953 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2019-01-11 21:17:21,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2019-01-11 21:17:21,953 INFO L444 ceAbstractionStarter]: At program point L70(lines 14 72) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_base2flt_#res|) (<= 0 ULTIMATE.start_base2flt_~e) (= ULTIMATE.start_base2flt_~__retres4~0 0) (<= |ULTIMATE.start_base2flt_#res| 0) (= ULTIMATE.start_base2flt_~m 0)) [2019-01-11 21:17:21,953 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-01-11 21:17:21,953 INFO L444 ceAbstractionStarter]: At program point L70-1(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-01-11 21:17:21,953 INFO L444 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: false [2019-01-11 21:17:21,953 INFO L444 ceAbstractionStarter]: At program point L70-2(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-01-11 21:17:21,953 INFO L448 ceAbstractionStarter]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2019-01-11 21:17:21,954 INFO L444 ceAbstractionStarter]: At program point L70-3(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-01-11 21:17:21,954 INFO L444 ceAbstractionStarter]: At program point L37-3(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-01-11 21:17:21,954 INFO L448 ceAbstractionStarter]: For program point L37-4(lines 37 41) no Hoare annotation was computed. [2019-01-11 21:17:21,954 INFO L444 ceAbstractionStarter]: At program point L37-5(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-01-11 21:17:21,954 INFO L448 ceAbstractionStarter]: For program point L37-6(lines 37 41) no Hoare annotation was computed. [2019-01-11 21:17:21,954 INFO L444 ceAbstractionStarter]: At program point L37-7(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-01-11 21:17:21,954 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2019-01-11 21:17:21,954 INFO L448 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2019-01-11 21:17:21,954 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2019-01-11 21:17:21,954 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2019-01-11 21:17:21,955 INFO L444 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (or (and (<= 1 ULTIMATE.start_main_~tmp~2) (<= 1 ULTIMATE.start_main_~sa~0)) (and (= 0 ULTIMATE.start_mulflt_~__retres10~1) (= 0 ULTIMATE.start_main_~zero~0)) (<= (+ ULTIMATE.start_main_~sa~0 1) 0)) [2019-01-11 21:17:21,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:17:21,955 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2019-01-11 21:17:21,955 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 25 65) no Hoare annotation was computed. [2019-01-11 21:17:21,955 INFO L448 ceAbstractionStarter]: For program point L25-2(lines 25 65) no Hoare annotation was computed. [2019-01-11 21:17:21,955 INFO L448 ceAbstractionStarter]: For program point L25-3(lines 25 65) no Hoare annotation was computed. [2019-01-11 21:17:21,955 INFO L444 ceAbstractionStarter]: At program point L207(lines 137 209) the Hoare annotation is: (or (and (= 0 ULTIMATE.start_mulflt_~__retres10~1) (= 0 |ULTIMATE.start_mulflt_#res|) (= 0 ULTIMATE.start_main_~zero~0)) (and (<= 1 ULTIMATE.start_main_~tmp~2) (<= 1 ULTIMATE.start_main_~sa~0)) (<= (+ ULTIMATE.start_main_~sa~0 1) 0)) [2019-01-11 21:17:21,955 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2019-01-11 21:17:21,955 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2019-01-11 21:17:21,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:17:21,956 INFO L448 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2019-01-11 21:17:21,956 INFO L448 ceAbstractionStarter]: For program point L28-1(lines 27 42) no Hoare annotation was computed. [2019-01-11 21:17:21,956 INFO L448 ceAbstractionStarter]: For program point L28-2(lines 27 42) no Hoare annotation was computed. [2019-01-11 21:17:21,956 INFO L448 ceAbstractionStarter]: For program point L28-3(lines 27 42) no Hoare annotation was computed. [2019-01-11 21:17:21,956 INFO L444 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: false [2019-01-11 21:17:21,956 INFO L444 ceAbstractionStarter]: At program point L63-1(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-01-11 21:17:21,956 INFO L444 ceAbstractionStarter]: At program point L63-2(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-01-11 21:17:21,956 INFO L444 ceAbstractionStarter]: At program point L63-3(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-01-11 21:17:21,956 INFO L444 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: false [2019-01-11 21:17:21,957 INFO L444 ceAbstractionStarter]: At program point L47-5(lines 47 62) the Hoare annotation is: false [2019-01-11 21:17:21,957 INFO L444 ceAbstractionStarter]: At program point L47-8(lines 47 62) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-01-11 21:17:21,957 INFO L444 ceAbstractionStarter]: At program point L47-11(lines 47 62) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-01-11 21:17:21,957 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2019-01-11 21:17:21,957 INFO L451 ceAbstractionStarter]: At program point L246-1(lines 246 262) the Hoare annotation is: true [2019-01-11 21:17:21,957 INFO L448 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2019-01-11 21:17:21,957 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 47 62) no Hoare annotation was computed. [2019-01-11 21:17:21,957 INFO L448 ceAbstractionStarter]: For program point L48-2(lines 47 62) no Hoare annotation was computed. [2019-01-11 21:17:21,957 INFO L448 ceAbstractionStarter]: For program point L48-3(lines 47 62) no Hoare annotation was computed. [2019-01-11 21:17:21,957 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2019-01-11 21:17:21,958 INFO L448 ceAbstractionStarter]: For program point L247-2(lines 247 256) no Hoare annotation was computed. [2019-01-11 21:17:21,958 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2019-01-11 21:17:21,958 INFO L448 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2019-01-11 21:17:21,958 INFO L448 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2019-01-11 21:17:21,958 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 47 62) no Hoare annotation was computed. [2019-01-11 21:17:21,958 INFO L448 ceAbstractionStarter]: For program point L49-2(lines 47 62) no Hoare annotation was computed. [2019-01-11 21:17:21,958 INFO L448 ceAbstractionStarter]: For program point L49-3(lines 47 62) no Hoare annotation was computed. [2019-01-11 21:17:21,958 INFO L451 ceAbstractionStarter]: At program point L264(lines 210 266) the Hoare annotation is: true [2019-01-11 21:17:21,958 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2019-01-11 21:17:21,958 INFO L448 ceAbstractionStarter]: For program point L233-2(lines 233 242) no Hoare annotation was computed. [2019-01-11 21:17:21,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:17:21 BoogieIcfgContainer [2019-01-11 21:17:21,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:17:21,977 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:17:21,977 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:17:21,977 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:17:21,977 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:17:11" (3/4) ... [2019-01-11 21:17:21,981 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:17:21,995 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-11 21:17:21,996 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-11 21:17:22,029 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 <= \result && 0 <= e) && __retres4 == 0) && \result <= 0) && m == 0 [2019-01-11 21:17:22,033 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == __retres10 && 0 == \result) && 0 == zero) || (1 <= tmp && 1 <= sa)) || sa + 1 <= 0 [2019-01-11 21:17:22,100 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:17:22,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:17:22,101 INFO L168 Benchmark]: Toolchain (without parser) took 12281.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 268.4 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -272.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:17:22,102 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:17:22,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.12 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:22,103 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -210.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:22,104 INFO L168 Benchmark]: Boogie Preprocessor took 34.29 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:22,104 INFO L168 Benchmark]: RCFGBuilder took 824.76 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: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:22,104 INFO L168 Benchmark]: TraceAbstraction took 10766.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 122.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -127.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:17:22,105 INFO L168 Benchmark]: Witness Printer took 123.60 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:22,109 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.12 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 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 122.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -210.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.29 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 824.76 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: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10766.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 122.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -127.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 123.60 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. * 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: 137]: Loop Invariant Derived loop invariant: (((0 == __retres10 && 0 == \result) && 0 == zero) || (1 <= tmp && 1 <= sa)) || sa + 1 <= 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (0 <= e && __retres4 == 0) && m == 0 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((0 <= \result && 0 <= e) && __retres4 == 0) && \result <= 0) && m == 0 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((1 <= tmp && 1 <= sa) || (0 == __retres10 && 0 == zero)) || sa + 1 <= 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 == zero - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 1 error locations. SAFE Result, 10.6s OverallTime, 16 OverallIterations, 5 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1314 SDtfs, 548 SDslu, 3592 SDs, 0 SdLazy, 1830 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 467 GetRequests, 342 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 196 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 69 NumberOfFragments, 117 HoareAnnotationTreeSize, 24 FomulaSimplifications, 4889 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 71 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 921 NumberOfCodeBlocks, 921 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 897 ConstructedInterpolants, 1 QuantifiedInterpolants, 77783 SizeOfPredicates, 34 NumberOfNonLiveVariables, 1127 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 93/253 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...