./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/s3_srvr_3_true-unreach-call_true-no-overflow.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/bitvector/s3_srvr_3_true-unreach-call_true-no-overflow.BV.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 cfc4572bc150d8d2f9b1a5737590a88a31fdad6b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:02:17,775 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:02:17,777 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:02:17,789 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:02:17,790 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:02:17,791 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:02:17,792 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:02:17,795 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:02:17,797 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:02:17,797 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:02:17,799 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:02:17,799 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:02:17,800 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:02:17,801 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:02:17,802 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:02:17,803 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:02:17,804 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:02:17,806 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:02:17,808 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:02:17,810 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:02:17,811 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:02:17,812 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:02:17,815 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:02:17,816 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:02:17,816 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:02:17,817 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:02:17,818 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:02:17,819 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:02:17,820 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:02:17,821 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:02:17,821 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:02:17,823 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:02:17,823 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:02:17,823 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:02:17,824 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:02:17,825 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:02:17,826 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:02:17,842 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:02:17,842 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:02:17,843 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:02:17,844 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:02:17,844 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:02:17,844 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:02:17,844 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:02:17,844 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:02:17,845 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:02:17,845 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:02:17,845 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:02:17,845 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:02:17,845 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:02:17,845 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:02:17,846 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:02:17,846 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:02:17,846 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:02:17,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:02:17,846 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:02:17,848 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:02:17,848 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:02:17,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:02:17,849 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:02:17,849 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:02:17,849 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:02:17,849 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:02:17,849 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:02:17,851 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:02:17,851 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 -> cfc4572bc150d8d2f9b1a5737590a88a31fdad6b [2018-12-30 16:02:17,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:02:17,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:02:17,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:02:17,931 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:02:17,931 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:02:17,933 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/s3_srvr_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-30 16:02:17,994 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cb3f165d/b42c2c3cfb40424ab8d0fb939c66e551/FLAG7ca05d435 [2018-12-30 16:02:18,491 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:02:18,492 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/s3_srvr_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-30 16:02:18,514 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cb3f165d/b42c2c3cfb40424ab8d0fb939c66e551/FLAG7ca05d435 [2018-12-30 16:02:18,802 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cb3f165d/b42c2c3cfb40424ab8d0fb939c66e551 [2018-12-30 16:02:18,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:02:18,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:02:18,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:02:18,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:02:18,814 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:02:18,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:02:18" (1/1) ... [2018-12-30 16:02:18,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23d661de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:18, skipping insertion in model container [2018-12-30 16:02:18,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:02:18" (1/1) ... [2018-12-30 16:02:18,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:02:18,874 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:02:19,145 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:02:19,149 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:02:19,236 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:02:19,259 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:02:19,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:19 WrapperNode [2018-12-30 16:02:19,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:02:19,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:02:19,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:02:19,262 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:02:19,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:19" (1/1) ... [2018-12-30 16:02:19,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:19" (1/1) ... [2018-12-30 16:02:19,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:02:19,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:02:19,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:02:19,430 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:02:19,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:19" (1/1) ... [2018-12-30 16:02:19,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:19" (1/1) ... [2018-12-30 16:02:19,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:19" (1/1) ... [2018-12-30 16:02:19,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:19" (1/1) ... [2018-12-30 16:02:19,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:19" (1/1) ... [2018-12-30 16:02:19,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:19" (1/1) ... [2018-12-30 16:02:19,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:19" (1/1) ... [2018-12-30 16:02:19,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:02:19,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:02:19,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:02:19,490 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:02:19,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:02:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:02:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:02:19,703 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:02:19,706 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:02:20,715 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:02:20,716 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 16:02:20,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:02:20 BoogieIcfgContainer [2018-12-30 16:02:20,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:02:20,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:02:20,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:02:20,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:02:20,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:02:18" (1/3) ... [2018-12-30 16:02:20,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7232f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:02:20, skipping insertion in model container [2018-12-30 16:02:20,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:19" (2/3) ... [2018-12-30 16:02:20,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7232f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:02:20, skipping insertion in model container [2018-12-30 16:02:20,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:02:20" (3/3) ... [2018-12-30 16:02:20,725 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-30 16:02:20,734 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:02:20,742 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:02:20,758 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:02:20,789 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:02:20,790 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:02:20,790 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:02:20,790 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:02:20,791 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:02:20,791 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:02:20,791 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:02:20,791 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:02:20,792 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:02:20,809 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-12-30 16:02:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-30 16:02:20,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:20,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:20,823 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:20,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:20,829 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2018-12-30 16:02:20,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:20,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:20,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:20,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:20,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:21,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:21,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:21,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:02:21,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:21,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:21,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:21,094 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2018-12-30 16:02:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:22,198 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2018-12-30 16:02:22,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:22,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-30 16:02:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:22,214 INFO L225 Difference]: With dead ends: 322 [2018-12-30 16:02:22,214 INFO L226 Difference]: Without dead ends: 170 [2018-12-30 16:02:22,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-30 16:02:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2018-12-30 16:02:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-30 16:02:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2018-12-30 16:02:22,271 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2018-12-30 16:02:22,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:22,272 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2018-12-30 16:02:22,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2018-12-30 16:02:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-30 16:02:22,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:22,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:22,276 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:22,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:22,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2018-12-30 16:02:22,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:22,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:22,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:22,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:22,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:22,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:22,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:02:22,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:22,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:22,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:22,407 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2018-12-30 16:02:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:22,796 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2018-12-30 16:02:22,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:22,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-30 16:02:22,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:22,802 INFO L225 Difference]: With dead ends: 371 [2018-12-30 16:02:22,802 INFO L226 Difference]: Without dead ends: 211 [2018-12-30 16:02:22,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-30 16:02:22,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2018-12-30 16:02:22,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-30 16:02:22,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2018-12-30 16:02:22,823 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2018-12-30 16:02:22,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:22,824 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2018-12-30 16:02:22,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:22,824 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2018-12-30 16:02:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-30 16:02:22,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:22,827 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:22,828 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:22,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:22,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2018-12-30 16:02:22,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:22,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:22,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:22,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:22,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:22,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:22,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:02:22,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:22,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:22,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:22,938 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2018-12-30 16:02:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:23,320 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2018-12-30 16:02:23,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:23,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-12-30 16:02:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:23,324 INFO L225 Difference]: With dead ends: 436 [2018-12-30 16:02:23,324 INFO L226 Difference]: Without dead ends: 237 [2018-12-30 16:02:23,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:23,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-12-30 16:02:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-12-30 16:02:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-30 16:02:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2018-12-30 16:02:23,358 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2018-12-30 16:02:23,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:23,358 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2018-12-30 16:02:23,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2018-12-30 16:02:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-30 16:02:23,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:23,364 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:23,364 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:23,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:23,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2018-12-30 16:02:23,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:23,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:23,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:23,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:02:23,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:23,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:02:23,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:23,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:23,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:23,466 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2018-12-30 16:02:23,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:23,758 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2018-12-30 16:02:23,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:23,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-30 16:02:23,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:23,761 INFO L225 Difference]: With dead ends: 484 [2018-12-30 16:02:23,761 INFO L226 Difference]: Without dead ends: 254 [2018-12-30 16:02:23,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:23,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-30 16:02:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2018-12-30 16:02:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-12-30 16:02:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2018-12-30 16:02:23,777 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2018-12-30 16:02:23,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:23,777 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2018-12-30 16:02:23,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2018-12-30 16:02:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-30 16:02:23,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:23,781 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:23,781 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:23,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:23,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2018-12-30 16:02:23,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:23,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:23,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:23,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:23,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:23,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:23,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:02:23,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:23,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:23,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:23,892 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2018-12-30 16:02:24,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:24,159 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2018-12-30 16:02:24,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:24,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-30 16:02:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:24,164 INFO L225 Difference]: With dead ends: 543 [2018-12-30 16:02:24,165 INFO L226 Difference]: Without dead ends: 298 [2018-12-30 16:02:24,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-12-30 16:02:24,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2018-12-30 16:02:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-30 16:02:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2018-12-30 16:02:24,182 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2018-12-30 16:02:24,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:24,183 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2018-12-30 16:02:24,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2018-12-30 16:02:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-30 16:02:24,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:24,189 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:24,189 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:24,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:24,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2018-12-30 16:02:24,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:24,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:24,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:24,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:24,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:02:24,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:24,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:02:24,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:24,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:24,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:24,276 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2018-12-30 16:02:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:24,610 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2018-12-30 16:02:24,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:24,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-30 16:02:24,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:24,613 INFO L225 Difference]: With dead ends: 583 [2018-12-30 16:02:24,613 INFO L226 Difference]: Without dead ends: 296 [2018-12-30 16:02:24,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-12-30 16:02:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2018-12-30 16:02:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-30 16:02:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2018-12-30 16:02:24,632 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2018-12-30 16:02:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:24,632 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2018-12-30 16:02:24,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2018-12-30 16:02:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-30 16:02:24,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:24,634 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:24,635 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:24,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:24,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2018-12-30 16:02:24,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:24,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:24,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:24,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:24,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:24,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:24,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:02:24,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:24,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:24,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:24,703 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2018-12-30 16:02:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:25,807 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2018-12-30 16:02:25,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:25,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-30 16:02:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:25,811 INFO L225 Difference]: With dead ends: 585 [2018-12-30 16:02:25,811 INFO L226 Difference]: Without dead ends: 296 [2018-12-30 16:02:25,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-12-30 16:02:25,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2018-12-30 16:02:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-12-30 16:02:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2018-12-30 16:02:25,833 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2018-12-30 16:02:25,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:25,833 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2018-12-30 16:02:25,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2018-12-30 16:02:25,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-30 16:02:25,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:25,835 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:25,835 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:25,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:25,835 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2018-12-30 16:02:25,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:25,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:25,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:25,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:25,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-30 16:02:25,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:25,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:02:25,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:25,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:25,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:25,932 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2018-12-30 16:02:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:26,279 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2018-12-30 16:02:26,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:26,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-12-30 16:02:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:26,281 INFO L225 Difference]: With dead ends: 585 [2018-12-30 16:02:26,281 INFO L226 Difference]: Without dead ends: 300 [2018-12-30 16:02:26,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-30 16:02:26,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2018-12-30 16:02:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-30 16:02:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2018-12-30 16:02:26,292 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2018-12-30 16:02:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:26,293 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2018-12-30 16:02:26,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:26,293 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2018-12-30 16:02:26,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-30 16:02:26,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:26,294 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:26,294 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:26,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:26,295 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2018-12-30 16:02:26,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:26,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:26,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:26,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:26,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:02:26,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:26,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:02:26,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:26,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:26,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:26,386 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2018-12-30 16:02:26,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:26,871 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2018-12-30 16:02:26,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:26,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-12-30 16:02:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:26,874 INFO L225 Difference]: With dead ends: 624 [2018-12-30 16:02:26,874 INFO L226 Difference]: Without dead ends: 331 [2018-12-30 16:02:26,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-30 16:02:26,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2018-12-30 16:02:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-12-30 16:02:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2018-12-30 16:02:26,886 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2018-12-30 16:02:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:26,887 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2018-12-30 16:02:26,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2018-12-30 16:02:26,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-30 16:02:26,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:26,888 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:26,888 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:26,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:26,889 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2018-12-30 16:02:26,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:26,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:26,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:26,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:26,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:02:26,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:26,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:02:26,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:26,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:26,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:26,974 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2018-12-30 16:02:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:27,479 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2018-12-30 16:02:27,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:27,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-30 16:02:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:27,483 INFO L225 Difference]: With dead ends: 685 [2018-12-30 16:02:27,483 INFO L226 Difference]: Without dead ends: 363 [2018-12-30 16:02:27,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:27,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-12-30 16:02:27,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2018-12-30 16:02:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-30 16:02:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2018-12-30 16:02:27,496 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2018-12-30 16:02:27,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:27,500 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2018-12-30 16:02:27,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:27,500 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2018-12-30 16:02:27,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-30 16:02:27,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:27,502 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:27,503 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:27,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:27,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2018-12-30 16:02:27,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:27,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:27,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:27,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:27,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:02:27,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:27,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:02:27,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:27,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:27,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:27,581 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2018-12-30 16:02:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:28,506 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2018-12-30 16:02:28,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:28,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-30 16:02:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:28,509 INFO L225 Difference]: With dead ends: 707 [2018-12-30 16:02:28,509 INFO L226 Difference]: Without dead ends: 358 [2018-12-30 16:02:28,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:28,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-12-30 16:02:28,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-12-30 16:02:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-30 16:02:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2018-12-30 16:02:28,522 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2018-12-30 16:02:28,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:28,522 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2018-12-30 16:02:28,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2018-12-30 16:02:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-30 16:02:28,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:28,524 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:28,524 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:28,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:28,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2018-12-30 16:02:28,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:28,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:28,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:28,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:28,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:02:28,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:28,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:02:28,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:28,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:28,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:28,606 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2018-12-30 16:02:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:28,855 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2018-12-30 16:02:28,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:28,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-30 16:02:28,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:28,859 INFO L225 Difference]: With dead ends: 712 [2018-12-30 16:02:28,860 INFO L226 Difference]: Without dead ends: 363 [2018-12-30 16:02:28,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-12-30 16:02:28,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2018-12-30 16:02:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-30 16:02:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2018-12-30 16:02:28,872 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2018-12-30 16:02:28,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:28,873 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2018-12-30 16:02:28,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2018-12-30 16:02:28,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-30 16:02:28,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:28,874 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:28,875 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:28,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:28,875 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2018-12-30 16:02:28,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:28,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:28,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:28,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:28,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 16:02:28,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:28,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:02:28,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:28,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:28,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:28,959 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2018-12-30 16:02:29,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:29,580 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2018-12-30 16:02:29,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:29,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-30 16:02:29,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:29,583 INFO L225 Difference]: With dead ends: 730 [2018-12-30 16:02:29,583 INFO L226 Difference]: Without dead ends: 381 [2018-12-30 16:02:29,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-12-30 16:02:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2018-12-30 16:02:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-12-30 16:02:29,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2018-12-30 16:02:29,599 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2018-12-30 16:02:29,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:29,600 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2018-12-30 16:02:29,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:29,600 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2018-12-30 16:02:29,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-30 16:02:29,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:29,602 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:29,602 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:29,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:29,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2018-12-30 16:02:29,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:29,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:29,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:29,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:29,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 16:02:29,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:29,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:02:29,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:29,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:29,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:29,699 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2018-12-30 16:02:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:30,377 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2018-12-30 16:02:30,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:30,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-12-30 16:02:30,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:30,380 INFO L225 Difference]: With dead ends: 751 [2018-12-30 16:02:30,380 INFO L226 Difference]: Without dead ends: 381 [2018-12-30 16:02:30,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:30,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-12-30 16:02:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2018-12-30 16:02:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-12-30 16:02:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2018-12-30 16:02:30,395 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2018-12-30 16:02:30,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:30,396 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2018-12-30 16:02:30,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2018-12-30 16:02:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-30 16:02:30,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:30,398 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:30,398 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:30,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:30,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2018-12-30 16:02:30,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:30,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:30,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:30,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:30,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-30 16:02:30,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:30,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:30,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:30,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:30,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:30,517 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2018-12-30 16:02:30,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:30,728 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2018-12-30 16:02:30,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:30,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-12-30 16:02:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:30,732 INFO L225 Difference]: With dead ends: 747 [2018-12-30 16:02:30,732 INFO L226 Difference]: Without dead ends: 745 [2018-12-30 16:02:30,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:30,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-12-30 16:02:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2018-12-30 16:02:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-12-30 16:02:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2018-12-30 16:02:30,755 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2018-12-30 16:02:30,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:30,756 INFO L480 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2018-12-30 16:02:30,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2018-12-30 16:02:30,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-30 16:02:30,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:30,758 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:30,758 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:30,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:30,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2018-12-30 16:02:30,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:30,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:30,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:30,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:30,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:30,767 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 16:02:30,767 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 16:02:30,767 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-30 16:02:30,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:30,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:30,885 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 16:02:30,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:30,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:02:30,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:30,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:30,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:30,915 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2018-12-30 16:02:31,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:31,180 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2018-12-30 16:02:31,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:31,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-12-30 16:02:31,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:31,187 INFO L225 Difference]: With dead ends: 1851 [2018-12-30 16:02:31,187 INFO L226 Difference]: Without dead ends: 1113 [2018-12-30 16:02:31,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:31,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-12-30 16:02:31,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2018-12-30 16:02:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2018-12-30 16:02:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2018-12-30 16:02:31,228 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2018-12-30 16:02:31,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:31,228 INFO L480 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2018-12-30 16:02:31,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:31,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2018-12-30 16:02:31,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-30 16:02:31,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:31,232 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:31,233 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:31,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:31,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2018-12-30 16:02:31,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:31,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:31,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:31,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:31,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:31,245 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 16:02:31,246 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 16:02:31,246 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-30 16:02:31,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:31,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 16:02:31,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:31,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:31,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:31,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:31,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:31,437 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2018-12-30 16:02:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:31,707 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2018-12-30 16:02:31,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:31,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-12-30 16:02:31,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:31,714 INFO L225 Difference]: With dead ends: 2219 [2018-12-30 16:02:31,714 INFO L226 Difference]: Without dead ends: 1481 [2018-12-30 16:02:31,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:31,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2018-12-30 16:02:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2018-12-30 16:02:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-12-30 16:02:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2018-12-30 16:02:31,762 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2018-12-30 16:02:31,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:31,762 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2018-12-30 16:02:31,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2018-12-30 16:02:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-30 16:02:31,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:31,766 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:31,767 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:31,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:31,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2018-12-30 16:02:31,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:31,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:31,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:31,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:31,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:31,875 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-12-30 16:02:31,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:31,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:31,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:31,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:31,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:31,876 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2018-12-30 16:02:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:33,454 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2018-12-30 16:02:33,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:33,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2018-12-30 16:02:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:33,461 INFO L225 Difference]: With dead ends: 3059 [2018-12-30 16:02:33,461 INFO L226 Difference]: Without dead ends: 1585 [2018-12-30 16:02:33,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:33,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2018-12-30 16:02:33,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2018-12-30 16:02:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-12-30 16:02:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2018-12-30 16:02:33,510 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2018-12-30 16:02:33,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:33,510 INFO L480 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2018-12-30 16:02:33,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:33,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2018-12-30 16:02:33,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-30 16:02:33,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:33,514 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:33,515 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:33,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:33,515 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2018-12-30 16:02:33,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:33,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:33,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:33,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:33,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:33,525 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 16:02:33,526 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 16:02:33,526 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-30 16:02:33,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:33,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-30 16:02:33,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:33,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:33,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:33,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:33,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:33,703 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2018-12-30 16:02:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:34,004 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2018-12-30 16:02:34,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:34,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2018-12-30 16:02:34,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:34,014 INFO L225 Difference]: With dead ends: 3139 [2018-12-30 16:02:34,014 INFO L226 Difference]: Without dead ends: 1964 [2018-12-30 16:02:34,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:34,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2018-12-30 16:02:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2018-12-30 16:02:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2018-12-30 16:02:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2018-12-30 16:02:34,076 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2018-12-30 16:02:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:34,076 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2018-12-30 16:02:34,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2018-12-30 16:02:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-30 16:02:34,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:34,084 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:34,084 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:34,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:34,084 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2018-12-30 16:02:34,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:34,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:34,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:34,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:34,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:34,097 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 16:02:34,097 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 16:02:34,097 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-30 16:02:34,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:34,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-12-30 16:02:34,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:34,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:34,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:34,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:34,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:34,309 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2018-12-30 16:02:34,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:34,550 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2018-12-30 16:02:34,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:34,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2018-12-30 16:02:34,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:34,568 INFO L225 Difference]: With dead ends: 5743 [2018-12-30 16:02:34,568 INFO L226 Difference]: Without dead ends: 3786 [2018-12-30 16:02:34,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2018-12-30 16:02:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2018-12-30 16:02:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-12-30 16:02:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2018-12-30 16:02:34,683 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2018-12-30 16:02:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:34,683 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2018-12-30 16:02:34,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2018-12-30 16:02:34,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-12-30 16:02:34,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:34,695 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:34,695 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:34,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:34,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2018-12-30 16:02:34,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:34,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:34,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:34,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:34,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:34,709 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 16:02:34,709 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 16:02:34,709 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-30 16:02:34,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:34,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-30 16:02:34,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:34,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:34,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:34,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:34,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:34,898 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2018-12-30 16:02:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:35,728 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2018-12-30 16:02:35,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:35,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-12-30 16:02:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:35,751 INFO L225 Difference]: With dead ends: 7651 [2018-12-30 16:02:35,751 INFO L226 Difference]: Without dead ends: 3874 [2018-12-30 16:02:35,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2018-12-30 16:02:35,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2018-12-30 16:02:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-12-30 16:02:35,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2018-12-30 16:02:35,863 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2018-12-30 16:02:35,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:35,863 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2018-12-30 16:02:35,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2018-12-30 16:02:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-12-30 16:02:35,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:35,875 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:35,875 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:35,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:35,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2018-12-30 16:02:35,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:35,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:35,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:35,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:35,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2018-12-30 16:02:35,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:35,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:35,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:35,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:35,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:35,981 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2018-12-30 16:02:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:36,430 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2018-12-30 16:02:36,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:36,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2018-12-30 16:02:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:36,447 INFO L225 Difference]: With dead ends: 7683 [2018-12-30 16:02:36,447 INFO L226 Difference]: Without dead ends: 3906 [2018-12-30 16:02:36,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2018-12-30 16:02:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2018-12-30 16:02:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-12-30 16:02:36,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2018-12-30 16:02:36,597 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2018-12-30 16:02:36,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:36,598 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2018-12-30 16:02:36,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:36,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2018-12-30 16:02:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-12-30 16:02:36,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:36,610 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:36,610 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:36,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:36,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2018-12-30 16:02:36,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:36,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:36,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:36,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:36,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:36,631 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 16:02:36,631 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 16:02:36,631 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-30 16:02:36,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:36,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-30 16:02:36,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:36,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:36,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:36,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:36,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:36,804 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2018-12-30 16:02:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:37,166 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2018-12-30 16:02:37,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:37,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2018-12-30 16:02:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:37,185 INFO L225 Difference]: With dead ends: 7561 [2018-12-30 16:02:37,185 INFO L226 Difference]: Without dead ends: 3784 [2018-12-30 16:02:37,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:37,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2018-12-30 16:02:37,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2018-12-30 16:02:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-12-30 16:02:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2018-12-30 16:02:37,290 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2018-12-30 16:02:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:37,291 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2018-12-30 16:02:37,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2018-12-30 16:02:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-12-30 16:02:37,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:37,300 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:37,300 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:37,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:37,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2018-12-30 16:02:37,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:37,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:37,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:37,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:37,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:37,316 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 16:02:37,316 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 16:02:37,316 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-30 16:02:37,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:37,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-12-30 16:02:37,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:37,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:37,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:37,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:37,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:37,472 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2018-12-30 16:02:37,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:37,760 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2018-12-30 16:02:37,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:37,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2018-12-30 16:02:37,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:37,768 INFO L225 Difference]: With dead ends: 7951 [2018-12-30 16:02:37,769 INFO L226 Difference]: Without dead ends: 2307 [2018-12-30 16:02:37,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:37,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2018-12-30 16:02:37,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2018-12-30 16:02:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2018-12-30 16:02:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2018-12-30 16:02:37,849 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2018-12-30 16:02:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:37,849 INFO L480 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2018-12-30 16:02:37,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2018-12-30 16:02:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-12-30 16:02:37,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:37,857 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:37,859 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:37,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2018-12-30 16:02:37,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:37,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:37,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:37,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:37,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-30 16:02:38,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:38,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:38,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:38,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:38,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:38,075 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2018-12-30 16:02:39,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:39,628 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2018-12-30 16:02:39,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:39,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2018-12-30 16:02:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:39,636 INFO L225 Difference]: With dead ends: 4829 [2018-12-30 16:02:39,636 INFO L226 Difference]: Without dead ends: 2529 [2018-12-30 16:02:39,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2018-12-30 16:02:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2018-12-30 16:02:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2018-12-30 16:02:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2018-12-30 16:02:39,699 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2018-12-30 16:02:39,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:39,699 INFO L480 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2018-12-30 16:02:39,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2018-12-30 16:02:39,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-12-30 16:02:39,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:39,706 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:39,707 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:39,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:39,707 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2018-12-30 16:02:39,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:39,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:39,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:39,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:39,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2018-12-30 16:02:39,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:39,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:39,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:39,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:39,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:39,867 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2018-12-30 16:02:40,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:40,344 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2018-12-30 16:02:40,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:40,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2018-12-30 16:02:40,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:40,350 INFO L225 Difference]: With dead ends: 4949 [2018-12-30 16:02:40,350 INFO L226 Difference]: Without dead ends: 2499 [2018-12-30 16:02:40,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:40,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2018-12-30 16:02:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2018-12-30 16:02:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2018-12-30 16:02:40,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2018-12-30 16:02:40,403 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2018-12-30 16:02:40,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:40,404 INFO L480 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2018-12-30 16:02:40,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:40,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2018-12-30 16:02:40,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-12-30 16:02:40,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:40,410 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:40,410 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:40,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:40,410 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2018-12-30 16:02:40,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:40,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:40,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:40,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:40,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:40,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-30 16:02:40,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:02:40,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:02:40,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:40,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-30 16:02:40,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:02:40,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-30 16:02:40,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:02:40,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:02:40,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:02:40,911 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2018-12-30 16:02:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:41,442 INFO L93 Difference]: Finished difference Result 6557 states and 9123 transitions. [2018-12-30 16:02:41,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:02:41,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2018-12-30 16:02:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:41,452 INFO L225 Difference]: With dead ends: 6557 [2018-12-30 16:02:41,452 INFO L226 Difference]: Without dead ends: 3975 [2018-12-30 16:02:41,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:02:41,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2018-12-30 16:02:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 2534. [2018-12-30 16:02:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2018-12-30 16:02:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2018-12-30 16:02:41,530 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2018-12-30 16:02:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:41,530 INFO L480 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2018-12-30 16:02:41,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:02:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2018-12-30 16:02:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-12-30 16:02:41,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:41,537 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:41,537 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:41,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:41,539 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2018-12-30 16:02:41,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:41,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:41,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:41,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:41,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:41,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2018-12-30 16:02:41,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:41,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:41,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:41,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:41,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:41,720 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2018-12-30 16:02:42,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:42,326 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2018-12-30 16:02:42,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:42,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2018-12-30 16:02:42,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:42,333 INFO L225 Difference]: With dead ends: 5073 [2018-12-30 16:02:42,333 INFO L226 Difference]: Without dead ends: 2546 [2018-12-30 16:02:42,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:42,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2018-12-30 16:02:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2018-12-30 16:02:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2018-12-30 16:02:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2018-12-30 16:02:42,424 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2018-12-30 16:02:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:42,425 INFO L480 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2018-12-30 16:02:42,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2018-12-30 16:02:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-12-30 16:02:42,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:42,434 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:42,435 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:42,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:42,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2018-12-30 16:02:42,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:42,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:42,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:42,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:42,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:42,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2018-12-30 16:02:42,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:42,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:42,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:42,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:42,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:42,718 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2018-12-30 16:02:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:43,307 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2018-12-30 16:02:43,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:43,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2018-12-30 16:02:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:43,314 INFO L225 Difference]: With dead ends: 5277 [2018-12-30 16:02:43,314 INFO L226 Difference]: Without dead ends: 2750 [2018-12-30 16:02:43,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2018-12-30 16:02:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2018-12-30 16:02:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2018-12-30 16:02:43,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2018-12-30 16:02:43,392 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2018-12-30 16:02:43,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:43,392 INFO L480 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2018-12-30 16:02:43,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2018-12-30 16:02:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-12-30 16:02:43,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:43,401 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:43,403 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:43,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:43,403 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2018-12-30 16:02:43,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:43,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:43,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:43,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:43,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2018-12-30 16:02:43,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:43,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:43,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:43,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:43,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:43,671 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2018-12-30 16:02:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:44,183 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2018-12-30 16:02:44,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:44,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2018-12-30 16:02:44,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:44,190 INFO L225 Difference]: With dead ends: 5697 [2018-12-30 16:02:44,190 INFO L226 Difference]: Without dead ends: 2966 [2018-12-30 16:02:44,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:44,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2018-12-30 16:02:44,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2018-12-30 16:02:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2018-12-30 16:02:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2018-12-30 16:02:44,315 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2018-12-30 16:02:44,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:44,315 INFO L480 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2018-12-30 16:02:44,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2018-12-30 16:02:44,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2018-12-30 16:02:44,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:44,324 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:44,326 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:44,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:44,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2018-12-30 16:02:44,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:44,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:44,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:44,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:44,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2018-12-30 16:02:44,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:02:44,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:02:44,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:44,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2018-12-30 16:02:45,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:02:45,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-30 16:02:45,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:02:45,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:02:45,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:02:45,060 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2018-12-30 16:02:45,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:45,298 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2018-12-30 16:02:45,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:02:45,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2018-12-30 16:02:45,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:45,301 INFO L225 Difference]: With dead ends: 4704 [2018-12-30 16:02:45,301 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:02:45,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:02:45,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:02:45,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:02:45,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:02:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:02:45,307 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2018-12-30 16:02:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:45,307 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:02:45,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:02:45,308 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:02:45,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:02:45,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:02:45,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,594 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 81 [2018-12-30 16:02:45,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,763 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 81 [2018-12-30 16:02:45,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:45,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:46,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:46,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:02:47,134 WARN L181 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-12-30 16:02:47,416 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-12-30 16:02:47,698 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2018-12-30 16:02:48,341 WARN L181 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 47 [2018-12-30 16:02:48,491 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-12-30 16:02:48,933 WARN L181 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 47 [2018-12-30 16:02:49,131 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-12-30 16:02:49,393 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2018-12-30 16:02:49,552 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-12-30 16:02:49,715 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2018-12-30 16:02:49,880 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2018-12-30 16:02:50,186 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2018-12-30 16:02:50,396 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2018-12-30 16:02:52,013 WARN L181 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-12-30 16:02:52,348 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-12-30 16:02:52,552 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-12-30 16:02:52,737 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-12-30 16:02:52,937 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-12-30 16:02:53,133 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-12-30 16:02:53,136 INFO L448 ceAbstractionStarter]: For program point L465(lines 465 469) no Hoare annotation was computed. [2018-12-30 16:02:53,137 INFO L444 ceAbstractionStarter]: At program point L201(lines 197 591) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) [2018-12-30 16:02:53,137 INFO L444 ceAbstractionStarter]: At program point L102(lines 101 623) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2018-12-30 16:02:53,137 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 503) no Hoare annotation was computed. [2018-12-30 16:02:53,137 INFO L448 ceAbstractionStarter]: For program point L499-2(lines 208 585) no Hoare annotation was computed. [2018-12-30 16:02:53,137 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 241) no Hoare annotation was computed. [2018-12-30 16:02:53,137 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 589) no Hoare annotation was computed. [2018-12-30 16:02:53,138 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 600) no Hoare annotation was computed. [2018-12-30 16:02:53,138 INFO L448 ceAbstractionStarter]: For program point L137(lines 137 611) no Hoare annotation was computed. [2018-12-30 16:02:53,138 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 622) no Hoare annotation was computed. [2018-12-30 16:02:53,138 INFO L444 ceAbstractionStarter]: At program point L204(lines 203 589) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2018-12-30 16:02:53,138 INFO L444 ceAbstractionStarter]: At program point L171(lines 167 601) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-12-30 16:02:53,138 INFO L444 ceAbstractionStarter]: At program point L138(lines 134 612) the Hoare annotation is: (let ((.cse0 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2018-12-30 16:02:53,139 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 80) no Hoare annotation was computed. [2018-12-30 16:02:53,139 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 275) no Hoare annotation was computed. [2018-12-30 16:02:53,139 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 579) no Hoare annotation was computed. [2018-12-30 16:02:53,139 INFO L448 ceAbstractionStarter]: For program point L569-1(lines 569 579) no Hoare annotation was computed. [2018-12-30 16:02:53,139 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2018-12-30 16:02:53,139 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 208 585) no Hoare annotation was computed. [2018-12-30 16:02:53,139 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 599) no Hoare annotation was computed. [2018-12-30 16:02:53,139 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 610) no Hoare annotation was computed. [2018-12-30 16:02:53,139 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 621) no Hoare annotation was computed. [2018-12-30 16:02:53,139 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 438 450) no Hoare annotation was computed. [2018-12-30 16:02:53,139 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 588) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2018-12-30 16:02:53,140 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 79) no Hoare annotation was computed. [2018-12-30 16:02:53,140 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 72 80) no Hoare annotation was computed. [2018-12-30 16:02:53,140 INFO L451 ceAbstractionStarter]: At program point L670(lines 63 672) the Hoare annotation is: true [2018-12-30 16:02:53,140 INFO L448 ceAbstractionStarter]: For program point L637(lines 637 643) no Hoare annotation was computed. [2018-12-30 16:02:53,140 INFO L448 ceAbstractionStarter]: For program point L538(lines 538 543) no Hoare annotation was computed. [2018-12-30 16:02:53,140 INFO L444 ceAbstractionStarter]: At program point L406(lines 397 417) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2018-12-30 16:02:53,140 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 344) no Hoare annotation was computed. [2018-12-30 16:02:53,140 INFO L448 ceAbstractionStarter]: For program point L340-2(lines 208 585) no Hoare annotation was computed. [2018-12-30 16:02:53,141 INFO L451 ceAbstractionStarter]: At program point L671(lines 8 673) the Hoare annotation is: true [2018-12-30 16:02:53,141 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 576) no Hoare annotation was computed. [2018-12-30 16:02:53,141 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 598) no Hoare annotation was computed. [2018-12-30 16:02:53,141 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 609) no Hoare annotation was computed. [2018-12-30 16:02:53,141 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 620) no Hoare annotation was computed. [2018-12-30 16:02:53,141 INFO L448 ceAbstractionStarter]: For program point L441(lines 441 446) no Hoare annotation was computed. [2018-12-30 16:02:53,141 INFO L444 ceAbstractionStarter]: At program point L177(lines 173 599) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-12-30 16:02:53,142 INFO L444 ceAbstractionStarter]: At program point L144(lines 140 610) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2018-12-30 16:02:53,142 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-12-30 16:02:53,142 INFO L444 ceAbstractionStarter]: At program point L211(lines 104 622) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2018-12-30 16:02:53,142 INFO L448 ceAbstractionStarter]: For program point L509(lines 509 513) no Hoare annotation was computed. [2018-12-30 16:02:53,142 INFO L448 ceAbstractionStarter]: For program point L509-2(lines 509 513) no Hoare annotation was computed. [2018-12-30 16:02:53,142 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 597) no Hoare annotation was computed. [2018-12-30 16:02:53,142 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 608) no Hoare annotation was computed. [2018-12-30 16:02:53,142 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 619) no Hoare annotation was computed. [2018-12-30 16:02:53,142 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2018-12-30 16:02:53,143 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 90) no Hoare annotation was computed. [2018-12-30 16:02:53,143 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 63 672) no Hoare annotation was computed. [2018-12-30 16:02:53,143 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 596) no Hoare annotation was computed. [2018-12-30 16:02:53,143 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 607) no Hoare annotation was computed. [2018-12-30 16:02:53,143 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 618) no Hoare annotation was computed. [2018-12-30 16:02:53,143 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 87) no Hoare annotation was computed. [2018-12-30 16:02:53,143 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 379) no Hoare annotation was computed. [2018-12-30 16:02:53,143 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 319) no Hoare annotation was computed. [2018-12-30 16:02:53,143 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 319) no Hoare annotation was computed. [2018-12-30 16:02:53,143 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 220) no Hoare annotation was computed. [2018-12-30 16:02:53,144 INFO L444 ceAbstractionStarter]: At program point L183(lines 179 597) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-12-30 16:02:53,144 INFO L444 ceAbstractionStarter]: At program point L150(lines 146 608) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2018-12-30 16:02:53,144 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 208 585) no Hoare annotation was computed. [2018-12-30 16:02:53,144 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 552) no Hoare annotation was computed. [2018-12-30 16:02:53,144 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:02:53,144 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 595) no Hoare annotation was computed. [2018-12-30 16:02:53,144 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 606) no Hoare annotation was computed. [2018-12-30 16:02:53,144 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 617) no Hoare annotation was computed. [2018-12-30 16:02:53,144 INFO L444 ceAbstractionStarter]: At program point L549(lines 63 672) the Hoare annotation is: false [2018-12-30 16:02:53,145 INFO L448 ceAbstractionStarter]: For program point $Ultimate##90(lines 208 587) no Hoare annotation was computed. [2018-12-30 16:02:53,145 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 378) no Hoare annotation was computed. [2018-12-30 16:02:53,145 INFO L448 ceAbstractionStarter]: For program point L351-1(lines 351 378) no Hoare annotation was computed. [2018-12-30 16:02:53,145 INFO L448 ceAbstractionStarter]: For program point $Ultimate##91(lines 208 587) no Hoare annotation was computed. [2018-12-30 16:02:53,145 INFO L444 ceAbstractionStarter]: At program point L120(lines 116 618) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2018-12-30 16:02:53,145 INFO L448 ceAbstractionStarter]: For program point L352(lines 352 375) no Hoare annotation was computed. [2018-12-30 16:02:53,145 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 265) no Hoare annotation was computed. [2018-12-30 16:02:53,145 INFO L451 ceAbstractionStarter]: At program point L683(lines 674 685) the Hoare annotation is: true [2018-12-30 16:02:53,145 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 259) no Hoare annotation was computed. [2018-12-30 16:02:53,145 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 594) no Hoare annotation was computed. [2018-12-30 16:02:53,145 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 605) no Hoare annotation was computed. [2018-12-30 16:02:53,146 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 616) no Hoare annotation was computed. [2018-12-30 16:02:53,146 INFO L448 ceAbstractionStarter]: For program point L519(lines 519 524) no Hoare annotation was computed. [2018-12-30 16:02:53,146 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 418) no Hoare annotation was computed. [2018-12-30 16:02:53,146 INFO L448 ceAbstractionStarter]: For program point L288(lines 288 292) no Hoare annotation was computed. [2018-12-30 16:02:53,146 INFO L448 ceAbstractionStarter]: For program point L288-2(lines 208 585) no Hoare annotation was computed. [2018-12-30 16:02:53,146 INFO L444 ceAbstractionStarter]: At program point L189(lines 185 595) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-12-30 16:02:53,146 INFO L444 ceAbstractionStarter]: At program point L156(lines 152 606) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2018-12-30 16:02:53,146 INFO L444 ceAbstractionStarter]: At program point L123(lines 122 616) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) [2018-12-30 16:02:53,147 INFO L444 ceAbstractionStarter]: At program point L586(lines 98 654) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse2 .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 .cse2 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))))) [2018-12-30 16:02:53,147 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 557) no Hoare annotation was computed. [2018-12-30 16:02:53,147 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 394) no Hoare annotation was computed. [2018-12-30 16:02:53,147 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 374) no Hoare annotation was computed. [2018-12-30 16:02:53,147 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:02:53,147 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 492) no Hoare annotation was computed. [2018-12-30 16:02:53,147 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 360) no Hoare annotation was computed. [2018-12-30 16:02:53,147 INFO L448 ceAbstractionStarter]: For program point L356-2(lines 355 372) no Hoare annotation was computed. [2018-12-30 16:02:53,147 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 593) no Hoare annotation was computed. [2018-12-30 16:02:53,147 INFO L448 ceAbstractionStarter]: For program point L158(lines 158 604) no Hoare annotation was computed. [2018-12-30 16:02:53,148 INFO L448 ceAbstractionStarter]: For program point L125(lines 125 615) no Hoare annotation was computed. [2018-12-30 16:02:53,148 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 460) no Hoare annotation was computed. [2018-12-30 16:02:53,148 INFO L448 ceAbstractionStarter]: For program point L324-1(lines 324 333) no Hoare annotation was computed. [2018-12-30 16:02:53,148 INFO L451 ceAbstractionStarter]: At program point L655(lines 97 656) the Hoare annotation is: true [2018-12-30 16:02:53,148 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:02:53,148 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 592) no Hoare annotation was computed. [2018-12-30 16:02:53,148 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 603) no Hoare annotation was computed. [2018-12-30 16:02:53,148 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 614) no Hoare annotation was computed. [2018-12-30 16:02:53,148 INFO L448 ceAbstractionStarter]: For program point L624(lines 624 652) no Hoare annotation was computed. [2018-12-30 16:02:53,148 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 245) no Hoare annotation was computed. [2018-12-30 16:02:53,149 INFO L444 ceAbstractionStarter]: At program point L195(lines 191 593) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2018-12-30 16:02:53,149 INFO L444 ceAbstractionStarter]: At program point L162(lines 158 604) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2018-12-30 16:02:53,149 INFO L448 ceAbstractionStarter]: For program point L228-2(lines 208 585) no Hoare annotation was computed. [2018-12-30 16:02:53,149 INFO L448 ceAbstractionStarter]: For program point L625(lines 625 649) no Hoare annotation was computed. [2018-12-30 16:02:53,149 INFO L448 ceAbstractionStarter]: For program point L559(lines 559 563) no Hoare annotation was computed. [2018-12-30 16:02:53,149 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 530) no Hoare annotation was computed. [2018-12-30 16:02:53,149 INFO L448 ceAbstractionStarter]: For program point L559-2(lines 559 563) no Hoare annotation was computed. [2018-12-30 16:02:53,149 INFO L448 ceAbstractionStarter]: For program point L526-2(lines 208 585) no Hoare annotation was computed. [2018-12-30 16:02:53,149 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 332) no Hoare annotation was computed. [2018-12-30 16:02:53,149 INFO L448 ceAbstractionStarter]: For program point L659(lines 659 663) no Hoare annotation was computed. [2018-12-30 16:02:53,150 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 635) no Hoare annotation was computed. [2018-12-30 16:02:53,150 INFO L448 ceAbstractionStarter]: For program point L659-2(lines 659 663) no Hoare annotation was computed. [2018-12-30 16:02:53,150 INFO L448 ceAbstractionStarter]: For program point L626-2(lines 625 647) no Hoare annotation was computed. [2018-12-30 16:02:53,150 INFO L448 ceAbstractionStarter]: For program point L461(lines 461 472) no Hoare annotation was computed. [2018-12-30 16:02:53,150 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 432) no Hoare annotation was computed. [2018-12-30 16:02:53,150 INFO L444 ceAbstractionStarter]: At program point L362(lines 345 380) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2018-12-30 16:02:53,150 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 235) no Hoare annotation was computed. [2018-12-30 16:02:53,150 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 591) no Hoare annotation was computed. [2018-12-30 16:02:53,150 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 602) no Hoare annotation was computed. [2018-12-30 16:02:53,150 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 613) no Hoare annotation was computed. [2018-12-30 16:02:53,151 INFO L444 ceAbstractionStarter]: At program point L98-2(lines 98 654) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse2 .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 .cse2 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))))) [2018-12-30 16:02:53,151 INFO L444 ceAbstractionStarter]: At program point L396(lines 387 418) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2018-12-30 16:02:53,151 INFO L444 ceAbstractionStarter]: At program point L165(lines 164 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2018-12-30 16:02:53,151 INFO L444 ceAbstractionStarter]: At program point L132(lines 125 615) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2018-12-30 16:02:53,151 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-12-30 16:02:53,151 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 632) no Hoare annotation was computed. [2018-12-30 16:02:53,152 INFO L448 ceAbstractionStarter]: For program point L364(lines 364 368) no Hoare annotation was computed. [2018-12-30 16:02:53,152 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 666) no Hoare annotation was computed. [2018-12-30 16:02:53,152 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 404) no Hoare annotation was computed. [2018-12-30 16:02:53,152 INFO L448 ceAbstractionStarter]: For program point L200(lines 200 590) no Hoare annotation was computed. [2018-12-30 16:02:53,152 INFO L448 ceAbstractionStarter]: For program point L167(lines 167 601) no Hoare annotation was computed. [2018-12-30 16:02:53,152 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 612) no Hoare annotation was computed. [2018-12-30 16:02:53,152 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 623) no Hoare annotation was computed. [2018-12-30 16:02:53,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:02:53 BoogieIcfgContainer [2018-12-30 16:02:53,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:02:53,198 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:02:53,198 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:02:53,198 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:02:53,199 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:02:20" (3/4) ... [2018-12-30 16:02:53,203 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:02:53,245 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 16:02:53,246 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:02:53,404 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:02:53,408 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:02:53,409 INFO L168 Benchmark]: Toolchain (without parser) took 34602.03 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 855.6 MB). Free memory was 951.3 MB in the beginning and 1.7 GB in the end (delta: -771.0 MB). Peak memory consumption was 84.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:02:53,410 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:02:53,411 INFO L168 Benchmark]: CACSL2BoogieTranslator took 450.93 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-30 16:02:53,411 INFO L168 Benchmark]: Boogie Procedure Inliner took 168.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-12-30 16:02:53,412 INFO L168 Benchmark]: Boogie Preprocessor took 53.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:02:53,412 INFO L168 Benchmark]: RCFGBuilder took 1232.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. [2018-12-30 16:02:53,412 INFO L168 Benchmark]: TraceAbstraction took 32479.55 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 754.5 MB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -687.8 MB). Peak memory consumption was 848.2 MB. Max. memory is 11.5 GB. [2018-12-30 16:02:53,415 INFO L168 Benchmark]: Witness Printer took 209.91 ms. Allocated memory is still 1.9 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:02:53,418 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.38 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 450.93 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.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 168.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1232.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32479.55 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 754.5 MB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -687.8 MB). Peak memory consumption was 848.2 MB. Max. memory is 11.5 GB. * Witness Printer took 209.91 ms. Allocated memory is still 1.9 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 666]: 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: 140]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && !(8673 == s__state)) && 8672 <= s__state) && !(8672 == s__state)) && !(0 == s__hit) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && s__state <= 8576) - InvariantResult [Line: 674]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3) || s__state <= 3) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit))) || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (blastFlag <= 3 && 8672 <= s__state) && !(12292 == s__state) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(8657 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3) || s__state <= 3) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit))) || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8576) && !(8480 == s__state)) || ((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(0 == s__hit)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) || ((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && s__state == 8448) && !(0 == s__hit)) || ((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3)) || ((blastFlag <= 2 && s__state == 8448) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((s__state <= 8672 && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && s__state <= 8576) - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && s__state <= 8576) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((((((((((s__state <= 8672 && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 139 locations, 1 error locations. SAFE Result, 32.3s OverallTime, 31 OverallIterations, 19 TraceHistogramMax, 17.3s AutomataDifference, 0.0s DeadEndRemovalTime, 7.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 5245 SDtfs, 3316 SDslu, 2433 SDs, 0 SdLazy, 2970 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3784occurred in iteration=20, 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: 1.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 1865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1971 HoareAnnotationTreeSize, 29 FomulaSimplifications, 39550 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 29 FomulaSimplificationsInter, 7460 FormulaSimplificationTreeSizeReductionInter, 7.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3954 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 24782/24886 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...