./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_4.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/ssh-simplified/s3_srvr_4.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 64a8f3377d83624025022bfde8edd1f829e70f73 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:35:50,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:35:50,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:35:50,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:35:50,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:35:50,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:35:50,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:35:50,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:35:50,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:35:50,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:35:50,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:35:50,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:35:50,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:35:50,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:35:50,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:35:50,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:35:50,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:35:50,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:35:50,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:35:50,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:35:50,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:35:50,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:35:50,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:35:50,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:35:50,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:35:50,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:35:50,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:35:50,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:35:50,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:35:50,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:35:50,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:35:50,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:35:50,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:35:50,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:35:50,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:35:50,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:35:50,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:35:50,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:35:50,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:35:50,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:35:50,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:35:50,885 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:35:50,909 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:35:50,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:35:50,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:35:50,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:35:50,912 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:35:50,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:35:50,912 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:35:50,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:35:50,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:35:50,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:35:50,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:35:50,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:35:50,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:35:50,916 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:35:50,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:35:50,917 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:35:50,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:35:50,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:35:50,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:35:50,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:35:50,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:35:50,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:50,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:35:50,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:35:50,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:35:50,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:35:50,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:35:50,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:35:50,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 64a8f3377d83624025022bfde8edd1f829e70f73 [2019-11-27 22:35:51,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:35:51,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:35:51,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:35:51,311 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:35:51,312 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:35:51,313 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_4.cil.c [2019-11-27 22:35:51,376 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc9fbf5c8/c14803c9318a4387b04e171c25745220/FLAGe2b82a4d9 [2019-11-27 22:35:51,864 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:35:51,865 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_4.cil.c [2019-11-27 22:35:51,877 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc9fbf5c8/c14803c9318a4387b04e171c25745220/FLAGe2b82a4d9 [2019-11-27 22:35:52,188 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc9fbf5c8/c14803c9318a4387b04e171c25745220 [2019-11-27 22:35:52,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:35:52,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:35:52,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:52,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:35:52,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:35:52,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc5d2ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52, skipping insertion in model container [2019-11-27 22:35:52,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:35:52,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:35:52,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:52,556 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:35:52,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:52,702 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:35:52,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52 WrapperNode [2019-11-27 22:35:52,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:52,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:52,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:35:52,704 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:35:52,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,722 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:52,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:35:52,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:35:52,768 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:35:52,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:35:52,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:35:52,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:35:52,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:35:52,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:52,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:35:52,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:35:53,017 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:53,716 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-27 22:35:53,718 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-27 22:35:53,723 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:35:53,724 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:35:53,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:53 BoogieIcfgContainer [2019-11-27 22:35:53,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:35:53,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:35:53,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:35:53,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:35:53,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:35:52" (1/3) ... [2019-11-27 22:35:53,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2816375c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:53, skipping insertion in model container [2019-11-27 22:35:53,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (2/3) ... [2019-11-27 22:35:53,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2816375c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:53, skipping insertion in model container [2019-11-27 22:35:53,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:53" (3/3) ... [2019-11-27 22:35:53,742 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2019-11-27 22:35:53,754 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:35:53,764 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:35:53,777 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:35:53,823 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:35:53,824 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:35:53,824 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:35:53,824 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:35:53,825 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:35:53,825 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:35:53,825 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:35:53,826 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:35:53,855 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-11-27 22:35:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-27 22:35:53,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:53,874 INFO L410 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] [2019-11-27 22:35:53,875 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:53,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:53,882 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-11-27 22:35:53,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:53,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046388788] [2019-11-27 22:35:53,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:54,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:54,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046388788] [2019-11-27 22:35:54,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:54,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:54,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219608271] [2019-11-27 22:35:54,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:54,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:54,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:54,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:54,174 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-11-27 22:35:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:54,544 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-11-27 22:35:54,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:54,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-27 22:35:54,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:54,562 INFO L225 Difference]: With dead ends: 327 [2019-11-27 22:35:54,562 INFO L226 Difference]: Without dead ends: 174 [2019-11-27 22:35:54,566 INFO L630 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 [2019-11-27 22:35:54,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-27 22:35:54,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-11-27 22:35:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-27 22:35:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-11-27 22:35:54,631 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-11-27 22:35:54,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:54,632 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-11-27 22:35:54,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-11-27 22:35:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-27 22:35:54,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:54,639 INFO L410 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] [2019-11-27 22:35:54,640 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:54,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-11-27 22:35:54,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:54,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952848402] [2019-11-27 22:35:54,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:54,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952848402] [2019-11-27 22:35:54,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:54,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:54,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552894436] [2019-11-27 22:35:54,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:54,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:54,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:54,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:54,786 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-11-27 22:35:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:55,042 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-11-27 22:35:55,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:55,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-27 22:35:55,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:55,046 INFO L225 Difference]: With dead ends: 379 [2019-11-27 22:35:55,046 INFO L226 Difference]: Without dead ends: 215 [2019-11-27 22:35:55,048 INFO L630 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 [2019-11-27 22:35:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-27 22:35:55,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-11-27 22:35:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-27 22:35:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-11-27 22:35:55,081 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-11-27 22:35:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:55,082 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-11-27 22:35:55,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-11-27 22:35:55,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-27 22:35:55,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:55,090 INFO L410 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] [2019-11-27 22:35:55,091 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:55,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:55,091 INFO L82 PathProgramCache]: Analyzing trace with hash 25102818, now seen corresponding path program 1 times [2019-11-27 22:35:55,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:55,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676579419] [2019-11-27 22:35:55,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:55,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676579419] [2019-11-27 22:35:55,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:55,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:55,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207847858] [2019-11-27 22:35:55,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:55,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:55,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:55,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:55,212 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-11-27 22:35:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:55,429 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-11-27 22:35:55,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:55,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-27 22:35:55,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:55,432 INFO L225 Difference]: With dead ends: 444 [2019-11-27 22:35:55,433 INFO L226 Difference]: Without dead ends: 241 [2019-11-27 22:35:55,434 INFO L630 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 [2019-11-27 22:35:55,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-27 22:35:55,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-27 22:35:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-27 22:35:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-11-27 22:35:55,459 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-11-27 22:35:55,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:55,460 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-11-27 22:35:55,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:55,460 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-11-27 22:35:55,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-27 22:35:55,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:55,470 INFO L410 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] [2019-11-27 22:35:55,470 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:55,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:55,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1824447496, now seen corresponding path program 1 times [2019-11-27 22:35:55,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:55,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360225945] [2019-11-27 22:35:55,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:55,537 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:35:55,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360225945] [2019-11-27 22:35:55,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:55,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:55,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589042971] [2019-11-27 22:35:55,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:55,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:55,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:55,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:55,541 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-11-27 22:35:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:55,699 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-11-27 22:35:55,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:55,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-27 22:35:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:55,702 INFO L225 Difference]: With dead ends: 492 [2019-11-27 22:35:55,702 INFO L226 Difference]: Without dead ends: 258 [2019-11-27 22:35:55,703 INFO L630 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 [2019-11-27 22:35:55,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-27 22:35:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-11-27 22:35:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-27 22:35:55,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-11-27 22:35:55,716 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-11-27 22:35:55,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:55,717 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-11-27 22:35:55,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:55,717 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-11-27 22:35:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-27 22:35:55,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:55,720 INFO L410 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] [2019-11-27 22:35:55,720 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:55,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:55,721 INFO L82 PathProgramCache]: Analyzing trace with hash 471399807, now seen corresponding path program 1 times [2019-11-27 22:35:55,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:55,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129393843] [2019-11-27 22:35:55,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:55,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129393843] [2019-11-27 22:35:55,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:55,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:55,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997419115] [2019-11-27 22:35:55,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:55,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:55,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:55,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:55,784 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-11-27 22:35:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:55,982 INFO L93 Difference]: Finished difference Result 552 states and 932 transitions. [2019-11-27 22:35:55,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:55,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-27 22:35:55,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:55,989 INFO L225 Difference]: With dead ends: 552 [2019-11-27 22:35:55,989 INFO L226 Difference]: Without dead ends: 303 [2019-11-27 22:35:55,990 INFO L630 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 [2019-11-27 22:35:55,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-27 22:35:56,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 298. [2019-11-27 22:35:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-27 22:35:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-11-27 22:35:56,004 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-11-27 22:35:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:56,005 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-11-27 22:35:56,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-11-27 22:35:56,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:35:56,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:56,007 INFO L410 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] [2019-11-27 22:35:56,007 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:56,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:56,008 INFO L82 PathProgramCache]: Analyzing trace with hash -455139068, now seen corresponding path program 1 times [2019-11-27 22:35:56,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:56,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793742226] [2019-11-27 22:35:56,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:35:56,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793742226] [2019-11-27 22:35:56,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:56,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864151419] [2019-11-27 22:35:56,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,091 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-11-27 22:35:56,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:56,260 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-11-27 22:35:56,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:56,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:35:56,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:56,262 INFO L225 Difference]: With dead ends: 591 [2019-11-27 22:35:56,262 INFO L226 Difference]: Without dead ends: 300 [2019-11-27 22:35:56,263 INFO L630 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 [2019-11-27 22:35:56,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-27 22:35:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-27 22:35:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-27 22:35:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-11-27 22:35:56,274 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-11-27 22:35:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:56,275 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-11-27 22:35:56,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-11-27 22:35:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:35:56,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:56,277 INFO L410 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] [2019-11-27 22:35:56,277 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:56,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:56,277 INFO L82 PathProgramCache]: Analyzing trace with hash -190163418, now seen corresponding path program 1 times [2019-11-27 22:35:56,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:56,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444158974] [2019-11-27 22:35:56,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:56,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444158974] [2019-11-27 22:35:56,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:56,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150471488] [2019-11-27 22:35:56,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,329 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-11-27 22:35:56,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:56,518 INFO L93 Difference]: Finished difference Result 594 states and 996 transitions. [2019-11-27 22:35:56,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:56,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:35:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:56,521 INFO L225 Difference]: With dead ends: 594 [2019-11-27 22:35:56,521 INFO L226 Difference]: Without dead ends: 301 [2019-11-27 22:35:56,522 INFO L630 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 [2019-11-27 22:35:56,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-27 22:35:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2019-11-27 22:35:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-27 22:35:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-11-27 22:35:56,534 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-11-27 22:35:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:56,535 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-11-27 22:35:56,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:56,535 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-11-27 22:35:56,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-27 22:35:56,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:56,537 INFO L410 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, 1] [2019-11-27 22:35:56,537 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:56,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:56,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1935111195, now seen corresponding path program 1 times [2019-11-27 22:35:56,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:56,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895097287] [2019-11-27 22:35:56,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-27 22:35:56,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895097287] [2019-11-27 22:35:56,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:56,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082184538] [2019-11-27 22:35:56,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,584 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-11-27 22:35:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:56,765 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-11-27 22:35:56,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:56,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-27 22:35:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:56,768 INFO L225 Difference]: With dead ends: 594 [2019-11-27 22:35:56,768 INFO L226 Difference]: Without dead ends: 305 [2019-11-27 22:35:56,769 INFO L630 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 [2019-11-27 22:35:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-27 22:35:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-11-27 22:35:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-27 22:35:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-11-27 22:35:56,780 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-11-27 22:35:56,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:56,780 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-11-27 22:35:56,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:56,781 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-11-27 22:35:56,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-27 22:35:56,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:56,782 INFO L410 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] [2019-11-27 22:35:56,782 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:56,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:56,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1438087397, now seen corresponding path program 1 times [2019-11-27 22:35:56,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:56,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955965429] [2019-11-27 22:35:56,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:35:56,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955965429] [2019-11-27 22:35:56,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:56,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906468279] [2019-11-27 22:35:56,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,831 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-11-27 22:35:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,000 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-11-27 22:35:57,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-27 22:35:57,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,004 INFO L225 Difference]: With dead ends: 634 [2019-11-27 22:35:57,004 INFO L226 Difference]: Without dead ends: 336 [2019-11-27 22:35:57,005 INFO L630 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 [2019-11-27 22:35:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-27 22:35:57,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-27 22:35:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-27 22:35:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-11-27 22:35:57,018 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-11-27 22:35:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,019 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-11-27 22:35:57,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,019 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-11-27 22:35:57,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-27 22:35:57,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,020 INFO L410 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] [2019-11-27 22:35:57,021 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,021 INFO L82 PathProgramCache]: Analyzing trace with hash 384185223, now seen corresponding path program 1 times [2019-11-27 22:35:57,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262940040] [2019-11-27 22:35:57,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:35:57,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262940040] [2019-11-27 22:35:57,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:57,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009425773] [2019-11-27 22:35:57,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,058 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-11-27 22:35:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,245 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-11-27 22:35:57,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-27 22:35:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,248 INFO L225 Difference]: With dead ends: 663 [2019-11-27 22:35:57,248 INFO L226 Difference]: Without dead ends: 336 [2019-11-27 22:35:57,249 INFO L630 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 [2019-11-27 22:35:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-27 22:35:57,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-27 22:35:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-27 22:35:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-11-27 22:35:57,264 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-11-27 22:35:57,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,265 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-11-27 22:35:57,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-11-27 22:35:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-27 22:35:57,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,268 INFO L410 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, 1] [2019-11-27 22:35:57,268 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1845992555, now seen corresponding path program 1 times [2019-11-27 22:35:57,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674681159] [2019-11-27 22:35:57,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:35:57,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674681159] [2019-11-27 22:35:57,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:57,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129445488] [2019-11-27 22:35:57,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,312 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-11-27 22:35:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,458 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-11-27 22:35:57,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-27 22:35:57,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,462 INFO L225 Difference]: With dead ends: 696 [2019-11-27 22:35:57,462 INFO L226 Difference]: Without dead ends: 369 [2019-11-27 22:35:57,463 INFO L630 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 [2019-11-27 22:35:57,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-27 22:35:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-27 22:35:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-27 22:35:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-11-27 22:35:57,480 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-11-27 22:35:57,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,481 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-11-27 22:35:57,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,481 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-11-27 22:35:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-27 22:35:57,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,484 INFO L410 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, 1] [2019-11-27 22:35:57,484 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1032094409, now seen corresponding path program 1 times [2019-11-27 22:35:57,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138032644] [2019-11-27 22:35:57,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,526 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:35:57,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138032644] [2019-11-27 22:35:57,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:57,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47475626] [2019-11-27 22:35:57,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,529 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-11-27 22:35:57,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,670 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-11-27 22:35:57,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-27 22:35:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,673 INFO L225 Difference]: With dead ends: 723 [2019-11-27 22:35:57,674 INFO L226 Difference]: Without dead ends: 369 [2019-11-27 22:35:57,675 INFO L630 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 [2019-11-27 22:35:57,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-27 22:35:57,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-27 22:35:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-27 22:35:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-11-27 22:35:57,688 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-11-27 22:35:57,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,689 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-11-27 22:35:57,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-11-27 22:35:57,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-27 22:35:57,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,691 INFO L410 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] [2019-11-27 22:35:57,692 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2114438894, now seen corresponding path program 1 times [2019-11-27 22:35:57,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888847137] [2019-11-27 22:35:57,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,728 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:35:57,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888847137] [2019-11-27 22:35:57,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:57,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328432193] [2019-11-27 22:35:57,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,731 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-11-27 22:35:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,870 INFO L93 Difference]: Finished difference Result 740 states and 1192 transitions. [2019-11-27 22:35:57,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-27 22:35:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,873 INFO L225 Difference]: With dead ends: 740 [2019-11-27 22:35:57,874 INFO L226 Difference]: Without dead ends: 386 [2019-11-27 22:35:57,875 INFO L630 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 [2019-11-27 22:35:57,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-27 22:35:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-11-27 22:35:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-27 22:35:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-11-27 22:35:57,891 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-11-27 22:35:57,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,891 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-11-27 22:35:57,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,892 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-11-27 22:35:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-27 22:35:57,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,894 INFO L410 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] [2019-11-27 22:35:57,894 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1334837850, now seen corresponding path program 1 times [2019-11-27 22:35:57,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522914713] [2019-11-27 22:35:57,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:35:57,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522914713] [2019-11-27 22:35:57,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:57,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003251888] [2019-11-27 22:35:57,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,941 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-11-27 22:35:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:58,080 INFO L93 Difference]: Finished difference Result 761 states and 1215 transitions. [2019-11-27 22:35:58,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:58,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-27 22:35:58,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:58,083 INFO L225 Difference]: With dead ends: 761 [2019-11-27 22:35:58,083 INFO L226 Difference]: Without dead ends: 386 [2019-11-27 22:35:58,085 INFO L630 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 [2019-11-27 22:35:58,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-27 22:35:58,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-11-27 22:35:58,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-27 22:35:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-11-27 22:35:58,103 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-11-27 22:35:58,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:58,103 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-11-27 22:35:58,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:58,104 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-11-27 22:35:58,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-27 22:35:58,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:58,106 INFO L410 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] [2019-11-27 22:35:58,106 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:58,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:58,107 INFO L82 PathProgramCache]: Analyzing trace with hash -457491278, now seen corresponding path program 1 times [2019-11-27 22:35:58,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:58,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725802119] [2019-11-27 22:35:58,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-27 22:35:58,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725802119] [2019-11-27 22:35:58,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:58,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:58,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958513323] [2019-11-27 22:35:58,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:58,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:58,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:58,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,198 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-11-27 22:35:58,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:58,255 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-11-27 22:35:58,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:58,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-27 22:35:58,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:58,260 INFO L225 Difference]: With dead ends: 757 [2019-11-27 22:35:58,260 INFO L226 Difference]: Without dead ends: 755 [2019-11-27 22:35:58,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-11-27 22:35:58,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-11-27 22:35:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-27 22:35:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-11-27 22:35:58,300 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-11-27 22:35:58,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:58,300 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-11-27 22:35:58,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-11-27 22:35:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-27 22:35:58,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:58,303 INFO L410 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, 1] [2019-11-27 22:35:58,303 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:58,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:58,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1678103130, now seen corresponding path program 1 times [2019-11-27 22:35:58,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:58,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354735978] [2019-11-27 22:35:58,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-27 22:35:58,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354735978] [2019-11-27 22:35:58,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:58,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:58,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865063285] [2019-11-27 22:35:58,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:58,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:58,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:58,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,386 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-11-27 22:35:58,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:58,453 INFO L93 Difference]: Finished difference Result 1831 states and 2899 transitions. [2019-11-27 22:35:58,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:58,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-27 22:35:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:58,461 INFO L225 Difference]: With dead ends: 1831 [2019-11-27 22:35:58,461 INFO L226 Difference]: Without dead ends: 1083 [2019-11-27 22:35:58,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-11-27 22:35:58,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2019-11-27 22:35:58,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-11-27 22:35:58,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1712 transitions. [2019-11-27 22:35:58,516 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1712 transitions. Word has length 121 [2019-11-27 22:35:58,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:58,516 INFO L462 AbstractCegarLoop]: Abstraction has 1083 states and 1712 transitions. [2019-11-27 22:35:58,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:58,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1712 transitions. [2019-11-27 22:35:58,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-27 22:35:58,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:58,519 INFO L410 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, 1] [2019-11-27 22:35:58,520 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:58,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:58,520 INFO L82 PathProgramCache]: Analyzing trace with hash -740381348, now seen corresponding path program 1 times [2019-11-27 22:35:58,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:58,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542402174] [2019-11-27 22:35:58,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:35:58,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542402174] [2019-11-27 22:35:58,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:58,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:58,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103381430] [2019-11-27 22:35:58,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:58,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:58,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:58,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,563 INFO L87 Difference]: Start difference. First operand 1083 states and 1712 transitions. Second operand 3 states. [2019-11-27 22:35:58,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:58,630 INFO L93 Difference]: Finished difference Result 2528 states and 3999 transitions. [2019-11-27 22:35:58,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:58,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-27 22:35:58,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:58,637 INFO L225 Difference]: With dead ends: 2528 [2019-11-27 22:35:58,638 INFO L226 Difference]: Without dead ends: 1452 [2019-11-27 22:35:58,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2019-11-27 22:35:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1452. [2019-11-27 22:35:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2019-11-27 22:35:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2294 transitions. [2019-11-27 22:35:58,693 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2294 transitions. Word has length 121 [2019-11-27 22:35:58,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:58,693 INFO L462 AbstractCegarLoop]: Abstraction has 1452 states and 2294 transitions. [2019-11-27 22:35:58,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:58,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2294 transitions. [2019-11-27 22:35:58,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-27 22:35:58,697 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:58,697 INFO L410 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, 1] [2019-11-27 22:35:58,697 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:58,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:58,698 INFO L82 PathProgramCache]: Analyzing trace with hash 648912666, now seen corresponding path program 1 times [2019-11-27 22:35:58,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:58,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142229928] [2019-11-27 22:35:58,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-27 22:35:58,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142229928] [2019-11-27 22:35:58,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:58,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:58,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123266386] [2019-11-27 22:35:58,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:58,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:58,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:58,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,738 INFO L87 Difference]: Start difference. First operand 1452 states and 2294 transitions. Second operand 3 states. [2019-11-27 22:35:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:58,811 INFO L93 Difference]: Finished difference Result 3248 states and 5132 transitions. [2019-11-27 22:35:58,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:58,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-27 22:35:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:58,824 INFO L225 Difference]: With dead ends: 3248 [2019-11-27 22:35:58,824 INFO L226 Difference]: Without dead ends: 1803 [2019-11-27 22:35:58,828 INFO L630 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 [2019-11-27 22:35:58,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-11-27 22:35:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2019-11-27 22:35:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-11-27 22:35:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2845 transitions. [2019-11-27 22:35:58,914 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2845 transitions. Word has length 121 [2019-11-27 22:35:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:58,915 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2845 transitions. [2019-11-27 22:35:58,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2845 transitions. [2019-11-27 22:35:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-27 22:35:58,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:58,924 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 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, 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] [2019-11-27 22:35:58,924 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:58,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:58,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1430663259, now seen corresponding path program 1 times [2019-11-27 22:35:58,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:58,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113200447] [2019-11-27 22:35:58,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-27 22:35:59,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113200447] [2019-11-27 22:35:59,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:59,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:59,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673786679] [2019-11-27 22:35:59,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:59,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:59,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:59,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:59,020 INFO L87 Difference]: Start difference. First operand 1803 states and 2845 transitions. Second operand 3 states. [2019-11-27 22:35:59,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:59,274 INFO L93 Difference]: Finished difference Result 3649 states and 5739 transitions. [2019-11-27 22:35:59,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:59,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-27 22:35:59,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:59,284 INFO L225 Difference]: With dead ends: 3649 [2019-11-27 22:35:59,284 INFO L226 Difference]: Without dead ends: 1853 [2019-11-27 22:35:59,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:59,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-11-27 22:35:59,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1803. [2019-11-27 22:35:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-11-27 22:35:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2773 transitions. [2019-11-27 22:35:59,354 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2773 transitions. Word has length 198 [2019-11-27 22:35:59,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:59,355 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2773 transitions. [2019-11-27 22:35:59,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:59,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2773 transitions. [2019-11-27 22:35:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-27 22:35:59,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:59,361 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 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, 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] [2019-11-27 22:35:59,361 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:59,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:59,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1183282719, now seen corresponding path program 1 times [2019-11-27 22:35:59,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:59,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600823056] [2019-11-27 22:35:59,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:59,428 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-27 22:35:59,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600823056] [2019-11-27 22:35:59,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:59,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:59,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894672813] [2019-11-27 22:35:59,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:59,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:59,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:59,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:59,431 INFO L87 Difference]: Start difference. First operand 1803 states and 2773 transitions. Second operand 3 states. [2019-11-27 22:35:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:59,679 INFO L93 Difference]: Finished difference Result 3666 states and 5612 transitions. [2019-11-27 22:35:59,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:59,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-11-27 22:35:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:59,689 INFO L225 Difference]: With dead ends: 3666 [2019-11-27 22:35:59,689 INFO L226 Difference]: Without dead ends: 1870 [2019-11-27 22:35:59,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:59,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-11-27 22:35:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1803. [2019-11-27 22:35:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-11-27 22:35:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2697 transitions. [2019-11-27 22:35:59,829 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2697 transitions. Word has length 212 [2019-11-27 22:35:59,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:59,830 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2697 transitions. [2019-11-27 22:35:59,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:59,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2697 transitions. [2019-11-27 22:35:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-27 22:35:59,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:59,839 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-27 22:35:59,840 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:59,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash 317822775, now seen corresponding path program 1 times [2019-11-27 22:35:59,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:59,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396399988] [2019-11-27 22:35:59,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-27 22:35:59,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396399988] [2019-11-27 22:35:59,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463703401] [2019-11-27 22:35:59,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-27 22:36:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:00,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:36:00,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:36:00,330 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-27 22:36:00,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:36:00,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:36:00,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179850887] [2019-11-27 22:36:00,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:36:00,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:00,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:36:00,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:36:00,337 INFO L87 Difference]: Start difference. First operand 1803 states and 2697 transitions. Second operand 4 states. [2019-11-27 22:36:00,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:00,806 INFO L93 Difference]: Finished difference Result 4264 states and 6328 transitions. [2019-11-27 22:36:00,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:36:00,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-11-27 22:36:00,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:00,819 INFO L225 Difference]: With dead ends: 4264 [2019-11-27 22:36:00,820 INFO L226 Difference]: Without dead ends: 2435 [2019-11-27 22:36:00,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:36:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2019-11-27 22:36:00,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 1603. [2019-11-27 22:36:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2019-11-27 22:36:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2361 transitions. [2019-11-27 22:36:00,907 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2361 transitions. Word has length 231 [2019-11-27 22:36:00,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:00,907 INFO L462 AbstractCegarLoop]: Abstraction has 1603 states and 2361 transitions. [2019-11-27 22:36:00,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:36:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2361 transitions. [2019-11-27 22:36:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-27 22:36:00,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:00,913 INFO L410 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, 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] [2019-11-27 22:36:01,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:36:01,120 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:01,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:01,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1244258795, now seen corresponding path program 1 times [2019-11-27 22:36:01,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:01,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410385054] [2019-11-27 22:36:01,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-11-27 22:36:01,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410385054] [2019-11-27 22:36:01,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:01,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:01,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462771256] [2019-11-27 22:36:01,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:01,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:01,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:01,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:01,248 INFO L87 Difference]: Start difference. First operand 1603 states and 2361 transitions. Second operand 3 states. [2019-11-27 22:36:01,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:01,496 INFO L93 Difference]: Finished difference Result 3394 states and 5016 transitions. [2019-11-27 22:36:01,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:01,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-11-27 22:36:01,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:01,505 INFO L225 Difference]: With dead ends: 3394 [2019-11-27 22:36:01,506 INFO L226 Difference]: Without dead ends: 1678 [2019-11-27 22:36:01,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:01,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-11-27 22:36:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1678. [2019-11-27 22:36:01,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1678 states. [2019-11-27 22:36:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2426 transitions. [2019-11-27 22:36:01,588 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2426 transitions. Word has length 240 [2019-11-27 22:36:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:01,589 INFO L462 AbstractCegarLoop]: Abstraction has 1678 states and 2426 transitions. [2019-11-27 22:36:01,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:01,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2426 transitions. [2019-11-27 22:36:01,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-27 22:36:01,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:01,596 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-27 22:36:01,596 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:01,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:01,597 INFO L82 PathProgramCache]: Analyzing trace with hash -2075878606, now seen corresponding path program 1 times [2019-11-27 22:36:01,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:01,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148166576] [2019-11-27 22:36:01,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-27 22:36:01,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148166576] [2019-11-27 22:36:01,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908929786] [2019-11-27 22:36:01,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-27 22:36:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:01,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:36:01,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:36:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-27 22:36:01,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:36:01,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:36:01,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821463456] [2019-11-27 22:36:01,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:36:01,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:01,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:36:01,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:36:01,945 INFO L87 Difference]: Start difference. First operand 1678 states and 2426 transitions. Second operand 4 states. [2019-11-27 22:36:02,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:02,491 INFO L93 Difference]: Finished difference Result 5319 states and 7732 transitions. [2019-11-27 22:36:02,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:36:02,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-27 22:36:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:02,516 INFO L225 Difference]: With dead ends: 5319 [2019-11-27 22:36:02,516 INFO L226 Difference]: Without dead ends: 3648 [2019-11-27 22:36:02,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:36:02,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2019-11-27 22:36:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 2003. [2019-11-27 22:36:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2003 states. [2019-11-27 22:36:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 2728 transitions. [2019-11-27 22:36:02,642 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 2728 transitions. Word has length 252 [2019-11-27 22:36:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:02,643 INFO L462 AbstractCegarLoop]: Abstraction has 2003 states and 2728 transitions. [2019-11-27 22:36:02,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:36:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2728 transitions. [2019-11-27 22:36:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-27 22:36:02,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:02,651 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-27 22:36:02,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:36:02,858 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:02,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:02,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1787059216, now seen corresponding path program 1 times [2019-11-27 22:36:02,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:02,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258571432] [2019-11-27 22:36:02,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-27 22:36:02,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258571432] [2019-11-27 22:36:02,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:02,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:02,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228375163] [2019-11-27 22:36:02,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:02,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:02,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:02,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:02,964 INFO L87 Difference]: Start difference. First operand 2003 states and 2728 transitions. Second operand 3 states. [2019-11-27 22:36:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:03,079 INFO L93 Difference]: Finished difference Result 5741 states and 7863 transitions. [2019-11-27 22:36:03,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:03,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-27 22:36:03,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:03,098 INFO L225 Difference]: With dead ends: 5741 [2019-11-27 22:36:03,098 INFO L226 Difference]: Without dead ends: 3745 [2019-11-27 22:36:03,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-11-27 22:36:03,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3743. [2019-11-27 22:36:03,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-11-27 22:36:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5133 transitions. [2019-11-27 22:36:03,245 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5133 transitions. Word has length 252 [2019-11-27 22:36:03,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:03,246 INFO L462 AbstractCegarLoop]: Abstraction has 3743 states and 5133 transitions. [2019-11-27 22:36:03,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:03,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5133 transitions. [2019-11-27 22:36:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-27 22:36:03,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:03,255 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 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, 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, 1] [2019-11-27 22:36:03,255 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:03,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:03,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1938581061, now seen corresponding path program 1 times [2019-11-27 22:36:03,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:03,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111184667] [2019-11-27 22:36:03,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:03,372 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-27 22:36:03,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111184667] [2019-11-27 22:36:03,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:03,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:03,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562370736] [2019-11-27 22:36:03,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:03,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:03,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:03,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:03,376 INFO L87 Difference]: Start difference. First operand 3743 states and 5133 transitions. Second operand 3 states. [2019-11-27 22:36:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:03,664 INFO L93 Difference]: Finished difference Result 7697 states and 10553 transitions. [2019-11-27 22:36:03,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:03,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-11-27 22:36:03,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:03,695 INFO L225 Difference]: With dead ends: 7697 [2019-11-27 22:36:03,695 INFO L226 Difference]: Without dead ends: 3961 [2019-11-27 22:36:03,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:03,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2019-11-27 22:36:03,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 3743. [2019-11-27 22:36:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-11-27 22:36:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5029 transitions. [2019-11-27 22:36:03,845 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5029 transitions. Word has length 255 [2019-11-27 22:36:03,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:03,845 INFO L462 AbstractCegarLoop]: Abstraction has 3743 states and 5029 transitions. [2019-11-27 22:36:03,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:03,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5029 transitions. [2019-11-27 22:36:03,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-11-27 22:36:03,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:03,856 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:03,856 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:03,857 INFO L82 PathProgramCache]: Analyzing trace with hash 501059335, now seen corresponding path program 1 times [2019-11-27 22:36:03,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:03,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980340463] [2019-11-27 22:36:03,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:03,960 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-11-27 22:36:03,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980340463] [2019-11-27 22:36:03,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:03,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:03,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956823653] [2019-11-27 22:36:03,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:03,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:03,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:03,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:03,964 INFO L87 Difference]: Start difference. First operand 3743 states and 5029 transitions. Second operand 3 states. [2019-11-27 22:36:04,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:04,214 INFO L93 Difference]: Finished difference Result 7611 states and 10229 transitions. [2019-11-27 22:36:04,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:04,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2019-11-27 22:36:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:04,225 INFO L225 Difference]: With dead ends: 7611 [2019-11-27 22:36:04,226 INFO L226 Difference]: Without dead ends: 3875 [2019-11-27 22:36:04,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2019-11-27 22:36:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 3835. [2019-11-27 22:36:04,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3835 states. [2019-11-27 22:36:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 5141 transitions. [2019-11-27 22:36:04,374 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 5141 transitions. Word has length 289 [2019-11-27 22:36:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:04,375 INFO L462 AbstractCegarLoop]: Abstraction has 3835 states and 5141 transitions. [2019-11-27 22:36:04,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 5141 transitions. [2019-11-27 22:36:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-11-27 22:36:04,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:04,386 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:04,387 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:04,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:04,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1381959862, now seen corresponding path program 1 times [2019-11-27 22:36:04,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:04,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008572730] [2019-11-27 22:36:04,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-11-27 22:36:04,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008572730] [2019-11-27 22:36:04,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:04,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:04,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806589365] [2019-11-27 22:36:04,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:04,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:04,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:04,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:04,496 INFO L87 Difference]: Start difference. First operand 3835 states and 5141 transitions. Second operand 3 states. [2019-11-27 22:36:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:04,712 INFO L93 Difference]: Finished difference Result 8043 states and 10851 transitions. [2019-11-27 22:36:04,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:04,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-11-27 22:36:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:04,722 INFO L225 Difference]: With dead ends: 8043 [2019-11-27 22:36:04,722 INFO L226 Difference]: Without dead ends: 4215 [2019-11-27 22:36:04,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4215 states. [2019-11-27 22:36:04,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4215 to 4085. [2019-11-27 22:36:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4085 states. [2019-11-27 22:36:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 5441 transitions. [2019-11-27 22:36:04,863 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 5441 transitions. Word has length 310 [2019-11-27 22:36:04,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:04,863 INFO L462 AbstractCegarLoop]: Abstraction has 4085 states and 5441 transitions. [2019-11-27 22:36:04,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:04,864 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 5441 transitions. [2019-11-27 22:36:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-11-27 22:36:04,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:04,876 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:04,877 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:04,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:04,877 INFO L82 PathProgramCache]: Analyzing trace with hash -978123879, now seen corresponding path program 1 times [2019-11-27 22:36:04,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:04,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432504712] [2019-11-27 22:36:04,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:05,030 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-11-27 22:36:05,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432504712] [2019-11-27 22:36:05,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:05,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:05,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554001594] [2019-11-27 22:36:05,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:05,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:05,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:05,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:05,033 INFO L87 Difference]: Start difference. First operand 4085 states and 5441 transitions. Second operand 3 states. [2019-11-27 22:36:05,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:05,219 INFO L93 Difference]: Finished difference Result 6854 states and 9018 transitions. [2019-11-27 22:36:05,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:05,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-11-27 22:36:05,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:05,225 INFO L225 Difference]: With dead ends: 6854 [2019-11-27 22:36:05,226 INFO L226 Difference]: Without dead ends: 2132 [2019-11-27 22:36:05,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-11-27 22:36:05,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2132. [2019-11-27 22:36:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-11-27 22:36:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2773 transitions. [2019-11-27 22:36:05,295 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2773 transitions. Word has length 320 [2019-11-27 22:36:05,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:05,295 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2773 transitions. [2019-11-27 22:36:05,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2773 transitions. [2019-11-27 22:36:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-27 22:36:05,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:05,304 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:05,304 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:05,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1544826379, now seen corresponding path program 1 times [2019-11-27 22:36:05,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:05,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257888756] [2019-11-27 22:36:05,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-11-27 22:36:05,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257888756] [2019-11-27 22:36:05,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:05,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:05,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812873718] [2019-11-27 22:36:05,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:05,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:05,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:05,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:05,415 INFO L87 Difference]: Start difference. First operand 2132 states and 2773 transitions. Second operand 3 states. [2019-11-27 22:36:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:05,641 INFO L93 Difference]: Finished difference Result 4297 states and 5600 transitions. [2019-11-27 22:36:05,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:05,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-27 22:36:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:05,651 INFO L225 Difference]: With dead ends: 4297 [2019-11-27 22:36:05,651 INFO L226 Difference]: Without dead ends: 2172 [2019-11-27 22:36:05,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2019-11-27 22:36:05,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2132. [2019-11-27 22:36:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-11-27 22:36:05,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2733 transitions. [2019-11-27 22:36:05,754 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2733 transitions. Word has length 336 [2019-11-27 22:36:05,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:05,755 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2733 transitions. [2019-11-27 22:36:05,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:05,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2733 transitions. [2019-11-27 22:36:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-11-27 22:36:05,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:05,772 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:05,773 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:05,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:05,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1385591610, now seen corresponding path program 1 times [2019-11-27 22:36:05,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:05,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017494880] [2019-11-27 22:36:05,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-11-27 22:36:05,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017494880] [2019-11-27 22:36:05,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:05,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:05,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973687458] [2019-11-27 22:36:05,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:05,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:05,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:05,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:05,983 INFO L87 Difference]: Start difference. First operand 2132 states and 2733 transitions. Second operand 3 states. [2019-11-27 22:36:06,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:06,215 INFO L93 Difference]: Finished difference Result 4267 states and 5465 transitions. [2019-11-27 22:36:06,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:06,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2019-11-27 22:36:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:06,224 INFO L225 Difference]: With dead ends: 4267 [2019-11-27 22:36:06,224 INFO L226 Difference]: Without dead ends: 2142 [2019-11-27 22:36:06,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:06,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-11-27 22:36:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2132. [2019-11-27 22:36:06,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-11-27 22:36:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2693 transitions. [2019-11-27 22:36:06,327 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2693 transitions. Word has length 359 [2019-11-27 22:36:06,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:06,328 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2693 transitions. [2019-11-27 22:36:06,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:06,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2693 transitions. [2019-11-27 22:36:06,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-11-27 22:36:06,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:06,350 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 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, 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] [2019-11-27 22:36:06,350 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:06,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:06,351 INFO L82 PathProgramCache]: Analyzing trace with hash 228313073, now seen corresponding path program 1 times [2019-11-27 22:36:06,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:06,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862231940] [2019-11-27 22:36:06,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-27 22:36:06,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862231940] [2019-11-27 22:36:06,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177221830] [2019-11-27 22:36:06,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-27 22:36:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:06,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:36:06,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:36:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-11-27 22:36:06,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:36:06,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-27 22:36:06,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805148761] [2019-11-27 22:36:06,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:06,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:06,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:06,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:36:06,963 INFO L87 Difference]: Start difference. First operand 2132 states and 2693 transitions. Second operand 3 states. [2019-11-27 22:36:07,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:07,025 INFO L93 Difference]: Finished difference Result 2710 states and 3447 transitions. [2019-11-27 22:36:07,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:07,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-11-27 22:36:07,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:07,032 INFO L225 Difference]: With dead ends: 2710 [2019-11-27 22:36:07,032 INFO L226 Difference]: Without dead ends: 2572 [2019-11-27 22:36:07,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:36:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-11-27 22:36:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 1996. [2019-11-27 22:36:07,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2019-11-27 22:36:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2539 transitions. [2019-11-27 22:36:07,100 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2539 transitions. Word has length 392 [2019-11-27 22:36:07,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:07,100 INFO L462 AbstractCegarLoop]: Abstraction has 1996 states and 2539 transitions. [2019-11-27 22:36:07,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2539 transitions. [2019-11-27 22:36:07,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-11-27 22:36:07,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:07,110 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:07,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:36:07,315 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:07,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:07,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1194864871, now seen corresponding path program 1 times [2019-11-27 22:36:07,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:07,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583857745] [2019-11-27 22:36:07,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:07,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-11-27 22:36:07,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583857745] [2019-11-27 22:36:07,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268860208] [2019-11-27 22:36:07,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-27 22:36:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:07,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:36:07,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:36:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-11-27 22:36:07,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:36:07,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:36:07,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822023976] [2019-11-27 22:36:07,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:36:07,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:07,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:36:07,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:36:07,811 INFO L87 Difference]: Start difference. First operand 1996 states and 2539 transitions. Second operand 4 states. [2019-11-27 22:36:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:08,256 INFO L93 Difference]: Finished difference Result 5015 states and 6403 transitions. [2019-11-27 22:36:08,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:36:08,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 408 [2019-11-27 22:36:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:08,263 INFO L225 Difference]: With dead ends: 5015 [2019-11-27 22:36:08,263 INFO L226 Difference]: Without dead ends: 2984 [2019-11-27 22:36:08,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:36:08,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2019-11-27 22:36:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2156. [2019-11-27 22:36:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2156 states. [2019-11-27 22:36:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2759 transitions. [2019-11-27 22:36:08,344 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2759 transitions. Word has length 408 [2019-11-27 22:36:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:08,345 INFO L462 AbstractCegarLoop]: Abstraction has 2156 states and 2759 transitions. [2019-11-27 22:36:08,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:36:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2759 transitions. [2019-11-27 22:36:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-11-27 22:36:08,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:08,359 INFO L410 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, 1] [2019-11-27 22:36:08,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:36:08,564 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:08,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:08,565 INFO L82 PathProgramCache]: Analyzing trace with hash 276993037, now seen corresponding path program 1 times [2019-11-27 22:36:08,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:08,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401788567] [2019-11-27 22:36:08,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:08,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2019-11-27 22:36:08,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401788567] [2019-11-27 22:36:08,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:08,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:08,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871802810] [2019-11-27 22:36:08,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:08,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:08,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:08,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:08,761 INFO L87 Difference]: Start difference. First operand 2156 states and 2759 transitions. Second operand 3 states. [2019-11-27 22:36:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:08,962 INFO L93 Difference]: Finished difference Result 4485 states and 5762 transitions. [2019-11-27 22:36:08,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:08,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 470 [2019-11-27 22:36:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:08,967 INFO L225 Difference]: With dead ends: 4485 [2019-11-27 22:36:08,967 INFO L226 Difference]: Without dead ends: 2336 [2019-11-27 22:36:08,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:08,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2019-11-27 22:36:09,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2326. [2019-11-27 22:36:09,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-11-27 22:36:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 2954 transitions. [2019-11-27 22:36:09,042 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 2954 transitions. Word has length 470 [2019-11-27 22:36:09,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:09,043 INFO L462 AbstractCegarLoop]: Abstraction has 2326 states and 2954 transitions. [2019-11-27 22:36:09,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 2954 transitions. [2019-11-27 22:36:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-11-27 22:36:09,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:09,051 INFO L410 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, 1] [2019-11-27 22:36:09,051 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:09,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:09,052 INFO L82 PathProgramCache]: Analyzing trace with hash 373235815, now seen corresponding path program 1 times [2019-11-27 22:36:09,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:09,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019673142] [2019-11-27 22:36:09,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2019-11-27 22:36:09,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019673142] [2019-11-27 22:36:09,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:09,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:09,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908231650] [2019-11-27 22:36:09,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:09,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:09,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:09,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:09,330 INFO L87 Difference]: Start difference. First operand 2326 states and 2954 transitions. Second operand 3 states. [2019-11-27 22:36:09,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:09,541 INFO L93 Difference]: Finished difference Result 4640 states and 5887 transitions. [2019-11-27 22:36:09,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:09,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 532 [2019-11-27 22:36:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:09,546 INFO L225 Difference]: With dead ends: 4640 [2019-11-27 22:36:09,546 INFO L226 Difference]: Without dead ends: 2321 [2019-11-27 22:36:09,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2019-11-27 22:36:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2019-11-27 22:36:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-11-27 22:36:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 2884 transitions. [2019-11-27 22:36:09,614 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 2884 transitions. Word has length 532 [2019-11-27 22:36:09,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:09,614 INFO L462 AbstractCegarLoop]: Abstraction has 2321 states and 2884 transitions. [2019-11-27 22:36:09,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2884 transitions. [2019-11-27 22:36:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2019-11-27 22:36:09,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:09,622 INFO L410 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, 1] [2019-11-27 22:36:09,623 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:09,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:09,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1632000361, now seen corresponding path program 1 times [2019-11-27 22:36:09,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:09,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525031801] [2019-11-27 22:36:09,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-27 22:36:09,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525031801] [2019-11-27 22:36:09,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322314898] [2019-11-27 22:36:09,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-27 22:36:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:10,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:36:10,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:36:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-27 22:36:10,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:36:10,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:36:10,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319465240] [2019-11-27 22:36:10,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:36:10,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:10,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:36:10,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:36:10,270 INFO L87 Difference]: Start difference. First operand 2321 states and 2884 transitions. Second operand 4 states. [2019-11-27 22:36:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:10,457 INFO L93 Difference]: Finished difference Result 3916 states and 4894 transitions. [2019-11-27 22:36:10,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:36:10,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 598 [2019-11-27 22:36:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:10,458 INFO L225 Difference]: With dead ends: 3916 [2019-11-27 22:36:10,459 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:36:10,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:36:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:36:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:36:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:36:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:36:10,463 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 598 [2019-11-27 22:36:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:10,464 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:36:10,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:36:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:36:10,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:36:10,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:36:10,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:36:10,835 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-11-27 22:36:12,154 WARN L192 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 340 DAG size of output: 211 [2019-11-27 22:36:13,388 WARN L192 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 211 [2019-11-27 22:36:13,879 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-11-27 22:36:14,259 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-27 22:36:14,609 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-11-27 22:36:14,873 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 24 [2019-11-27 22:36:15,091 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 24 [2019-11-27 22:36:15,454 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-11-27 22:36:18,139 WARN L192 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 176 DAG size of output: 103 [2019-11-27 22:36:18,495 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-11-27 22:36:18,923 WARN L192 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 44 [2019-11-27 22:36:19,176 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-11-27 22:36:19,415 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 25 [2019-11-27 22:36:19,731 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2019-11-27 22:36:20,042 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-27 22:36:20,459 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-11-27 22:36:20,838 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2019-11-27 22:36:21,247 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-11-27 22:36:23,806 WARN L192 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 176 DAG size of output: 103 [2019-11-27 22:36:24,079 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-11-27 22:36:24,347 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-11-27 22:36:24,623 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 19 [2019-11-27 22:36:24,894 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-11-27 22:36:24,899 INFO L246 CegarLoopResult]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-11-27 22:36:24,899 INFO L246 CegarLoopResult]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-11-27 22:36:24,899 INFO L246 CegarLoopResult]: For program point L333(lines 333 363) no Hoare annotation was computed. [2019-11-27 22:36:24,900 INFO L242 CegarLoopResult]: At program point L201(lines 197 546) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2))) [2019-11-27 22:36:24,902 INFO L242 CegarLoopResult]: At program point L102(lines 101 578) the Hoare annotation is: false [2019-11-27 22:36:24,904 INFO L249 CegarLoopResult]: At program point L598(lines 97 599) the Hoare annotation is: true [2019-11-27 22:36:24,904 INFO L246 CegarLoopResult]: For program point L532(lines 532 534) no Hoare annotation was computed. [2019-11-27 22:36:24,904 INFO L246 CegarLoopResult]: For program point L203(lines 203 544) no Hoare annotation was computed. [2019-11-27 22:36:24,904 INFO L246 CegarLoopResult]: For program point L170(lines 170 555) no Hoare annotation was computed. [2019-11-27 22:36:24,905 INFO L246 CegarLoopResult]: For program point L137(lines 137 566) no Hoare annotation was computed. [2019-11-27 22:36:24,905 INFO L246 CegarLoopResult]: For program point L104(lines 104 577) no Hoare annotation was computed. [2019-11-27 22:36:24,906 INFO L246 CegarLoopResult]: For program point L303(lines 303 310) no Hoare annotation was computed. [2019-11-27 22:36:24,906 INFO L246 CegarLoopResult]: For program point L303-2(lines 303 310) no Hoare annotation was computed. [2019-11-27 22:36:24,906 INFO L242 CegarLoopResult]: At program point L204(lines 203 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-27 22:36:24,906 INFO L242 CegarLoopResult]: At program point L171(lines 167 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse5 .cse6 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-27 22:36:24,908 INFO L242 CegarLoopResult]: At program point L138(lines 134 567) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-11-27 22:36:24,908 INFO L246 CegarLoopResult]: For program point L338(lines 338 361) no Hoare annotation was computed. [2019-11-27 22:36:24,909 INFO L242 CegarLoopResult]: At program point L206(lines 205 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-27 22:36:24,909 INFO L246 CegarLoopResult]: For program point L173(lines 173 554) no Hoare annotation was computed. [2019-11-27 22:36:24,909 INFO L246 CegarLoopResult]: For program point L140(lines 140 565) no Hoare annotation was computed. [2019-11-27 22:36:24,911 INFO L246 CegarLoopResult]: For program point L107(lines 107 576) no Hoare annotation was computed. [2019-11-27 22:36:24,911 INFO L246 CegarLoopResult]: For program point L603(lines 603 605) no Hoare annotation was computed. [2019-11-27 22:36:24,911 INFO L246 CegarLoopResult]: For program point L603-2(lines 603 605) no Hoare annotation was computed. [2019-11-27 22:36:24,911 INFO L246 CegarLoopResult]: For program point L504(lines 504 507) no Hoare annotation was computed. [2019-11-27 22:36:24,911 INFO L246 CegarLoopResult]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-11-27 22:36:24,911 INFO L246 CegarLoopResult]: For program point L273-2(lines 207 541) no Hoare annotation was computed. [2019-11-27 22:36:24,911 INFO L246 CegarLoopResult]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-11-27 22:36:24,911 INFO L246 CegarLoopResult]: For program point L307(lines 307 309) no Hoare annotation was computed. [2019-11-27 22:36:24,912 INFO L246 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-27 22:36:24,912 INFO L246 CegarLoopResult]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2019-11-27 22:36:24,912 INFO L246 CegarLoopResult]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-11-27 22:36:24,912 INFO L246 CegarLoopResult]: For program point L176(lines 176 553) no Hoare annotation was computed. [2019-11-27 22:36:24,912 INFO L246 CegarLoopResult]: For program point L143(lines 143 564) no Hoare annotation was computed. [2019-11-27 22:36:24,912 INFO L246 CegarLoopResult]: For program point L110(lines 110 575) no Hoare annotation was computed. [2019-11-27 22:36:24,912 INFO L246 CegarLoopResult]: For program point L474(lines 474 476) no Hoare annotation was computed. [2019-11-27 22:36:24,912 INFO L246 CegarLoopResult]: For program point L375(lines 375 407) no Hoare annotation was computed. [2019-11-27 22:36:24,912 INFO L246 CegarLoopResult]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-11-27 22:36:24,912 INFO L242 CegarLoopResult]: At program point L210(lines 104 577) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2) (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2))) [2019-11-27 22:36:24,913 INFO L242 CegarLoopResult]: At program point L177(lines 173 554) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse5 .cse6 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-27 22:36:24,913 INFO L242 CegarLoopResult]: At program point L144(lines 140 565) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-11-27 22:36:24,913 INFO L246 CegarLoopResult]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-11-27 22:36:24,913 INFO L246 CegarLoopResult]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-11-27 22:36:24,913 INFO L249 CegarLoopResult]: At program point L608(lines 10 610) the Hoare annotation is: true [2019-11-27 22:36:24,914 INFO L242 CegarLoopResult]: At program point L542(lines 98 597) the Hoare annotation is: (let ((.cse21 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse29 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse27 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse2 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse23 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (not .cse10)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse26 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse24 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse22 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (not .cse29)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse12 (not .cse21)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse19 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse15 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse8) (and .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse20 .cse9 .cse10) (and .cse21 .cse15 .cse10) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse22 .cse8 .cse23 .cse3) (and .cse0 .cse24 .cse25 .cse26) (and .cse27 .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (and .cse4 .cse24 .cse6) (and .cse7 .cse24) (and .cse27 .cse5 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse27 .cse24 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse4 .cse1 .cse2) (and .cse11 .cse5 .cse13 .cse14 .cse16 .cse22 .cse6 .cse20 .cse9) (and .cse0 .cse5 .cse25 .cse26 .cse10) (and .cse7 .cse5) (and .cse4 .cse15 .cse6 .cse10) (and .cse5 .cse18 .cse26) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse22 .cse23 .cse10) (and .cse11 .cse13 .cse14 .cse24 .cse16 .cse22 .cse17 .cse6 .cse20 .cse9) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse0 .cse25 .cse15 .cse26 .cse3) (and .cse5 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse7 .cse15) (and .cse8 .cse18 .cse26 .cse3) (and .cse0 .cse4 .cse25 .cse15 .cse26) (and .cse24 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse15 .cse29 .cse10)))) [2019-11-27 22:36:24,914 INFO L246 CegarLoopResult]: For program point L179(lines 179 552) no Hoare annotation was computed. [2019-11-27 22:36:24,914 INFO L246 CegarLoopResult]: For program point L146(lines 146 563) no Hoare annotation was computed. [2019-11-27 22:36:24,915 INFO L246 CegarLoopResult]: For program point L113(lines 113 574) no Hoare annotation was computed. [2019-11-27 22:36:24,915 INFO L246 CegarLoopResult]: For program point L477(lines 477 481) no Hoare annotation was computed. [2019-11-27 22:36:24,915 INFO L246 CegarLoopResult]: For program point L477-2(lines 477 481) no Hoare annotation was computed. [2019-11-27 22:36:24,915 INFO L246 CegarLoopResult]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-27 22:36:24,915 INFO L246 CegarLoopResult]: For program point L512(lines 512 514) no Hoare annotation was computed. [2019-11-27 22:36:24,915 INFO L246 CegarLoopResult]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-27 22:36:24,916 INFO L246 CegarLoopResult]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-27 22:36:24,916 INFO L246 CegarLoopResult]: For program point L182(lines 182 551) no Hoare annotation was computed. [2019-11-27 22:36:24,916 INFO L246 CegarLoopResult]: For program point L149(lines 149 562) no Hoare annotation was computed. [2019-11-27 22:36:24,916 INFO L246 CegarLoopResult]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-27 22:36:24,916 INFO L246 CegarLoopResult]: For program point L116(lines 116 573) no Hoare annotation was computed. [2019-11-27 22:36:24,916 INFO L246 CegarLoopResult]: For program point L579(lines 579 595) no Hoare annotation was computed. [2019-11-27 22:36:24,917 INFO L242 CegarLoopResult]: At program point L513(lines 71 609) the Hoare annotation is: false [2019-11-27 22:36:24,917 INFO L242 CegarLoopResult]: At program point L183(lines 179 552) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0))) [2019-11-27 22:36:24,917 INFO L242 CegarLoopResult]: At program point L150(lines 146 563) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-11-27 22:36:24,917 INFO L246 CegarLoopResult]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-27 22:36:24,918 INFO L246 CegarLoopResult]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-27 22:36:24,918 INFO L246 CegarLoopResult]: For program point L580(lines 580 594) no Hoare annotation was computed. [2019-11-27 22:36:24,918 INFO L246 CegarLoopResult]: For program point L349(lines 349 357) no Hoare annotation was computed. [2019-11-27 22:36:24,918 INFO L246 CegarLoopResult]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-11-27 22:36:24,918 INFO L246 CegarLoopResult]: For program point L515(lines 515 517) no Hoare annotation was computed. [2019-11-27 22:36:24,918 INFO L246 CegarLoopResult]: For program point L581-2(lines 580 594) no Hoare annotation was computed. [2019-11-27 22:36:24,919 INFO L242 CegarLoopResult]: At program point L350(lines 326 368) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-11-27 22:36:24,919 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:36:24,919 INFO L246 CegarLoopResult]: For program point L185(lines 185 550) no Hoare annotation was computed. [2019-11-27 22:36:24,919 INFO L246 CegarLoopResult]: For program point L152(lines 152 561) no Hoare annotation was computed. [2019-11-27 22:36:24,919 INFO L246 CegarLoopResult]: For program point L119(lines 119 572) no Hoare annotation was computed. [2019-11-27 22:36:24,920 INFO L246 CegarLoopResult]: For program point L417(lines 417 419) no Hoare annotation was computed. [2019-11-27 22:36:24,920 INFO L242 CegarLoopResult]: At program point L384(lines 375 407) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-27 22:36:24,920 INFO L242 CegarLoopResult]: At program point L120(lines 116 573) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse0 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-11-27 22:36:24,920 INFO L246 CegarLoopResult]: For program point L583(lines 583 585) no Hoare annotation was computed. [2019-11-27 22:36:24,920 INFO L246 CegarLoopResult]: For program point L352(lines 352 354) no Hoare annotation was computed. [2019-11-27 22:36:24,921 INFO L246 CegarLoopResult]: For program point L286(lines 286 288) no Hoare annotation was computed. [2019-11-27 22:36:24,921 INFO L246 CegarLoopResult]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-27 22:36:24,921 INFO L246 CegarLoopResult]: For program point L286-2(lines 207 541) no Hoare annotation was computed. [2019-11-27 22:36:24,921 INFO L246 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-11-27 22:36:24,921 INFO L246 CegarLoopResult]: For program point L320-2(lines 207 541) no Hoare annotation was computed. [2019-11-27 22:36:24,922 INFO L246 CegarLoopResult]: For program point L188(lines 188 549) no Hoare annotation was computed. [2019-11-27 22:36:24,922 INFO L246 CegarLoopResult]: For program point L155(lines 155 560) no Hoare annotation was computed. [2019-11-27 22:36:24,922 INFO L246 CegarLoopResult]: For program point L122(lines 122 571) no Hoare annotation was computed. [2019-11-27 22:36:24,922 INFO L246 CegarLoopResult]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-27 22:36:24,922 INFO L246 CegarLoopResult]: For program point L89-1(lines 71 609) no Hoare annotation was computed. [2019-11-27 22:36:24,923 INFO L246 CegarLoopResult]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-27 22:36:24,923 INFO L246 CegarLoopResult]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-11-27 22:36:24,923 INFO L246 CegarLoopResult]: For program point L387(lines 387 405) no Hoare annotation was computed. [2019-11-27 22:36:24,923 INFO L242 CegarLoopResult]: At program point L189(lines 185 550) the Hoare annotation is: (let ((.cse5 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3 .cse4 .cse6) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4 .cse6))) [2019-11-27 22:36:24,924 INFO L242 CegarLoopResult]: At program point L156(lines 152 561) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-27 22:36:24,924 INFO L242 CegarLoopResult]: At program point L123(lines 122 571) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-27 22:36:24,924 INFO L246 CegarLoopResult]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-27 22:36:24,924 INFO L246 CegarLoopResult]: For program point L487(lines 487 490) no Hoare annotation was computed. [2019-11-27 22:36:24,924 INFO L246 CegarLoopResult]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-11-27 22:36:24,925 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:36:24,925 INFO L249 CegarLoopResult]: At program point L620(lines 611 622) the Hoare annotation is: true [2019-11-27 22:36:24,925 INFO L246 CegarLoopResult]: For program point L191(lines 191 548) no Hoare annotation was computed. [2019-11-27 22:36:24,925 INFO L246 CegarLoopResult]: For program point L158(lines 158 559) no Hoare annotation was computed. [2019-11-27 22:36:24,925 INFO L246 CegarLoopResult]: For program point L125(lines 125 570) no Hoare annotation was computed. [2019-11-27 22:36:24,925 INFO L246 CegarLoopResult]: For program point L588(lines 588 592) no Hoare annotation was computed. [2019-11-27 22:36:24,926 INFO L246 CegarLoopResult]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-11-27 22:36:24,926 INFO L246 CegarLoopResult]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-27 22:36:24,926 INFO L246 CegarLoopResult]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-11-27 22:36:24,926 INFO L246 CegarLoopResult]: For program point L225-2(lines 207 541) no Hoare annotation was computed. [2019-11-27 22:36:24,926 INFO L246 CegarLoopResult]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-11-27 22:36:24,926 INFO L246 CegarLoopResult]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-11-27 22:36:24,927 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:36:24,927 INFO L246 CegarLoopResult]: For program point L425-1(lines 425 433) no Hoare annotation was computed. [2019-11-27 22:36:24,927 INFO L246 CegarLoopResult]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-27 22:36:24,927 INFO L246 CegarLoopResult]: For program point L194(lines 194 547) no Hoare annotation was computed. [2019-11-27 22:36:24,927 INFO L246 CegarLoopResult]: For program point L161(lines 161 558) no Hoare annotation was computed. [2019-11-27 22:36:24,927 INFO L246 CegarLoopResult]: For program point L128(lines 128 569) no Hoare annotation was computed. [2019-11-27 22:36:24,928 INFO L246 CegarLoopResult]: For program point L492(lines 492 498) no Hoare annotation was computed. [2019-11-27 22:36:24,928 INFO L242 CegarLoopResult]: At program point L195(lines 191 548) the Hoare annotation is: (let ((.cse1 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (not .cse4)) (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) (and .cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3))) [2019-11-27 22:36:24,928 INFO L242 CegarLoopResult]: At program point L162(lines 158 559) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-27 22:36:24,928 INFO L246 CegarLoopResult]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-11-27 22:36:24,928 INFO L246 CegarLoopResult]: For program point L329(lines 329 367) no Hoare annotation was computed. [2019-11-27 22:36:24,929 INFO L246 CegarLoopResult]: For program point L197(lines 197 546) no Hoare annotation was computed. [2019-11-27 22:36:24,929 INFO L246 CegarLoopResult]: For program point L164(lines 164 557) no Hoare annotation was computed. [2019-11-27 22:36:24,929 INFO L246 CegarLoopResult]: For program point L131(lines 131 568) no Hoare annotation was computed. [2019-11-27 22:36:24,929 INFO L242 CegarLoopResult]: At program point L98-2(lines 98 597) the Hoare annotation is: (let ((.cse21 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse29 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse27 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse2 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse23 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (not .cse10)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse26 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse24 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse22 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (not .cse29)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse12 (not .cse21)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse19 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse15 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse8) (and .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse20 .cse9 .cse10) (and .cse21 .cse15 .cse10) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse22 .cse8 .cse23 .cse3) (and .cse0 .cse24 .cse25 .cse26) (and .cse27 .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (and .cse4 .cse24 .cse6) (and .cse7 .cse24) (and .cse27 .cse5 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse27 .cse24 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse4 .cse1 .cse2) (and .cse11 .cse5 .cse13 .cse14 .cse16 .cse22 .cse6 .cse20 .cse9) (and .cse0 .cse5 .cse25 .cse26 .cse10) (and .cse7 .cse5) (and .cse4 .cse15 .cse6 .cse10) (and .cse5 .cse18 .cse26) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse22 .cse23 .cse10) (and .cse11 .cse13 .cse14 .cse24 .cse16 .cse22 .cse17 .cse6 .cse20 .cse9) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse0 .cse25 .cse15 .cse26 .cse3) (and .cse5 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse7 .cse15) (and .cse8 .cse18 .cse26 .cse3) (and .cse0 .cse4 .cse25 .cse15 .cse26) (and .cse24 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse15 .cse29 .cse10)))) [2019-11-27 22:36:24,930 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 607) no Hoare annotation was computed. [2019-11-27 22:36:24,930 INFO L246 CegarLoopResult]: For program point L495(lines 495 497) no Hoare annotation was computed. [2019-11-27 22:36:24,930 INFO L246 CegarLoopResult]: For program point L495-2(lines 207 541) no Hoare annotation was computed. [2019-11-27 22:36:24,930 INFO L242 CegarLoopResult]: At program point L396(lines 387 405) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-27 22:36:24,930 INFO L246 CegarLoopResult]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-11-27 22:36:24,930 INFO L242 CegarLoopResult]: At program point L165(lines 164 557) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and .cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3) (and .cse0 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse2 (not .cse3)))) [2019-11-27 22:36:24,931 INFO L242 CegarLoopResult]: At program point L132(lines 125 570) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-11-27 22:36:24,931 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-27 22:36:24,931 INFO L246 CegarLoopResult]: For program point L529(lines 529 535) no Hoare annotation was computed. [2019-11-27 22:36:24,931 INFO L246 CegarLoopResult]: For program point L529-1(lines 529 535) no Hoare annotation was computed. [2019-11-27 22:36:24,931 INFO L246 CegarLoopResult]: For program point L332(lines 332 366) no Hoare annotation was computed. [2019-11-27 22:36:24,931 INFO L246 CegarLoopResult]: For program point L332-1(lines 332 366) no Hoare annotation was computed. [2019-11-27 22:36:24,931 INFO L246 CegarLoopResult]: For program point L200(lines 200 545) no Hoare annotation was computed. [2019-11-27 22:36:24,931 INFO L246 CegarLoopResult]: For program point L167(lines 167 556) no Hoare annotation was computed. [2019-11-27 22:36:24,932 INFO L246 CegarLoopResult]: For program point L134(lines 134 567) no Hoare annotation was computed. [2019-11-27 22:36:24,932 INFO L246 CegarLoopResult]: For program point L101(lines 101 578) no Hoare annotation was computed. [2019-11-27 22:36:24,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:36:24 BoogieIcfgContainer [2019-11-27 22:36:24,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:36:24,995 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:36:24,995 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:36:24,995 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:36:24,996 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:53" (3/4) ... [2019-11-27 22:36:25,000 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:36:25,035 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:36:25,036 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:36:25,217 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:36:25,218 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:36:25,220 INFO L168 Benchmark]: Toolchain (without parser) took 33027.61 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 956.3 MB in the beginning and 1.7 GB in the end (delta: -776.7 MB). Peak memory consumption was 352.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:25,220 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:36:25,221 INFO L168 Benchmark]: CACSL2BoogieTranslator took 505.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 60.8 MB). Free memory was 956.3 MB in the beginning and 1.0 GB in the end (delta: -92.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:25,221 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:36:25,221 INFO L168 Benchmark]: Boogie Preprocessor took 47.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:25,222 INFO L168 Benchmark]: RCFGBuilder took 911.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 981.2 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:25,222 INFO L168 Benchmark]: TraceAbstraction took 31265.06 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 981.2 MB in the beginning and 1.8 GB in the end (delta: -779.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-27 22:36:25,222 INFO L168 Benchmark]: Witness Printer took 223.50 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:25,225 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 505.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 60.8 MB). Free memory was 956.3 MB in the beginning and 1.0 GB in the end (delta: -92.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 911.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 981.2 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31265.06 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 981.2 MB in the beginning and 1.8 GB in the end (delta: -779.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 223.50 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 607]: 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: (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) || (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && 2 == blastFlag) && s__state <= 8448) && 0 == s__hit) || (((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && 0 == blastFlag) && s__state <= 8448)) || (((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && !(s__state == 8448)) && s__state <= 8448) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292)) && !(0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 12292))) || ((1 == blastFlag && 8672 <= s__state) && !(s__state == 12292))) || ((8672 <= s__state && 0 == blastFlag) && !(s__state == 12292)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && !(0 == s__hit)) || ((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((((((((((((!(s__state == 8545) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8528) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit)) || ((s__state == 8544 && 2 == blastFlag) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state)) || ((((((((((((s__state == 8592 && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && 0 == blastFlag)) || ((((((((((((s__state == 8592 && 1 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || ((((((((((((s__state == 8592 && 0 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || ((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state) && 0 == s__hit)) || (s__state <= 3 && 1 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && s__state <= 8576) && 0 == s__hit)) || ((1 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) && s__state == 8512)) || ((((s__state <= 8672 && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state) && !(0 == s__hit))) || ((((((((((((1 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || (s__state <= 3 && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state)) || ((((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || ((2 == blastFlag && s__state == 8560) && 0 == s__hit) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) || (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 8544) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) || (((((((((!(s__state == 8544) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((!(s__state == 8544) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) || ((((s__state <= 8672 && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && 0 == s__hit)) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && 8448 <= s__state) && s__state <= 8448) || (((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && 8448 <= s__state) && s__state <= 8448)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || ((((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit)) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) || (((((s__state <= 8672 && !(s__state == 8656)) && 0 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state)) || ((((((s__state <= 8672 && !(s__state == 8656)) && !(s__state == 8657)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit))) || ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8657)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state)) || ((((((s__state <= 8672 && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && !(0 == s__hit)) || ((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((((((((((((!(s__state == 8545) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8528) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit)) || ((s__state == 8544 && 2 == blastFlag) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state)) || ((((((((((((s__state == 8592 && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && 0 == blastFlag)) || ((((((((((((s__state == 8592 && 1 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || ((((((((((((s__state == 8592 && 0 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || ((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state) && 0 == s__hit)) || (s__state <= 3 && 1 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && s__state <= 8576) && 0 == s__hit)) || ((1 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) && s__state == 8512)) || ((((s__state <= 8672 && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state) && !(0 == s__hit))) || ((((((((((((1 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || (s__state <= 3 && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state)) || ((((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || ((2 == blastFlag && s__state == 8560) && 0 == s__hit) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && s__state == 8608) && 0 == s__hit) || (1 == blastFlag && s__state == 8608)) || (0 == blastFlag && s__state == 8608) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: SAFE, OverallTime: 16.8s, OverallIterations: 35, TraceHistogramMax: 19, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.2s, HoareTripleCheckerStatistics: 6655 SDtfs, 4128 SDslu, 3144 SDs, 0 SdLazy, 3455 SolverSat, 958 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1979 GetRequests, 1934 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4085occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 4500 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 241 NumberOfFragments, 3545 HoareAnnotationTreeSize, 28 FomulaSimplifications, 146928 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 28 FomulaSimplificationsInter, 38499 FormulaSimplificationTreeSizeReductionInter, 11.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 9209 NumberOfCodeBlocks, 9209 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 9169 ConstructedInterpolants, 0 QuantifiedInterpolants, 3945115 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2970 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 40 InterpolantComputations, 31 PerfectInterpolantSequences, 30536/30750 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...