./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.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/bitvector/s3_clnt_3.BV.c.cil-1a.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 bb19220a89a4de9b41ceda2b5f420af7272fc928 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:33:56,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:33:56,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:33:56,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:33:56,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:33:56,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:33:56,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:33:56,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:33:56,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:33:56,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:33:56,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:33:56,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:33:56,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:33:56,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:33:56,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:33:56,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:33:56,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:33:56,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:33:56,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:33:56,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:33:56,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:33:56,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:33:56,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:33:56,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:33:56,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:33:56,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:33:56,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:33:56,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:33:56,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:33:56,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:33:56,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:33:56,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:33:56,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:33:56,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:33:56,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:33:56,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:33:56,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:33:56,964 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:33:56,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:33:56,965 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:33:56,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:33:56,966 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:33:56,981 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:33:56,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:33:56,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:33:56,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:33:56,983 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:33:56,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:33:56,984 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:33:56,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:33:56,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:33:56,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:33:56,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:33:56,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:33:56,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:33:56,986 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:33:56,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:33:56,987 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:33:56,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:33:56,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:33:56,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:33:56,988 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:33:56,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:33:56,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:33:56,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:33:56,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:33:56,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:33:56,989 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:33:56,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:33:56,990 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:33:56,990 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 -> bb19220a89a4de9b41ceda2b5f420af7272fc928 [2019-11-27 22:33:57,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:33:57,290 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:33:57,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:33:57,295 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:33:57,295 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:33:57,296 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2019-11-27 22:33:57,372 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13eaa5973/24b887f7bb07493da09ce249de9a1f40/FLAG35dd4e04b [2019-11-27 22:33:57,893 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:33:57,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2019-11-27 22:33:57,904 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13eaa5973/24b887f7bb07493da09ce249de9a1f40/FLAG35dd4e04b [2019-11-27 22:33:58,237 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13eaa5973/24b887f7bb07493da09ce249de9a1f40 [2019-11-27 22:33:58,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:33:58,245 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:33:58,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:33:58,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:33:58,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:33:58,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:33:58" (1/1) ... [2019-11-27 22:33:58,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40258f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:58, skipping insertion in model container [2019-11-27 22:33:58,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:33:58" (1/1) ... [2019-11-27 22:33:58,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:33:58,319 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:33:58,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:33:58,683 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:33:58,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:33:58,758 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:33:58,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:58 WrapperNode [2019-11-27 22:33:58,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:33:58,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:33:58,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:33:58,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:33:58,773 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:33:58" (1/1) ... [2019-11-27 22:33:58,781 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:33:58" (1/1) ... [2019-11-27 22:33:58,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:33:58,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:33:58,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:33:58,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:33:58,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:58" (1/1) ... [2019-11-27 22:33:58,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:58" (1/1) ... [2019-11-27 22:33:58,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:58" (1/1) ... [2019-11-27 22:33:58,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:58" (1/1) ... [2019-11-27 22:33:58,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:58" (1/1) ... [2019-11-27 22:33:58,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:58" (1/1) ... [2019-11-27 22:33:58,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:58" (1/1) ... [2019-11-27 22:33:58,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:33:58,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:33:58,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:33:58,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:33:58,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:58" (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:33:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:33:58,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:33:59,115 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:33:59,607 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-27 22:33:59,607 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-27 22:33:59,611 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:33:59,612 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:33:59,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:33:59 BoogieIcfgContainer [2019-11-27 22:33:59,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:33:59,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:33:59,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:33:59,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:33:59,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:33:58" (1/3) ... [2019-11-27 22:33:59,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc133ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:33:59, skipping insertion in model container [2019-11-27 22:33:59,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:58" (2/3) ... [2019-11-27 22:33:59,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc133ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:33:59, skipping insertion in model container [2019-11-27 22:33:59,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:33:59" (3/3) ... [2019-11-27 22:33:59,623 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2019-11-27 22:33:59,633 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:33:59,642 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:33:59,654 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:33:59,681 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:33:59,681 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:33:59,682 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:33:59,682 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:33:59,682 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:33:59,682 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:33:59,683 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:33:59,683 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:33:59,711 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-11-27 22:33:59,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:33:59,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:59,722 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] [2019-11-27 22:33:59,722 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:59,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:59,729 INFO L82 PathProgramCache]: Analyzing trace with hash 511659491, now seen corresponding path program 1 times [2019-11-27 22:33:59,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:59,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329135760] [2019-11-27 22:33:59,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:59,992 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:33:59,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329135760] [2019-11-27 22:33:59,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:33:59,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:33:59,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100809419] [2019-11-27 22:34:00,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:00,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:00,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:00,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:00,019 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-11-27 22:34:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:00,236 INFO L93 Difference]: Finished difference Result 246 states and 422 transitions. [2019-11-27 22:34:00,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:00,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-27 22:34:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:00,254 INFO L225 Difference]: With dead ends: 246 [2019-11-27 22:34:00,254 INFO L226 Difference]: Without dead ends: 112 [2019-11-27 22:34:00,258 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:34:00,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-27 22:34:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-11-27 22:34:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-27 22:34:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2019-11-27 22:34:00,306 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 24 [2019-11-27 22:34:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:00,306 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2019-11-27 22:34:00,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:00,307 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2019-11-27 22:34:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 22:34:00,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:00,309 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:00,309 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:00,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:00,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1971493731, now seen corresponding path program 1 times [2019-11-27 22:34:00,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:00,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336465115] [2019-11-27 22:34:00,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:00,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336465115] [2019-11-27 22:34:00,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:00,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:00,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353225397] [2019-11-27 22:34:00,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:00,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:00,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:00,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:00,390 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand 3 states. [2019-11-27 22:34:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:00,581 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-27 22:34:00,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:00,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-27 22:34:00,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:00,584 INFO L225 Difference]: With dead ends: 232 [2019-11-27 22:34:00,586 INFO L226 Difference]: Without dead ends: 130 [2019-11-27 22:34:00,587 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:34:00,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-27 22:34:00,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-11-27 22:34:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-27 22:34:00,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 190 transitions. [2019-11-27 22:34:00,614 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 190 transitions. Word has length 36 [2019-11-27 22:34:00,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:00,614 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 190 transitions. [2019-11-27 22:34:00,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 190 transitions. [2019-11-27 22:34:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 22:34:00,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:00,619 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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:34:00,620 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:00,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:00,621 INFO L82 PathProgramCache]: Analyzing trace with hash 441356492, now seen corresponding path program 1 times [2019-11-27 22:34:00,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:00,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715015736] [2019-11-27 22:34:00,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:00,776 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:34:00,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715015736] [2019-11-27 22:34:00,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:00,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:00,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509808] [2019-11-27 22:34:00,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:00,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:00,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:00,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:00,783 INFO L87 Difference]: Start difference. First operand 127 states and 190 transitions. Second operand 3 states. [2019-11-27 22:34:00,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:00,949 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2019-11-27 22:34:00,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:00,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-27 22:34:00,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:00,952 INFO L225 Difference]: With dead ends: 265 [2019-11-27 22:34:00,952 INFO L226 Difference]: Without dead ends: 148 [2019-11-27 22:34:00,953 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:34:00,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-27 22:34:00,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-11-27 22:34:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-27 22:34:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 212 transitions. [2019-11-27 22:34:00,965 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 212 transitions. Word has length 50 [2019-11-27 22:34:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:00,966 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 212 transitions. [2019-11-27 22:34:00,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 212 transitions. [2019-11-27 22:34:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:34:00,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:00,968 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:00,968 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:00,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:00,969 INFO L82 PathProgramCache]: Analyzing trace with hash -394489400, now seen corresponding path program 1 times [2019-11-27 22:34:00,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:00,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206849158] [2019-11-27 22:34:00,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:34:01,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206849158] [2019-11-27 22:34:01,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:01,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:01,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021400574] [2019-11-27 22:34:01,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:01,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:01,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:01,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:01,063 INFO L87 Difference]: Start difference. First operand 144 states and 212 transitions. Second operand 3 states. [2019-11-27 22:34:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:01,110 INFO L93 Difference]: Finished difference Result 410 states and 605 transitions. [2019-11-27 22:34:01,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:01,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-27 22:34:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:01,114 INFO L225 Difference]: With dead ends: 410 [2019-11-27 22:34:01,114 INFO L226 Difference]: Without dead ends: 276 [2019-11-27 22:34:01,115 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:34:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-27 22:34:01,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2019-11-27 22:34:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-27 22:34:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 405 transitions. [2019-11-27 22:34:01,150 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 405 transitions. Word has length 67 [2019-11-27 22:34:01,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:01,150 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 405 transitions. [2019-11-27 22:34:01,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 405 transitions. [2019-11-27 22:34:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-27 22:34:01,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:01,154 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:01,154 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:01,155 INFO L82 PathProgramCache]: Analyzing trace with hash 625494152, now seen corresponding path program 1 times [2019-11-27 22:34:01,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:01,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189334602] [2019-11-27 22:34:01,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-27 22:34:01,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189334602] [2019-11-27 22:34:01,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:01,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:01,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064838714] [2019-11-27 22:34:01,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:01,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:01,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:01,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:01,282 INFO L87 Difference]: Start difference. First operand 276 states and 405 transitions. Second operand 3 states. [2019-11-27 22:34:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:01,432 INFO L93 Difference]: Finished difference Result 590 states and 878 transitions. [2019-11-27 22:34:01,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:01,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-27 22:34:01,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:01,435 INFO L225 Difference]: With dead ends: 590 [2019-11-27 22:34:01,436 INFO L226 Difference]: Without dead ends: 324 [2019-11-27 22:34:01,437 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:34:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-27 22:34:01,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 318. [2019-11-27 22:34:01,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-11-27 22:34:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 457 transitions. [2019-11-27 22:34:01,453 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 457 transitions. Word has length 85 [2019-11-27 22:34:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:01,454 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 457 transitions. [2019-11-27 22:34:01,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 457 transitions. [2019-11-27 22:34:01,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-27 22:34:01,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:01,457 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:01,457 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:01,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:01,458 INFO L82 PathProgramCache]: Analyzing trace with hash 743834560, now seen corresponding path program 1 times [2019-11-27 22:34:01,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:01,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936215269] [2019-11-27 22:34:01,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-27 22:34:01,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936215269] [2019-11-27 22:34:01,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:01,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:01,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219195859] [2019-11-27 22:34:01,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:01,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:01,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:01,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:01,541 INFO L87 Difference]: Start difference. First operand 318 states and 457 transitions. Second operand 3 states. [2019-11-27 22:34:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:01,588 INFO L93 Difference]: Finished difference Result 473 states and 680 transitions. [2019-11-27 22:34:01,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:01,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-27 22:34:01,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:01,592 INFO L225 Difference]: With dead ends: 473 [2019-11-27 22:34:01,592 INFO L226 Difference]: Without dead ends: 471 [2019-11-27 22:34:01,593 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:34:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-11-27 22:34:01,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2019-11-27 22:34:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-11-27 22:34:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 678 transitions. [2019-11-27 22:34:01,608 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 678 transitions. Word has length 105 [2019-11-27 22:34:01,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:01,609 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 678 transitions. [2019-11-27 22:34:01,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 678 transitions. [2019-11-27 22:34:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-27 22:34:01,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:01,612 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 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] [2019-11-27 22:34:01,612 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:01,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:01,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1167688199, now seen corresponding path program 1 times [2019-11-27 22:34:01,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:01,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390145420] [2019-11-27 22:34:01,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-27 22:34:01,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390145420] [2019-11-27 22:34:01,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:01,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:01,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131627119] [2019-11-27 22:34:01,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:01,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:01,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:01,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:01,722 INFO L87 Difference]: Start difference. First operand 471 states and 678 transitions. Second operand 3 states. [2019-11-27 22:34:01,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:01,937 INFO L93 Difference]: Finished difference Result 1082 states and 1605 transitions. [2019-11-27 22:34:01,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:01,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-27 22:34:01,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:01,942 INFO L225 Difference]: With dead ends: 1082 [2019-11-27 22:34:01,942 INFO L226 Difference]: Without dead ends: 618 [2019-11-27 22:34:01,943 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:34:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-27 22:34:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 594. [2019-11-27 22:34:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-11-27 22:34:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 876 transitions. [2019-11-27 22:34:01,964 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 876 transitions. Word has length 123 [2019-11-27 22:34:01,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:01,965 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 876 transitions. [2019-11-27 22:34:01,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:01,965 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 876 transitions. [2019-11-27 22:34:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-27 22:34:01,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:01,968 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 7, 7, 7, 5, 5, 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] [2019-11-27 22:34:01,969 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:01,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:01,969 INFO L82 PathProgramCache]: Analyzing trace with hash -266344288, now seen corresponding path program 1 times [2019-11-27 22:34:01,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:01,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092413503] [2019-11-27 22:34:01,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-27 22:34:02,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092413503] [2019-11-27 22:34:02,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:02,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:02,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668221141] [2019-11-27 22:34:02,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:02,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:02,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:02,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:02,037 INFO L87 Difference]: Start difference. First operand 594 states and 876 transitions. Second operand 3 states. [2019-11-27 22:34:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:02,209 INFO L93 Difference]: Finished difference Result 1456 states and 2204 transitions. [2019-11-27 22:34:02,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:02,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-27 22:34:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:02,215 INFO L225 Difference]: With dead ends: 1456 [2019-11-27 22:34:02,215 INFO L226 Difference]: Without dead ends: 821 [2019-11-27 22:34:02,216 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:34:02,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-11-27 22:34:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 783. [2019-11-27 22:34:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-11-27 22:34:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1128 transitions. [2019-11-27 22:34:02,238 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1128 transitions. Word has length 149 [2019-11-27 22:34:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:02,238 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1128 transitions. [2019-11-27 22:34:02,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1128 transitions. [2019-11-27 22:34:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-27 22:34:02,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:02,242 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 4, 4, 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, 1] [2019-11-27 22:34:02,242 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:02,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:02,242 INFO L82 PathProgramCache]: Analyzing trace with hash -466571119, now seen corresponding path program 1 times [2019-11-27 22:34:02,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:02,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243557696] [2019-11-27 22:34:02,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-11-27 22:34:02,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243557696] [2019-11-27 22:34:02,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:02,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:02,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561363156] [2019-11-27 22:34:02,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:02,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:02,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:02,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:02,301 INFO L87 Difference]: Start difference. First operand 783 states and 1128 transitions. Second operand 3 states. [2019-11-27 22:34:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:02,462 INFO L93 Difference]: Finished difference Result 1712 states and 2481 transitions. [2019-11-27 22:34:02,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:02,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-27 22:34:02,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:02,468 INFO L225 Difference]: With dead ends: 1712 [2019-11-27 22:34:02,468 INFO L226 Difference]: Without dead ends: 894 [2019-11-27 22:34:02,470 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:34:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-11-27 22:34:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 858. [2019-11-27 22:34:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-11-27 22:34:02,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1224 transitions. [2019-11-27 22:34:02,493 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1224 transitions. Word has length 170 [2019-11-27 22:34:02,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:02,493 INFO L462 AbstractCegarLoop]: Abstraction has 858 states and 1224 transitions. [2019-11-27 22:34:02,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:02,494 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1224 transitions. [2019-11-27 22:34:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-27 22:34:02,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:02,497 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 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, 1, 1, 1] [2019-11-27 22:34:02,497 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:02,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:02,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1681812864, now seen corresponding path program 1 times [2019-11-27 22:34:02,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:02,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10383595] [2019-11-27 22:34:02,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-27 22:34:02,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10383595] [2019-11-27 22:34:02,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:02,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:02,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360794367] [2019-11-27 22:34:02,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:02,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:02,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:02,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:02,577 INFO L87 Difference]: Start difference. First operand 858 states and 1224 transitions. Second operand 3 states. [2019-11-27 22:34:02,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:02,762 INFO L93 Difference]: Finished difference Result 1862 states and 2673 transitions. [2019-11-27 22:34:02,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:02,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-11-27 22:34:02,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:02,769 INFO L225 Difference]: With dead ends: 1862 [2019-11-27 22:34:02,769 INFO L226 Difference]: Without dead ends: 987 [2019-11-27 22:34:02,771 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:34:02,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2019-11-27 22:34:02,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 951. [2019-11-27 22:34:02,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-11-27 22:34:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1356 transitions. [2019-11-27 22:34:02,798 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1356 transitions. Word has length 194 [2019-11-27 22:34:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:02,799 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 1356 transitions. [2019-11-27 22:34:02,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1356 transitions. [2019-11-27 22:34:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-27 22:34:02,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:02,803 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 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] [2019-11-27 22:34:02,803 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:02,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:02,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1348358718, now seen corresponding path program 1 times [2019-11-27 22:34:02,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:02,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506491903] [2019-11-27 22:34:02,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-27 22:34:02,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506491903] [2019-11-27 22:34:02,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:02,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:02,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495587650] [2019-11-27 22:34:02,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:02,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:02,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:02,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:02,901 INFO L87 Difference]: Start difference. First operand 951 states and 1356 transitions. Second operand 3 states. [2019-11-27 22:34:02,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:02,949 INFO L93 Difference]: Finished difference Result 2833 states and 4038 transitions. [2019-11-27 22:34:02,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:02,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-27 22:34:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:02,959 INFO L225 Difference]: With dead ends: 2833 [2019-11-27 22:34:02,960 INFO L226 Difference]: Without dead ends: 1892 [2019-11-27 22:34:02,962 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:34:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2019-11-27 22:34:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1890. [2019-11-27 22:34:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1890 states. [2019-11-27 22:34:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2693 transitions. [2019-11-27 22:34:03,038 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2693 transitions. Word has length 224 [2019-11-27 22:34:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:03,039 INFO L462 AbstractCegarLoop]: Abstraction has 1890 states and 2693 transitions. [2019-11-27 22:34:03,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2693 transitions. [2019-11-27 22:34:03,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-27 22:34:03,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:03,048 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 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] [2019-11-27 22:34:03,049 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:03,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:03,049 INFO L82 PathProgramCache]: Analyzing trace with hash 132204992, now seen corresponding path program 1 times [2019-11-27 22:34:03,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:03,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624165483] [2019-11-27 22:34:03,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-11-27 22:34:03,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624165483] [2019-11-27 22:34:03,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:03,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:03,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659591577] [2019-11-27 22:34:03,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:03,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:03,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:03,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:03,186 INFO L87 Difference]: Start difference. First operand 1890 states and 2693 transitions. Second operand 3 states. [2019-11-27 22:34:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:03,371 INFO L93 Difference]: Finished difference Result 4076 states and 5839 transitions. [2019-11-27 22:34:03,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:03,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-27 22:34:03,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:03,383 INFO L225 Difference]: With dead ends: 4076 [2019-11-27 22:34:03,383 INFO L226 Difference]: Without dead ends: 2166 [2019-11-27 22:34:03,386 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:34:03,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2019-11-27 22:34:03,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2100. [2019-11-27 22:34:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-11-27 22:34:03,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 3005 transitions. [2019-11-27 22:34:03,449 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 3005 transitions. Word has length 224 [2019-11-27 22:34:03,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:03,450 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 3005 transitions. [2019-11-27 22:34:03,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3005 transitions. [2019-11-27 22:34:03,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-27 22:34:03,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:03,456 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 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, 1, 1] [2019-11-27 22:34:03,457 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:03,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:03,457 INFO L82 PathProgramCache]: Analyzing trace with hash 912871510, now seen corresponding path program 1 times [2019-11-27 22:34:03,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:03,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498085508] [2019-11-27 22:34:03,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2019-11-27 22:34:03,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498085508] [2019-11-27 22:34:03,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:03,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:03,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8855171] [2019-11-27 22:34:03,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:03,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:03,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:03,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:03,567 INFO L87 Difference]: Start difference. First operand 2100 states and 3005 transitions. Second operand 3 states. [2019-11-27 22:34:03,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:03,772 INFO L93 Difference]: Finished difference Result 4256 states and 6073 transitions. [2019-11-27 22:34:03,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:03,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-11-27 22:34:03,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:03,788 INFO L225 Difference]: With dead ends: 4256 [2019-11-27 22:34:03,788 INFO L226 Difference]: Without dead ends: 2148 [2019-11-27 22:34:03,793 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:34:03,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2019-11-27 22:34:03,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2082. [2019-11-27 22:34:03,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2019-11-27 22:34:03,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2951 transitions. [2019-11-27 22:34:03,873 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2951 transitions. Word has length 259 [2019-11-27 22:34:03,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:03,874 INFO L462 AbstractCegarLoop]: Abstraction has 2082 states and 2951 transitions. [2019-11-27 22:34:03,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2951 transitions. [2019-11-27 22:34:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-27 22:34:03,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:03,885 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:03,885 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:03,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:03,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1837028224, now seen corresponding path program 1 times [2019-11-27 22:34:03,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:03,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656247315] [2019-11-27 22:34:03,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2019-11-27 22:34:04,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656247315] [2019-11-27 22:34:04,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:04,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:04,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109323030] [2019-11-27 22:34:04,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:04,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:04,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:04,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:04,145 INFO L87 Difference]: Start difference. First operand 2082 states and 2951 transitions. Second operand 3 states. [2019-11-27 22:34:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:04,221 INFO L93 Difference]: Finished difference Result 6211 states and 8802 transitions. [2019-11-27 22:34:04,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:04,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-11-27 22:34:04,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:04,243 INFO L225 Difference]: With dead ends: 6211 [2019-11-27 22:34:04,244 INFO L226 Difference]: Without dead ends: 4139 [2019-11-27 22:34:04,249 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:34:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4139 states. [2019-11-27 22:34:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4139 to 4137. [2019-11-27 22:34:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4137 states. [2019-11-27 22:34:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 5847 transitions. [2019-11-27 22:34:04,382 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 5847 transitions. Word has length 269 [2019-11-27 22:34:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:04,383 INFO L462 AbstractCegarLoop]: Abstraction has 4137 states and 5847 transitions. [2019-11-27 22:34:04,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 5847 transitions. [2019-11-27 22:34:04,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-27 22:34:04,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:04,394 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:04,395 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:04,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:04,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1739569540, now seen corresponding path program 1 times [2019-11-27 22:34:04,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:04,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059884199] [2019-11-27 22:34:04,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-27 22:34:04,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059884199] [2019-11-27 22:34:04,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:04,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:04,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187360791] [2019-11-27 22:34:04,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:04,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:04,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:04,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:04,574 INFO L87 Difference]: Start difference. First operand 4137 states and 5847 transitions. Second operand 3 states. [2019-11-27 22:34:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:04,761 INFO L93 Difference]: Finished difference Result 8369 states and 11808 transitions. [2019-11-27 22:34:04,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:04,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-11-27 22:34:04,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:04,782 INFO L225 Difference]: With dead ends: 8369 [2019-11-27 22:34:04,782 INFO L226 Difference]: Without dead ends: 4245 [2019-11-27 22:34:04,789 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:34:04,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4245 states. [2019-11-27 22:34:04,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4245 to 4137. [2019-11-27 22:34:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4137 states. [2019-11-27 22:34:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 5739 transitions. [2019-11-27 22:34:04,921 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 5739 transitions. Word has length 269 [2019-11-27 22:34:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:04,923 INFO L462 AbstractCegarLoop]: Abstraction has 4137 states and 5739 transitions. [2019-11-27 22:34:04,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 5739 transitions. [2019-11-27 22:34:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-11-27 22:34:04,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:04,940 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 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:34:04,941 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:04,942 INFO L82 PathProgramCache]: Analyzing trace with hash 938764333, now seen corresponding path program 1 times [2019-11-27 22:34:04,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:04,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277904968] [2019-11-27 22:34:04,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-11-27 22:34:05,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277904968] [2019-11-27 22:34:05,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:05,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:05,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851766249] [2019-11-27 22:34:05,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:05,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:05,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:05,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:05,119 INFO L87 Difference]: Start difference. First operand 4137 states and 5739 transitions. Second operand 3 states. [2019-11-27 22:34:05,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:05,421 INFO L93 Difference]: Finished difference Result 8855 states and 12162 transitions. [2019-11-27 22:34:05,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:05,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2019-11-27 22:34:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:05,452 INFO L225 Difference]: With dead ends: 8855 [2019-11-27 22:34:05,453 INFO L226 Difference]: Without dead ends: 4731 [2019-11-27 22:34:05,460 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:34:05,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2019-11-27 22:34:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 4311. [2019-11-27 22:34:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4311 states. [2019-11-27 22:34:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 5973 transitions. [2019-11-27 22:34:05,663 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 5973 transitions. Word has length 296 [2019-11-27 22:34:05,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:05,665 INFO L462 AbstractCegarLoop]: Abstraction has 4311 states and 5973 transitions. [2019-11-27 22:34:05,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 5973 transitions. [2019-11-27 22:34:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-11-27 22:34:05,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:05,682 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 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:34:05,683 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:05,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:05,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1894222412, now seen corresponding path program 1 times [2019-11-27 22:34:05,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:05,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344886582] [2019-11-27 22:34:05,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-11-27 22:34:05,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344886582] [2019-11-27 22:34:05,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:05,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:05,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508510151] [2019-11-27 22:34:05,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:05,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:05,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:05,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:05,943 INFO L87 Difference]: Start difference. First operand 4311 states and 5973 transitions. Second operand 3 states. [2019-11-27 22:34:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:06,194 INFO L93 Difference]: Finished difference Result 8933 states and 12252 transitions. [2019-11-27 22:34:06,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:06,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-11-27 22:34:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:06,231 INFO L225 Difference]: With dead ends: 8933 [2019-11-27 22:34:06,232 INFO L226 Difference]: Without dead ends: 4131 [2019-11-27 22:34:06,239 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:34:06,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2019-11-27 22:34:06,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 4113. [2019-11-27 22:34:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4113 states. [2019-11-27 22:34:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4113 states to 4113 states and 5679 transitions. [2019-11-27 22:34:06,332 INFO L78 Accepts]: Start accepts. Automaton has 4113 states and 5679 transitions. Word has length 297 [2019-11-27 22:34:06,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:06,333 INFO L462 AbstractCegarLoop]: Abstraction has 4113 states and 5679 transitions. [2019-11-27 22:34:06,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 4113 states and 5679 transitions. [2019-11-27 22:34:06,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-27 22:34:06,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:06,344 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:06,344 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:06,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:06,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1483906000, now seen corresponding path program 1 times [2019-11-27 22:34:06,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:06,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190094594] [2019-11-27 22:34:06,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-27 22:34:06,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190094594] [2019-11-27 22:34:06,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064595468] [2019-11-27 22:34:06,469 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:34:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:06,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:06,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2019-11-27 22:34:06,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:34:06,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-27 22:34:06,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440551610] [2019-11-27 22:34:06,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:06,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:06,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:06,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:34:06,748 INFO L87 Difference]: Start difference. First operand 4113 states and 5679 transitions. Second operand 3 states. [2019-11-27 22:34:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:06,812 INFO L93 Difference]: Finished difference Result 6199 states and 8538 transitions. [2019-11-27 22:34:06,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:06,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-11-27 22:34:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:06,822 INFO L225 Difference]: With dead ends: 6199 [2019-11-27 22:34:06,823 INFO L226 Difference]: Without dead ends: 4115 [2019-11-27 22:34:06,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 307 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:34:06,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2019-11-27 22:34:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 4101. [2019-11-27 22:34:06,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2019-11-27 22:34:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5643 transitions. [2019-11-27 22:34:06,950 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5643 transitions. Word has length 307 [2019-11-27 22:34:06,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:06,951 INFO L462 AbstractCegarLoop]: Abstraction has 4101 states and 5643 transitions. [2019-11-27 22:34:06,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:06,952 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5643 transitions. [2019-11-27 22:34:06,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-27 22:34:06,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:06,973 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:07,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:07,181 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:07,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:07,181 INFO L82 PathProgramCache]: Analyzing trace with hash -321532334, now seen corresponding path program 1 times [2019-11-27 22:34:07,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:07,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961267913] [2019-11-27 22:34:07,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-27 22:34:07,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961267913] [2019-11-27 22:34:07,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537127097] [2019-11-27 22:34:07,606 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:34:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:07,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:07,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-27 22:34:07,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:07,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:34:07,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500134764] [2019-11-27 22:34:07,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:07,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:07,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:07,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:07,971 INFO L87 Difference]: Start difference. First operand 4101 states and 5643 transitions. Second operand 4 states. [2019-11-27 22:34:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:08,472 INFO L93 Difference]: Finished difference Result 7278 states and 10118 transitions. [2019-11-27 22:34:08,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:34:08,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2019-11-27 22:34:08,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:08,489 INFO L225 Difference]: With dead ends: 7278 [2019-11-27 22:34:08,489 INFO L226 Difference]: Without dead ends: 5086 [2019-11-27 22:34:08,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 309 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:34:08,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5086 states. [2019-11-27 22:34:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5086 to 4274. [2019-11-27 22:34:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4274 states. [2019-11-27 22:34:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 5908 transitions. [2019-11-27 22:34:08,631 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 5908 transitions. Word has length 307 [2019-11-27 22:34:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:08,632 INFO L462 AbstractCegarLoop]: Abstraction has 4274 states and 5908 transitions. [2019-11-27 22:34:08,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:08,632 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 5908 transitions. [2019-11-27 22:34:08,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-11-27 22:34:08,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:08,642 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:08,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:08,847 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:08,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:08,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1368718125, now seen corresponding path program 1 times [2019-11-27 22:34:08,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:08,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317247994] [2019-11-27 22:34:08,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-27 22:34:09,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317247994] [2019-11-27 22:34:09,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232461320] [2019-11-27 22:34:09,079 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:34:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:09,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:09,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-27 22:34:09,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:09,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:34:09,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264094276] [2019-11-27 22:34:09,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:09,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:09,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:09,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:09,382 INFO L87 Difference]: Start difference. First operand 4274 states and 5908 transitions. Second operand 4 states. [2019-11-27 22:34:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:09,796 INFO L93 Difference]: Finished difference Result 5429 states and 7539 transitions. [2019-11-27 22:34:09,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:34:09,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-11-27 22:34:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:09,804 INFO L225 Difference]: With dead ends: 5429 [2019-11-27 22:34:09,805 INFO L226 Difference]: Without dead ends: 2207 [2019-11-27 22:34:09,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 310 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:34:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2019-11-27 22:34:09,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2207. [2019-11-27 22:34:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2019-11-27 22:34:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 3065 transitions. [2019-11-27 22:34:09,896 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 3065 transitions. Word has length 308 [2019-11-27 22:34:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:09,896 INFO L462 AbstractCegarLoop]: Abstraction has 2207 states and 3065 transitions. [2019-11-27 22:34:09,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 3065 transitions. [2019-11-27 22:34:09,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-11-27 22:34:09,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:09,908 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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:34:10,112 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:10,113 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:10,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1115026887, now seen corresponding path program 1 times [2019-11-27 22:34:10,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:10,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023734196] [2019-11-27 22:34:10,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-11-27 22:34:10,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023734196] [2019-11-27 22:34:10,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177139549] [2019-11-27 22:34:10,380 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:34:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:10,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:10,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-11-27 22:34:10,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:10,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:34:10,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034503626] [2019-11-27 22:34:10,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:10,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:10,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:10,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:10,602 INFO L87 Difference]: Start difference. First operand 2207 states and 3065 transitions. Second operand 4 states. [2019-11-27 22:34:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:10,883 INFO L93 Difference]: Finished difference Result 3153 states and 4322 transitions. [2019-11-27 22:34:10,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:34:10,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2019-11-27 22:34:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:10,884 INFO L225 Difference]: With dead ends: 3153 [2019-11-27 22:34:10,885 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:34:10,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 335 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:34:10,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:34:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:34:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:34:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:34:10,889 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 333 [2019-11-27 22:34:10,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:10,890 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:34:10,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:34:10,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:34:11,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:11,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:34:11,655 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 3 [2019-11-27 22:34:11,825 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-11-27 22:34:12,296 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2019-11-27 22:34:12,300 INFO L249 CegarLoopResult]: At program point L630(lines 622 632) the Hoare annotation is: true [2019-11-27 22:34:12,300 INFO L246 CegarLoopResult]: For program point L300(lines 300 304) no Hoare annotation was computed. [2019-11-27 22:34:12,300 INFO L246 CegarLoopResult]: For program point L300-2(lines 300 304) no Hoare annotation was computed. [2019-11-27 22:34:12,300 INFO L246 CegarLoopResult]: For program point L168(lines 168 549) no Hoare annotation was computed. [2019-11-27 22:34:12,300 INFO L246 CegarLoopResult]: For program point L135(lines 135 560) no Hoare annotation was computed. [2019-11-27 22:34:12,300 INFO L246 CegarLoopResult]: For program point L102(lines 102 571) no Hoare annotation was computed. [2019-11-27 22:34:12,301 INFO L246 CegarLoopResult]: For program point L433(lines 433 437) no Hoare annotation was computed. [2019-11-27 22:34:12,301 INFO L246 CegarLoopResult]: For program point L433-2(lines 203 535) no Hoare annotation was computed. [2019-11-27 22:34:12,301 INFO L249 CegarLoopResult]: At program point L202(lines 201 538) the Hoare annotation is: true [2019-11-27 22:34:12,301 INFO L242 CegarLoopResult]: At program point L169(lines 165 550) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:34:12,301 INFO L242 CegarLoopResult]: At program point L103(lines 102 571) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:34:12,301 INFO L246 CegarLoopResult]: For program point L368(lines 368 372) no Hoare annotation was computed. [2019-11-27 22:34:12,302 INFO L246 CegarLoopResult]: For program point L402(lines 402 407) no Hoare annotation was computed. [2019-11-27 22:34:12,303 INFO L246 CegarLoopResult]: For program point L402-2(lines 402 407) no Hoare annotation was computed. [2019-11-27 22:34:12,304 INFO L246 CegarLoopResult]: For program point L171(lines 171 548) no Hoare annotation was computed. [2019-11-27 22:34:12,304 INFO L246 CegarLoopResult]: For program point L138(lines 138 559) no Hoare annotation was computed. [2019-11-27 22:34:12,304 INFO L246 CegarLoopResult]: For program point L105(lines 105 570) no Hoare annotation was computed. [2019-11-27 22:34:12,305 INFO L242 CegarLoopResult]: At program point L139(lines 135 560) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:34:12,306 INFO L242 CegarLoopResult]: At program point L536(lines 99 602) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4))) (or (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0) (and (not .cse1) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse3) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) .cse0 .cse4 .cse1 .cse5) (<= ULTIMATE.start_ssl3_connect_~s__state~0 3) (and .cse2 .cse0 .cse3 .cse4 .cse1 .cse5) (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)))) [2019-11-27 22:34:12,306 INFO L246 CegarLoopResult]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-11-27 22:34:12,307 INFO L249 CegarLoopResult]: At program point L603(lines 98 604) the Hoare annotation is: true [2019-11-27 22:34:12,307 INFO L246 CegarLoopResult]: For program point L174(lines 174 547) no Hoare annotation was computed. [2019-11-27 22:34:12,308 INFO L246 CegarLoopResult]: For program point L141(lines 141 558) no Hoare annotation was computed. [2019-11-27 22:34:12,308 INFO L246 CegarLoopResult]: For program point L108(lines 108 569) no Hoare annotation was computed. [2019-11-27 22:34:12,308 INFO L246 CegarLoopResult]: For program point L373(lines 373 377) no Hoare annotation was computed. [2019-11-27 22:34:12,309 INFO L246 CegarLoopResult]: For program point L373-2(lines 373 377) no Hoare annotation was computed. [2019-11-27 22:34:12,309 INFO L242 CegarLoopResult]: At program point L208(lines 105 570) the Hoare annotation is: (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) [2019-11-27 22:34:12,309 INFO L242 CegarLoopResult]: At program point L175(lines 171 548) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:34:12,310 INFO L246 CegarLoopResult]: For program point L572(lines 572 600) no Hoare annotation was computed. [2019-11-27 22:34:12,310 INFO L246 CegarLoopResult]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-11-27 22:34:12,310 INFO L246 CegarLoopResult]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-11-27 22:34:12,310 INFO L246 CegarLoopResult]: For program point L573(lines 573 597) no Hoare annotation was computed. [2019-11-27 22:34:12,310 INFO L246 CegarLoopResult]: For program point L507-1(lines 203 535) no Hoare annotation was computed. [2019-11-27 22:34:12,311 INFO L246 CegarLoopResult]: For program point L342(lines 342 347) no Hoare annotation was computed. [2019-11-27 22:34:12,311 INFO L246 CegarLoopResult]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-11-27 22:34:12,311 INFO L246 CegarLoopResult]: For program point L309-1(lines 309 323) no Hoare annotation was computed. [2019-11-27 22:34:12,311 INFO L246 CegarLoopResult]: For program point L177(lines 177 546) no Hoare annotation was computed. [2019-11-27 22:34:12,311 INFO L246 CegarLoopResult]: For program point L144(lines 144 557) no Hoare annotation was computed. [2019-11-27 22:34:12,311 INFO L246 CegarLoopResult]: For program point L111(lines 111 568) no Hoare annotation was computed. [2019-11-27 22:34:12,312 INFO L246 CegarLoopResult]: For program point L607(lines 607 611) no Hoare annotation was computed. [2019-11-27 22:34:12,312 INFO L246 CegarLoopResult]: For program point L574(lines 574 583) no Hoare annotation was computed. [2019-11-27 22:34:12,312 INFO L246 CegarLoopResult]: For program point L607-2(lines 607 611) no Hoare annotation was computed. [2019-11-27 22:34:12,313 INFO L246 CegarLoopResult]: For program point L574-2(lines 573 595) no Hoare annotation was computed. [2019-11-27 22:34:12,314 INFO L242 CegarLoopResult]: At program point L145(lines 141 558) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:34:12,314 INFO L246 CegarLoopResult]: For program point L576(lines 576 580) no Hoare annotation was computed. [2019-11-27 22:34:12,314 INFO L246 CegarLoopResult]: For program point L444(lines 444 449) no Hoare annotation was computed. [2019-11-27 22:34:12,314 INFO L246 CegarLoopResult]: For program point L213(lines 213 217) no Hoare annotation was computed. [2019-11-27 22:34:12,314 INFO L246 CegarLoopResult]: For program point L180(lines 180 545) no Hoare annotation was computed. [2019-11-27 22:34:12,314 INFO L246 CegarLoopResult]: For program point L147(lines 147 556) no Hoare annotation was computed. [2019-11-27 22:34:12,314 INFO L246 CegarLoopResult]: For program point L213-2(lines 203 535) no Hoare annotation was computed. [2019-11-27 22:34:12,315 INFO L246 CegarLoopResult]: For program point L114(lines 114 567) no Hoare annotation was computed. [2019-11-27 22:34:12,315 INFO L246 CegarLoopResult]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-27 22:34:12,315 INFO L246 CegarLoopResult]: For program point L313(lines 313 317) no Hoare annotation was computed. [2019-11-27 22:34:12,315 INFO L246 CegarLoopResult]: For program point L313-2(lines 311 323) no Hoare annotation was computed. [2019-11-27 22:34:12,315 INFO L242 CegarLoopResult]: At program point L181(lines 177 546) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:34:12,315 INFO L246 CegarLoopResult]: For program point L512-1(lines 512 516) no Hoare annotation was computed. [2019-11-27 22:34:12,316 INFO L246 CegarLoopResult]: For program point L413(lines 413 417) no Hoare annotation was computed. [2019-11-27 22:34:12,316 INFO L246 CegarLoopResult]: For program point L249(lines 249 254) no Hoare annotation was computed. [2019-11-27 22:34:12,316 INFO L246 CegarLoopResult]: For program point L183(lines 183 544) no Hoare annotation was computed. [2019-11-27 22:34:12,316 INFO L246 CegarLoopResult]: For program point L150(lines 150 555) no Hoare annotation was computed. [2019-11-27 22:34:12,316 INFO L246 CegarLoopResult]: For program point L117(lines 117 566) no Hoare annotation was computed. [2019-11-27 22:34:12,317 INFO L246 CegarLoopResult]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-11-27 22:34:12,317 INFO L246 CegarLoopResult]: For program point L84-1(lines 66 620) no Hoare annotation was computed. [2019-11-27 22:34:12,317 INFO L242 CegarLoopResult]: At program point L151(lines 147 556) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:34:12,318 INFO L246 CegarLoopResult]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-11-27 22:34:12,318 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:34:12,318 INFO L246 CegarLoopResult]: For program point L483(lines 483 487) no Hoare annotation was computed. [2019-11-27 22:34:12,318 INFO L246 CegarLoopResult]: For program point L483-2(lines 483 487) no Hoare annotation was computed. [2019-11-27 22:34:12,318 INFO L246 CegarLoopResult]: For program point L285(lines 285 293) no Hoare annotation was computed. [2019-11-27 22:34:12,319 INFO L246 CegarLoopResult]: For program point L186(lines 186 543) no Hoare annotation was computed. [2019-11-27 22:34:12,319 INFO L246 CegarLoopResult]: For program point L153(lines 153 554) no Hoare annotation was computed. [2019-11-27 22:34:12,319 INFO L246 CegarLoopResult]: For program point L120(lines 120 565) no Hoare annotation was computed. [2019-11-27 22:34:12,319 INFO L246 CegarLoopResult]: For program point L385(lines 385 389) no Hoare annotation was computed. [2019-11-27 22:34:12,320 INFO L246 CegarLoopResult]: For program point L352(lines 352 356) no Hoare annotation was computed. [2019-11-27 22:34:12,320 INFO L242 CegarLoopResult]: At program point L187(lines 183 544) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (not (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) .cse0 .cse1) (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) .cse0 .cse1))) [2019-11-27 22:34:12,320 INFO L242 CegarLoopResult]: At program point L121(lines 117 566) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:34:12,320 INFO L242 CegarLoopResult]: At program point L353(lines 66 620) the Hoare annotation is: false [2019-11-27 22:34:12,320 INFO L249 CegarLoopResult]: At program point L618(lines 66 620) the Hoare annotation is: true [2019-11-27 22:34:12,321 INFO L246 CegarLoopResult]: For program point L585(lines 585 591) no Hoare annotation was computed. [2019-11-27 22:34:12,321 INFO L246 CegarLoopResult]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-27 22:34:12,321 INFO L246 CegarLoopResult]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-11-27 22:34:12,321 INFO L246 CegarLoopResult]: For program point L288(lines 288 292) no Hoare annotation was computed. [2019-11-27 22:34:12,321 INFO L246 CegarLoopResult]: For program point L288-2(lines 203 535) no Hoare annotation was computed. [2019-11-27 22:34:12,322 INFO L246 CegarLoopResult]: For program point L189(lines 189 542) no Hoare annotation was computed. [2019-11-27 22:34:12,322 INFO L246 CegarLoopResult]: For program point L156(lines 156 553) no Hoare annotation was computed. [2019-11-27 22:34:12,322 INFO L246 CegarLoopResult]: For program point L123(lines 123 564) no Hoare annotation was computed. [2019-11-27 22:34:12,323 INFO L249 CegarLoopResult]: At program point L619(lines 8 621) the Hoare annotation is: true [2019-11-27 22:34:12,323 INFO L246 CegarLoopResult]: For program point L454(lines 454 458) no Hoare annotation was computed. [2019-11-27 22:34:12,323 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:34:12,323 INFO L246 CegarLoopResult]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-27 22:34:12,323 INFO L246 CegarLoopResult]: For program point L225(lines 225 242) no Hoare annotation was computed. [2019-11-27 22:34:12,324 INFO L246 CegarLoopResult]: For program point L192(lines 192 541) no Hoare annotation was computed. [2019-11-27 22:34:12,324 INFO L246 CegarLoopResult]: For program point L159(lines 159 552) no Hoare annotation was computed. [2019-11-27 22:34:12,324 INFO L246 CegarLoopResult]: For program point L225-2(lines 203 535) no Hoare annotation was computed. [2019-11-27 22:34:12,324 INFO L246 CegarLoopResult]: For program point L126(lines 126 563) no Hoare annotation was computed. [2019-11-27 22:34:12,324 INFO L242 CegarLoopResult]: At program point L193(lines 189 542) the Hoare annotation is: (or (and (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) [2019-11-27 22:34:12,325 INFO L242 CegarLoopResult]: At program point L127(lines 123 564) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:34:12,325 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:34:12,325 INFO L246 CegarLoopResult]: For program point L491-1(lines 491 503) no Hoare annotation was computed. [2019-11-27 22:34:12,325 INFO L246 CegarLoopResult]: For program point L425(lines 425 429) no Hoare annotation was computed. [2019-11-27 22:34:12,325 INFO L246 CegarLoopResult]: For program point L227(lines 227 232) no Hoare annotation was computed. [2019-11-27 22:34:12,325 INFO L246 CegarLoopResult]: For program point L195(lines 195 540) no Hoare annotation was computed. [2019-11-27 22:34:12,326 INFO L246 CegarLoopResult]: For program point L162(lines 162 551) no Hoare annotation was computed. [2019-11-27 22:34:12,326 INFO L246 CegarLoopResult]: For program point L129(lines 129 562) no Hoare annotation was computed. [2019-11-27 22:34:12,326 INFO L246 CegarLoopResult]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-11-27 22:34:12,326 INFO L242 CegarLoopResult]: At program point L196(lines 195 540) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (not .cse0) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2 .cse3) (and .cse1 .cse2 .cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse3))) [2019-11-27 22:34:12,327 INFO L242 CegarLoopResult]: At program point L163(lines 153 554) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:34:12,327 INFO L246 CegarLoopResult]: For program point L494(lines 494 499) no Hoare annotation was computed. [2019-11-27 22:34:12,327 INFO L246 CegarLoopResult]: For program point L461(lines 461 472) no Hoare annotation was computed. [2019-11-27 22:34:12,327 INFO L246 CegarLoopResult]: For program point L461-1(lines 461 472) no Hoare annotation was computed. [2019-11-27 22:34:12,327 INFO L246 CegarLoopResult]: For program point L263(lines 263 267) no Hoare annotation was computed. [2019-11-27 22:34:12,327 INFO L246 CegarLoopResult]: For program point L263-2(lines 203 535) no Hoare annotation was computed. [2019-11-27 22:34:12,328 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 614) no Hoare annotation was computed. [2019-11-27 22:34:12,328 INFO L246 CegarLoopResult]: For program point L396(lines 396 400) no Hoare annotation was computed. [2019-11-27 22:34:12,328 INFO L246 CegarLoopResult]: For program point L330(lines 330 334) no Hoare annotation was computed. [2019-11-27 22:34:12,328 INFO L246 CegarLoopResult]: For program point L330-2(lines 203 535) no Hoare annotation was computed. [2019-11-27 22:34:12,328 INFO L246 CegarLoopResult]: For program point L198(lines 198 539) no Hoare annotation was computed. [2019-11-27 22:34:12,329 INFO L246 CegarLoopResult]: For program point L165(lines 165 550) no Hoare annotation was computed. [2019-11-27 22:34:12,329 INFO L246 CegarLoopResult]: For program point L132(lines 132 561) no Hoare annotation was computed. [2019-11-27 22:34:12,329 INFO L246 CegarLoopResult]: For program point L99-1(lines 66 620) no Hoare annotation was computed. [2019-11-27 22:34:12,329 INFO L246 CegarLoopResult]: For program point L463(lines 463 469) no Hoare annotation was computed. [2019-11-27 22:34:12,329 INFO L249 CegarLoopResult]: At program point L199(lines 198 539) the Hoare annotation is: true [2019-11-27 22:34:12,330 INFO L242 CegarLoopResult]: At program point L133(lines 129 562) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:34:12,330 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-27 22:34:12,330 INFO L246 CegarLoopResult]: For program point L233(lines 233 238) no Hoare annotation was computed. [2019-11-27 22:34:12,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:34:12 BoogieIcfgContainer [2019-11-27 22:34:12,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:34:12,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:34:12,370 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:34:12,370 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:34:12,370 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:33:59" (3/4) ... [2019-11-27 22:34:12,375 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:34:12,403 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-27 22:34:12,404 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:34:12,556 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:34:12,556 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:34:12,558 INFO L168 Benchmark]: Toolchain (without parser) took 14313.00 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 725.6 MB). Free memory was 956.3 MB in the beginning and 1.0 GB in the end (delta: -81.5 MB). Peak memory consumption was 644.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:12,558 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:12,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 515.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:12,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:12,560 INFO L168 Benchmark]: Boogie Preprocessor took 69.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:12,560 INFO L168 Benchmark]: RCFGBuilder took 719.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:12,561 INFO L168 Benchmark]: TraceAbstraction took 12754.53 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 578.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.4 MB). Peak memory consumption was 625.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:12,561 INFO L168 Benchmark]: Witness Printer took 186.86 ms. Allocated memory is still 1.8 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:12,565 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 515.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 719.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12754.53 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 578.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.4 MB). Peak memory consumption was 625.7 MB. Max. memory is 11.5 GB. * Witness Printer took 186.86 ms. Allocated memory is still 1.8 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 614]: 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: 171]: Loop Invariant Derived loop invariant: (s__state <= 4512 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((4416 == s__state && blastFlag <= 4) || ((((!(0 == s__hit) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && blastFlag <= 4) && 4352 <= s__state)) || blastFlag <= 2) || (((((4560 <= s__state && s__state <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || s__state <= 3) || (((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((!(0 == s__hit) && blastFlag <= 4) && 4432 <= s__state) || ((s__state <= 4560 && blastFlag <= 4) && 4432 <= s__state) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (blastFlag <= 4 && s__state <= 4448) && 4432 <= s__state - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (s__state <= 4512 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: (0 == s__hit && 4432 <= s__state) || (4560 <= s__state && blastFlag <= 2) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (s__state <= 4480 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (s__state <= 4480 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((!(0 == s__hit) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && blastFlag <= 4) && 4352 <= s__state) || (((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Result: SAFE, OverallTime: 11.4s, OverallIterations: 21, TraceHistogramMax: 15, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 4033 SDtfs, 1585 SDslu, 2268 SDs, 0 SdLazy, 1977 SolverSat, 491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1323 GetRequests, 1294 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4311occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 1655 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 191 NumberOfFragments, 280 HoareAnnotationTreeSize, 23 FomulaSimplifications, 14412 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 23 FomulaSimplificationsInter, 8920 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 5351 NumberOfCodeBlocks, 5351 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 5326 ConstructedInterpolants, 0 QuantifiedInterpolants, 2023446 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2379 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 16460/16530 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...