./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f6fb2bb1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.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 5377418547a5706dafa6030007433e8164dafce8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 18:26:30,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:26:30,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:26:30,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:26:30,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:26:30,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:26:30,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:26:30,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:26:30,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:26:30,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:26:30,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:26:30,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:26:30,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:26:30,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:26:30,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:26:30,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:26:30,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:26:30,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:26:30,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:26:30,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:26:30,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:26:30,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:26:30,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:26:30,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:26:30,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:26:30,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:26:30,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:26:30,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:26:30,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:26:30,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:26:30,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:26:30,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:26:30,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:26:30,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:26:30,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:26:30,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:26:30,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:26:30,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:26:30,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:26:30,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:26:30,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:26:30,944 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:26:30,959 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:26:30,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:26:30,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:26:30,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:26:30,961 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:26:30,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:26:30,962 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:26:30,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:26:30,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:26:30,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:26:30,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:26:30,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:26:30,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:26:30,964 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:26:30,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:26:30,964 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:26:30,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:26:30,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:26:30,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:26:30,966 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:26:30,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:26:30,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:26:30,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:26:30,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:26:30,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:26:30,967 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:26:30,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:26:30,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:26:30,968 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 -> 5377418547a5706dafa6030007433e8164dafce8 [2019-11-19 18:26:31,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:26:31,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:26:31,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:26:31,281 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:26:31,281 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:26:31,282 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c [2019-11-19 18:26:31,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58155a0c/d5ae9c03a9824b3f8cc697e6e6f237ec/FLAGa28321d24 [2019-11-19 18:26:31,828 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:26:31,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c [2019-11-19 18:26:31,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58155a0c/d5ae9c03a9824b3f8cc697e6e6f237ec/FLAGa28321d24 [2019-11-19 18:26:32,151 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58155a0c/d5ae9c03a9824b3f8cc697e6e6f237ec [2019-11-19 18:26:32,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:26:32,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:26:32,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:26:32,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:26:32,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:26:32,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:32" (1/1) ... [2019-11-19 18:26:32,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f7fb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:32, skipping insertion in model container [2019-11-19 18:26:32,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:32" (1/1) ... [2019-11-19 18:26:32,173 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:26:32,209 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:26:32,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:26:32,465 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:26:32,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:26:32,592 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:26:32,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:32 WrapperNode [2019-11-19 18:26:32,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:26:32,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:26:32,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:26:32,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:26:32,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:32" (1/1) ... [2019-11-19 18:26:32,609 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:32" (1/1) ... [2019-11-19 18:26:32,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:26:32,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:26:32,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:26:32,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:26:32,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:32" (1/1) ... [2019-11-19 18:26:32,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:32" (1/1) ... [2019-11-19 18:26:32,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:32" (1/1) ... [2019-11-19 18:26:32,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:32" (1/1) ... [2019-11-19 18:26:32,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:32" (1/1) ... [2019-11-19 18:26:32,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:32" (1/1) ... [2019-11-19 18:26:32,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:32" (1/1) ... [2019-11-19 18:26:32,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:26:32,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:26:32,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:26:32,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:26:32,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:32" (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-19 18:26:32,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:26:32,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:26:32,864 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 18:26:33,357 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-19 18:26:33,358 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-19 18:26:33,359 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:26:33,359 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 18:26:33,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:26:33 BoogieIcfgContainer [2019-11-19 18:26:33,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:26:33,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:26:33,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:26:33,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:26:33,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:26:32" (1/3) ... [2019-11-19 18:26:33,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580e6624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:26:33, skipping insertion in model container [2019-11-19 18:26:33,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:32" (2/3) ... [2019-11-19 18:26:33,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580e6624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:26:33, skipping insertion in model container [2019-11-19 18:26:33,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:26:33" (3/3) ... [2019-11-19 18:26:33,370 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2019-11-19 18:26:33,379 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:26:33,387 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 18:26:33,398 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 18:26:33,425 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:26:33,425 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:26:33,425 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:26:33,426 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:26:33,426 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:26:33,426 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:26:33,426 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:26:33,427 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:26:33,445 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-11-19 18:26:33,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 18:26:33,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:33,455 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] [2019-11-19 18:26:33,455 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:33,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:33,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-19 18:26:33,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:33,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845792534] [2019-11-19 18:26:33,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:33,639 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-19 18:26:33,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845792534] [2019-11-19 18:26:33,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:33,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:26:33,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544431348] [2019-11-19 18:26:33,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:33,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:33,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:33,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:33,660 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states. [2019-11-19 18:26:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:33,873 INFO L93 Difference]: Finished difference Result 243 states and 418 transitions. [2019-11-19 18:26:33,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:33,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-19 18:26:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:33,889 INFO L225 Difference]: With dead ends: 243 [2019-11-19 18:26:33,889 INFO L226 Difference]: Without dead ends: 111 [2019-11-19 18:26:33,893 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-19 18:26:33,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-19 18:26:33,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-19 18:26:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-19 18:26:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-19 18:26:33,943 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-19 18:26:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:33,943 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-19 18:26:33,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:33,944 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-19 18:26:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 18:26:33,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:33,946 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] [2019-11-19 18:26:33,947 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:33,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:33,947 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-19 18:26:33,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:33,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740910517] [2019-11-19 18:26:33,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:34,044 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-19 18:26:34,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740910517] [2019-11-19 18:26:34,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:34,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:34,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874920198] [2019-11-19 18:26:34,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:34,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:34,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:34,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:34,054 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-19 18:26:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:34,230 INFO L93 Difference]: Finished difference Result 231 states and 353 transitions. [2019-11-19 18:26:34,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:34,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-19 18:26:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:34,234 INFO L225 Difference]: With dead ends: 231 [2019-11-19 18:26:34,234 INFO L226 Difference]: Without dead ends: 129 [2019-11-19 18:26:34,237 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-19 18:26:34,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-19 18:26:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-11-19 18:26:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-19 18:26:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-19 18:26:34,267 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-19 18:26:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:34,268 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-19 18:26:34,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-19 18:26:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-19 18:26:34,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:34,272 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] [2019-11-19 18:26:34,273 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:34,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:34,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1382730084, now seen corresponding path program 1 times [2019-11-19 18:26:34,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:34,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172633859] [2019-11-19 18:26:34,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:34,381 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-19 18:26:34,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172633859] [2019-11-19 18:26:34,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:34,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:34,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239428225] [2019-11-19 18:26:34,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:34,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:34,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:34,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:34,384 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-19 18:26:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:34,560 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2019-11-19 18:26:34,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:34,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-19 18:26:34,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:34,566 INFO L225 Difference]: With dead ends: 265 [2019-11-19 18:26:34,566 INFO L226 Difference]: Without dead ends: 148 [2019-11-19 18:26:34,567 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-19 18:26:34,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-19 18:26:34,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2019-11-19 18:26:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-19 18:26:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-19 18:26:34,581 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-19 18:26:34,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:34,582 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-19 18:26:34,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:34,582 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-19 18:26:34,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-19 18:26:34,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:34,585 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] [2019-11-19 18:26:34,585 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:34,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1259053610, now seen corresponding path program 1 times [2019-11-19 18:26:34,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:34,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100409395] [2019-11-19 18:26:34,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:34,658 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-19 18:26:34,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100409395] [2019-11-19 18:26:34,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:34,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:34,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437391243] [2019-11-19 18:26:34,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:34,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:34,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:34,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:34,662 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-19 18:26:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:34,874 INFO L93 Difference]: Finished difference Result 327 states and 495 transitions. [2019-11-19 18:26:34,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:34,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-19 18:26:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:34,876 INFO L225 Difference]: With dead ends: 327 [2019-11-19 18:26:34,878 INFO L226 Difference]: Without dead ends: 192 [2019-11-19 18:26:34,880 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-19 18:26:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-19 18:26:34,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2019-11-19 18:26:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-19 18:26:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 260 transitions. [2019-11-19 18:26:34,907 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 260 transitions. Word has length 66 [2019-11-19 18:26:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:34,908 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 260 transitions. [2019-11-19 18:26:34,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 260 transitions. [2019-11-19 18:26:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-19 18:26:34,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:34,912 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] [2019-11-19 18:26:34,912 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:34,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:34,913 INFO L82 PathProgramCache]: Analyzing trace with hash -546384724, now seen corresponding path program 1 times [2019-11-19 18:26:34,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:34,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025293329] [2019-11-19 18:26:34,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:35,011 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-19 18:26:35,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025293329] [2019-11-19 18:26:35,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:35,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:35,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903481852] [2019-11-19 18:26:35,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:35,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:35,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:35,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:35,014 INFO L87 Difference]: Start difference. First operand 184 states and 260 transitions. Second operand 3 states. [2019-11-19 18:26:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:35,146 INFO L93 Difference]: Finished difference Result 382 states and 547 transitions. [2019-11-19 18:26:35,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:35,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-19 18:26:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:35,149 INFO L225 Difference]: With dead ends: 382 [2019-11-19 18:26:35,149 INFO L226 Difference]: Without dead ends: 207 [2019-11-19 18:26:35,150 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-19 18:26:35,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-11-19 18:26:35,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-11-19 18:26:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-19 18:26:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 284 transitions. [2019-11-19 18:26:35,161 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 284 transitions. Word has length 66 [2019-11-19 18:26:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:35,162 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 284 transitions. [2019-11-19 18:26:35,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 284 transitions. [2019-11-19 18:26:35,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-19 18:26:35,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:35,165 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] [2019-11-19 18:26:35,165 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:35,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:35,165 INFO L82 PathProgramCache]: Analyzing trace with hash 819829122, now seen corresponding path program 1 times [2019-11-19 18:26:35,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:35,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105918292] [2019-11-19 18:26:35,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:35,247 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-19 18:26:35,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105918292] [2019-11-19 18:26:35,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:35,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:35,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859373301] [2019-11-19 18:26:35,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:35,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:35,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:35,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:35,251 INFO L87 Difference]: Start difference. First operand 203 states and 284 transitions. Second operand 3 states. [2019-11-19 18:26:35,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:35,387 INFO L93 Difference]: Finished difference Result 421 states and 597 transitions. [2019-11-19 18:26:35,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:35,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-19 18:26:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:35,389 INFO L225 Difference]: With dead ends: 421 [2019-11-19 18:26:35,389 INFO L226 Difference]: Without dead ends: 227 [2019-11-19 18:26:35,392 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-19 18:26:35,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-19 18:26:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-11-19 18:26:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-19 18:26:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 310 transitions. [2019-11-19 18:26:35,403 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 310 transitions. Word has length 82 [2019-11-19 18:26:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:35,404 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 310 transitions. [2019-11-19 18:26:35,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 310 transitions. [2019-11-19 18:26:35,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-19 18:26:35,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:35,406 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] [2019-11-19 18:26:35,406 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:35,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:35,406 INFO L82 PathProgramCache]: Analyzing trace with hash 426015802, now seen corresponding path program 1 times [2019-11-19 18:26:35,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:35,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691955346] [2019-11-19 18:26:35,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-19 18:26:35,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691955346] [2019-11-19 18:26:35,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:35,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:35,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299886762] [2019-11-19 18:26:35,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:35,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:35,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:35,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:35,532 INFO L87 Difference]: Start difference. First operand 224 states and 310 transitions. Second operand 3 states. [2019-11-19 18:26:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:35,574 INFO L93 Difference]: Finished difference Result 652 states and 903 transitions. [2019-11-19 18:26:35,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:35,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-19 18:26:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:35,578 INFO L225 Difference]: With dead ends: 652 [2019-11-19 18:26:35,578 INFO L226 Difference]: Without dead ends: 437 [2019-11-19 18:26:35,579 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-19 18:26:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-19 18:26:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-11-19 18:26:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-11-19 18:26:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 603 transitions. [2019-11-19 18:26:35,595 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 603 transitions. Word has length 102 [2019-11-19 18:26:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:35,596 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 603 transitions. [2019-11-19 18:26:35,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 603 transitions. [2019-11-19 18:26:35,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-19 18:26:35,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:35,598 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] [2019-11-19 18:26:35,599 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:35,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:35,599 INFO L82 PathProgramCache]: Analyzing trace with hash -527041180, now seen corresponding path program 1 times [2019-11-19 18:26:35,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:35,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380104239] [2019-11-19 18:26:35,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:35,659 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-19 18:26:35,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380104239] [2019-11-19 18:26:35,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:35,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:35,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688262483] [2019-11-19 18:26:35,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:35,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:35,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:35,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:35,663 INFO L87 Difference]: Start difference. First operand 437 states and 603 transitions. Second operand 3 states. [2019-11-19 18:26:35,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:35,733 INFO L93 Difference]: Finished difference Result 652 states and 900 transitions. [2019-11-19 18:26:35,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:35,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-19 18:26:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:35,738 INFO L225 Difference]: With dead ends: 652 [2019-11-19 18:26:35,738 INFO L226 Difference]: Without dead ends: 650 [2019-11-19 18:26:35,739 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-19 18:26:35,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-11-19 18:26:35,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-11-19 18:26:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-11-19 18:26:35,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 898 transitions. [2019-11-19 18:26:35,759 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 898 transitions. Word has length 104 [2019-11-19 18:26:35,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:35,760 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 898 transitions. [2019-11-19 18:26:35,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:35,760 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 898 transitions. [2019-11-19 18:26:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-19 18:26:35,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:35,763 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 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] [2019-11-19 18:26:35,763 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:35,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:35,764 INFO L82 PathProgramCache]: Analyzing trace with hash -892474837, now seen corresponding path program 1 times [2019-11-19 18:26:35,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:35,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057197176] [2019-11-19 18:26:35,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-19 18:26:35,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057197176] [2019-11-19 18:26:35,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:35,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:35,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581604997] [2019-11-19 18:26:35,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:35,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:35,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:35,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:35,827 INFO L87 Difference]: Start difference. First operand 650 states and 898 transitions. Second operand 3 states. [2019-11-19 18:26:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:35,983 INFO L93 Difference]: Finished difference Result 1441 states and 2047 transitions. [2019-11-19 18:26:35,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:35,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-19 18:26:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:35,988 INFO L225 Difference]: With dead ends: 1441 [2019-11-19 18:26:35,988 INFO L226 Difference]: Without dead ends: 797 [2019-11-19 18:26:35,989 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-19 18:26:35,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-11-19 18:26:36,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 767. [2019-11-19 18:26:36,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-11-19 18:26:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1087 transitions. [2019-11-19 18:26:36,010 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1087 transitions. Word has length 158 [2019-11-19 18:26:36,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:36,010 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1087 transitions. [2019-11-19 18:26:36,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1087 transitions. [2019-11-19 18:26:36,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-19 18:26:36,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:36,014 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 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, 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] [2019-11-19 18:26:36,014 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:36,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:36,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1787424402, now seen corresponding path program 1 times [2019-11-19 18:26:36,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:36,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371616690] [2019-11-19 18:26:36,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-19 18:26:36,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371616690] [2019-11-19 18:26:36,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:36,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:36,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637751118] [2019-11-19 18:26:36,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:36,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:36,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:36,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:36,068 INFO L87 Difference]: Start difference. First operand 767 states and 1087 transitions. Second operand 3 states. [2019-11-19 18:26:36,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:36,230 INFO L93 Difference]: Finished difference Result 1803 states and 2628 transitions. [2019-11-19 18:26:36,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:36,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-19 18:26:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:36,237 INFO L225 Difference]: With dead ends: 1803 [2019-11-19 18:26:36,238 INFO L226 Difference]: Without dead ends: 994 [2019-11-19 18:26:36,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-19 18:26:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-11-19 18:26:36,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 956. [2019-11-19 18:26:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-11-19 18:26:36,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1339 transitions. [2019-11-19 18:26:36,269 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1339 transitions. Word has length 184 [2019-11-19 18:26:36,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:36,270 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 1339 transitions. [2019-11-19 18:26:36,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1339 transitions. [2019-11-19 18:26:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-19 18:26:36,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:36,274 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:36,274 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:36,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:36,274 INFO L82 PathProgramCache]: Analyzing trace with hash 78119093, now seen corresponding path program 1 times [2019-11-19 18:26:36,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:36,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929389569] [2019-11-19 18:26:36,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-19 18:26:36,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929389569] [2019-11-19 18:26:36,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:36,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:36,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141865555] [2019-11-19 18:26:36,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:36,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:36,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:36,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:36,351 INFO L87 Difference]: Start difference. First operand 956 states and 1339 transitions. Second operand 3 states. [2019-11-19 18:26:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:36,512 INFO L93 Difference]: Finished difference Result 2059 states and 2905 transitions. [2019-11-19 18:26:36,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:36,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-19 18:26:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:36,519 INFO L225 Difference]: With dead ends: 2059 [2019-11-19 18:26:36,519 INFO L226 Difference]: Without dead ends: 1067 [2019-11-19 18:26:36,520 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-19 18:26:36,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-11-19 18:26:36,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1031. [2019-11-19 18:26:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2019-11-19 18:26:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1435 transitions. [2019-11-19 18:26:36,549 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1435 transitions. Word has length 205 [2019-11-19 18:26:36,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:36,550 INFO L462 AbstractCegarLoop]: Abstraction has 1031 states and 1435 transitions. [2019-11-19 18:26:36,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1435 transitions. [2019-11-19 18:26:36,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-19 18:26:36,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:36,556 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 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, 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-19 18:26:36,557 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:36,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:36,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2106820770, now seen corresponding path program 1 times [2019-11-19 18:26:36,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:36,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497886052] [2019-11-19 18:26:36,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-19 18:26:36,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497886052] [2019-11-19 18:26:36,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:36,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:36,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001796967] [2019-11-19 18:26:36,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:36,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:36,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:36,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:36,671 INFO L87 Difference]: Start difference. First operand 1031 states and 1435 transitions. Second operand 3 states. [2019-11-19 18:26:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:36,850 INFO L93 Difference]: Finished difference Result 2209 states and 3094 transitions. [2019-11-19 18:26:36,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:36,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-19 18:26:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:36,857 INFO L225 Difference]: With dead ends: 2209 [2019-11-19 18:26:36,857 INFO L226 Difference]: Without dead ends: 1148 [2019-11-19 18:26:36,859 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-19 18:26:36,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-11-19 18:26:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1115. [2019-11-19 18:26:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-11-19 18:26:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1546 transitions. [2019-11-19 18:26:36,895 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1546 transitions. Word has length 229 [2019-11-19 18:26:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:36,895 INFO L462 AbstractCegarLoop]: Abstraction has 1115 states and 1546 transitions. [2019-11-19 18:26:36,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1546 transitions. [2019-11-19 18:26:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-19 18:26:36,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:36,900 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 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, 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-19 18:26:36,901 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:36,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:36,901 INFO L82 PathProgramCache]: Analyzing trace with hash 73426724, now seen corresponding path program 1 times [2019-11-19 18:26:36,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:36,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845748136] [2019-11-19 18:26:36,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-19 18:26:37,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845748136] [2019-11-19 18:26:37,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:37,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:37,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382214211] [2019-11-19 18:26:37,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:37,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:37,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:37,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:37,038 INFO L87 Difference]: Start difference. First operand 1115 states and 1546 transitions. Second operand 3 states. [2019-11-19 18:26:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:37,206 INFO L93 Difference]: Finished difference Result 2377 states and 3319 transitions. [2019-11-19 18:26:37,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:37,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-19 18:26:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:37,213 INFO L225 Difference]: With dead ends: 2377 [2019-11-19 18:26:37,213 INFO L226 Difference]: Without dead ends: 1244 [2019-11-19 18:26:37,215 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-19 18:26:37,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-11-19 18:26:37,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1208. [2019-11-19 18:26:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2019-11-19 18:26:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1678 transitions. [2019-11-19 18:26:37,249 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1678 transitions. Word has length 229 [2019-11-19 18:26:37,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:37,249 INFO L462 AbstractCegarLoop]: Abstraction has 1208 states and 1678 transitions. [2019-11-19 18:26:37,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1678 transitions. [2019-11-19 18:26:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-19 18:26:37,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:37,254 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:26:37,254 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:37,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:37,255 INFO L82 PathProgramCache]: Analyzing trace with hash 837799332, now seen corresponding path program 1 times [2019-11-19 18:26:37,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:37,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458270486] [2019-11-19 18:26:37,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-19 18:26:37,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458270486] [2019-11-19 18:26:37,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:37,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:37,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844906896] [2019-11-19 18:26:37,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:37,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:37,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:37,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:37,350 INFO L87 Difference]: Start difference. First operand 1208 states and 1678 transitions. Second operand 3 states. [2019-11-19 18:26:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:37,519 INFO L93 Difference]: Finished difference Result 2560 states and 3577 transitions. [2019-11-19 18:26:37,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:37,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-11-19 18:26:37,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:37,526 INFO L225 Difference]: With dead ends: 2560 [2019-11-19 18:26:37,527 INFO L226 Difference]: Without dead ends: 1346 [2019-11-19 18:26:37,530 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-19 18:26:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2019-11-19 18:26:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1313. [2019-11-19 18:26:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2019-11-19 18:26:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1834 transitions. [2019-11-19 18:26:37,583 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1834 transitions. Word has length 259 [2019-11-19 18:26:37,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:37,584 INFO L462 AbstractCegarLoop]: Abstraction has 1313 states and 1834 transitions. [2019-11-19 18:26:37,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1834 transitions. [2019-11-19 18:26:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-19 18:26:37,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:37,596 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 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, 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] [2019-11-19 18:26:37,597 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:37,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:37,597 INFO L82 PathProgramCache]: Analyzing trace with hash 298818312, now seen corresponding path program 1 times [2019-11-19 18:26:37,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:37,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904901341] [2019-11-19 18:26:37,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1167 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-19 18:26:37,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904901341] [2019-11-19 18:26:37,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:37,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:37,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487396704] [2019-11-19 18:26:37,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:37,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:37,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:37,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:37,774 INFO L87 Difference]: Start difference. First operand 1313 states and 1834 transitions. Second operand 3 states. [2019-11-19 18:26:38,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:38,007 INFO L93 Difference]: Finished difference Result 2656 states and 3703 transitions. [2019-11-19 18:26:38,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:38,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-11-19 18:26:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:38,026 INFO L225 Difference]: With dead ends: 2656 [2019-11-19 18:26:38,026 INFO L226 Difference]: Without dead ends: 1343 [2019-11-19 18:26:38,032 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-19 18:26:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-11-19 18:26:38,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1310. [2019-11-19 18:26:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-11-19 18:26:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1816 transitions. [2019-11-19 18:26:38,088 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1816 transitions. Word has length 294 [2019-11-19 18:26:38,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:38,089 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1816 transitions. [2019-11-19 18:26:38,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1816 transitions. [2019-11-19 18:26:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-11-19 18:26:38,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:38,102 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:26:38,103 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:38,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:38,104 INFO L82 PathProgramCache]: Analyzing trace with hash 430194802, now seen corresponding path program 1 times [2019-11-19 18:26:38,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:38,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333157997] [2019-11-19 18:26:38,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1174 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-19 18:26:38,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333157997] [2019-11-19 18:26:38,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:38,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:38,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159908416] [2019-11-19 18:26:38,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:38,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:38,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:38,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:38,411 INFO L87 Difference]: Start difference. First operand 1310 states and 1816 transitions. Second operand 3 states. [2019-11-19 18:26:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:38,615 INFO L93 Difference]: Finished difference Result 2638 states and 3652 transitions. [2019-11-19 18:26:38,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:38,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-11-19 18:26:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:38,625 INFO L225 Difference]: With dead ends: 2638 [2019-11-19 18:26:38,625 INFO L226 Difference]: Without dead ends: 1337 [2019-11-19 18:26:38,628 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-19 18:26:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2019-11-19 18:26:38,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1310. [2019-11-19 18:26:38,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-11-19 18:26:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1789 transitions. [2019-11-19 18:26:38,684 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1789 transitions. Word has length 304 [2019-11-19 18:26:38,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:38,685 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1789 transitions. [2019-11-19 18:26:38,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:38,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1789 transitions. [2019-11-19 18:26:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-11-19 18:26:38,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:38,699 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:38,699 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:38,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:38,700 INFO L82 PathProgramCache]: Analyzing trace with hash 863432469, now seen corresponding path program 1 times [2019-11-19 18:26:38,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:38,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063527159] [2019-11-19 18:26:38,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 729 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-19 18:26:38,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063527159] [2019-11-19 18:26:38,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:38,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:38,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726024002] [2019-11-19 18:26:38,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:38,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:38,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:38,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:38,909 INFO L87 Difference]: Start difference. First operand 1310 states and 1789 transitions. Second operand 3 states. [2019-11-19 18:26:39,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:39,151 INFO L93 Difference]: Finished difference Result 2761 states and 3742 transitions. [2019-11-19 18:26:39,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:39,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-11-19 18:26:39,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:39,162 INFO L225 Difference]: With dead ends: 2761 [2019-11-19 18:26:39,163 INFO L226 Difference]: Without dead ends: 1460 [2019-11-19 18:26:39,166 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-19 18:26:39,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2019-11-19 18:26:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1355. [2019-11-19 18:26:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2019-11-19 18:26:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1849 transitions. [2019-11-19 18:26:39,223 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1849 transitions. Word has length 331 [2019-11-19 18:26:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:39,224 INFO L462 AbstractCegarLoop]: Abstraction has 1355 states and 1849 transitions. [2019-11-19 18:26:39,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1849 transitions. [2019-11-19 18:26:39,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-19 18:26:39,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:39,234 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 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, 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] [2019-11-19 18:26:39,235 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:39,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:39,235 INFO L82 PathProgramCache]: Analyzing trace with hash 762439870, now seen corresponding path program 1 times [2019-11-19 18:26:39,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:39,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032908484] [2019-11-19 18:26:39,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 869 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-11-19 18:26:39,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032908484] [2019-11-19 18:26:39,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:39,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:39,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429288449] [2019-11-19 18:26:39,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:39,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:39,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:39,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:39,532 INFO L87 Difference]: Start difference. First operand 1355 states and 1849 transitions. Second operand 3 states. [2019-11-19 18:26:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:39,586 INFO L93 Difference]: Finished difference Result 3852 states and 5281 transitions. [2019-11-19 18:26:39,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:39,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-19 18:26:39,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:39,599 INFO L225 Difference]: With dead ends: 3852 [2019-11-19 18:26:39,599 INFO L226 Difference]: Without dead ends: 2506 [2019-11-19 18:26:39,601 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-19 18:26:39,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-11-19 18:26:39,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2019-11-19 18:26:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-11-19 18:26:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3435 transitions. [2019-11-19 18:26:39,669 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3435 transitions. Word has length 332 [2019-11-19 18:26:39,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:39,669 INFO L462 AbstractCegarLoop]: Abstraction has 2504 states and 3435 transitions. [2019-11-19 18:26:39,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:39,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3435 transitions. [2019-11-19 18:26:39,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-11-19 18:26:39,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:39,717 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:26:39,718 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:39,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:39,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1156712834, now seen corresponding path program 1 times [2019-11-19 18:26:39,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:39,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991164343] [2019-11-19 18:26:39,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-19 18:26:39,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991164343] [2019-11-19 18:26:39,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418361874] [2019-11-19 18:26:39,854 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-19 18:26:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:39,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 18:26:40,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:26:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-11-19 18:26:40,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 18:26:40,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 18:26:40,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225411822] [2019-11-19 18:26:40,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:40,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:40,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:40,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:26:40,336 INFO L87 Difference]: Start difference. First operand 2504 states and 3435 transitions. Second operand 3 states. [2019-11-19 18:26:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:40,420 INFO L93 Difference]: Finished difference Result 5826 states and 7988 transitions. [2019-11-19 18:26:40,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:40,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-11-19 18:26:40,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:40,441 INFO L225 Difference]: With dead ends: 5826 [2019-11-19 18:26:40,441 INFO L226 Difference]: Without dead ends: 3331 [2019-11-19 18:26:40,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 342 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-19 18:26:40,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2019-11-19 18:26:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3331. [2019-11-19 18:26:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3331 states. [2019-11-19 18:26:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4560 transitions. [2019-11-19 18:26:40,549 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4560 transitions. Word has length 342 [2019-11-19 18:26:40,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:40,550 INFO L462 AbstractCegarLoop]: Abstraction has 3331 states and 4560 transitions. [2019-11-19 18:26:40,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4560 transitions. [2019-11-19 18:26:40,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-11-19 18:26:40,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:40,561 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:26:40,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:26:40,767 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:40,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash 938688742, now seen corresponding path program 1 times [2019-11-19 18:26:40,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:40,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866402846] [2019-11-19 18:26:40,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-19 18:26:41,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866402846] [2019-11-19 18:26:41,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685928280] [2019-11-19 18:26:41,014 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-19 18:26:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:41,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 18:26:41,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:26:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-19 18:26:41,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:26:41,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-19 18:26:41,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854399039] [2019-11-19 18:26:41,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:26:41,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:41,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:26:41,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:26:41,396 INFO L87 Difference]: Start difference. First operand 3331 states and 4560 transitions. Second operand 4 states. [2019-11-19 18:26:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:41,956 INFO L93 Difference]: Finished difference Result 6603 states and 9028 transitions. [2019-11-19 18:26:41,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:26:41,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 344 [2019-11-19 18:26:41,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:41,987 INFO L225 Difference]: With dead ends: 6603 [2019-11-19 18:26:41,988 INFO L226 Difference]: Without dead ends: 4983 [2019-11-19 18:26:41,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 346 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-19 18:26:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4983 states. [2019-11-19 18:26:42,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4983 to 3683. [2019-11-19 18:26:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3683 states. [2019-11-19 18:26:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 4980 transitions. [2019-11-19 18:26:42,187 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 4980 transitions. Word has length 344 [2019-11-19 18:26:42,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:42,188 INFO L462 AbstractCegarLoop]: Abstraction has 3683 states and 4980 transitions. [2019-11-19 18:26:42,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:26:42,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 4980 transitions. [2019-11-19 18:26:42,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-11-19 18:26:42,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:42,206 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:42,422 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:26:42,422 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:42,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:42,423 INFO L82 PathProgramCache]: Analyzing trace with hash 741254605, now seen corresponding path program 1 times [2019-11-19 18:26:42,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:42,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728920226] [2019-11-19 18:26:42,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-19 18:26:42,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728920226] [2019-11-19 18:26:42,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370997330] [2019-11-19 18:26:42,577 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-19 18:26:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:42,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 18:26:42,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:26:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-19 18:26:42,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:26:42,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-19 18:26:42,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542887730] [2019-11-19 18:26:42,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:26:42,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:42,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:26:42,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:26:42,831 INFO L87 Difference]: Start difference. First operand 3683 states and 4980 transitions. Second operand 4 states. [2019-11-19 18:26:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:43,248 INFO L93 Difference]: Finished difference Result 8481 states and 11469 transitions. [2019-11-19 18:26:43,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:26:43,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2019-11-19 18:26:43,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:43,270 INFO L225 Difference]: With dead ends: 8481 [2019-11-19 18:26:43,271 INFO L226 Difference]: Without dead ends: 4798 [2019-11-19 18:26:43,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 372 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-19 18:26:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4798 states. [2019-11-19 18:26:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4798 to 3841. [2019-11-19 18:26:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2019-11-19 18:26:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 5140 transitions. [2019-11-19 18:26:43,398 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 5140 transitions. Word has length 370 [2019-11-19 18:26:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:43,398 INFO L462 AbstractCegarLoop]: Abstraction has 3841 states and 5140 transitions. [2019-11-19 18:26:43,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:26:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 5140 transitions. [2019-11-19 18:26:43,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-11-19 18:26:43,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:43,410 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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, 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-19 18:26:43,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:26:43,614 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:43,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:43,614 INFO L82 PathProgramCache]: Analyzing trace with hash 232077189, now seen corresponding path program 1 times [2019-11-19 18:26:43,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:43,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832591205] [2019-11-19 18:26:43,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-19 18:26:43,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832591205] [2019-11-19 18:26:43,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:26:43,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:26:43,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574210080] [2019-11-19 18:26:43,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:43,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:43,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:43,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:26:43,773 INFO L87 Difference]: Start difference. First operand 3841 states and 5140 transitions. Second operand 3 states. [2019-11-19 18:26:43,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:43,934 INFO L93 Difference]: Finished difference Result 7373 states and 9714 transitions. [2019-11-19 18:26:43,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:43,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 409 [2019-11-19 18:26:43,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:43,941 INFO L225 Difference]: With dead ends: 7373 [2019-11-19 18:26:43,941 INFO L226 Difference]: Without dead ends: 1985 [2019-11-19 18:26:43,947 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-19 18:26:43,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-11-19 18:26:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1893. [2019-11-19 18:26:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-11-19 18:26:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2533 transitions. [2019-11-19 18:26:43,989 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2533 transitions. Word has length 409 [2019-11-19 18:26:43,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:43,990 INFO L462 AbstractCegarLoop]: Abstraction has 1893 states and 2533 transitions. [2019-11-19 18:26:43,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2533 transitions. [2019-11-19 18:26:43,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-19 18:26:43,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:43,995 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-19 18:26:43,995 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:43,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:43,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1256651121, now seen corresponding path program 1 times [2019-11-19 18:26:43,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:43,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018235883] [2019-11-19 18:26:43,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 1545 proven. 14 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2019-11-19 18:26:44,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018235883] [2019-11-19 18:26:44,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164259137] [2019-11-19 18:26:44,234 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-19 18:26:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:44,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 18:26:44,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:26:44,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 2338 trivial. 0 not checked. [2019-11-19 18:26:44,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 18:26:44,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 18:26:44,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492442379] [2019-11-19 18:26:44,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:44,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:44,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:44,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:26:44,788 INFO L87 Difference]: Start difference. First operand 1893 states and 2533 transitions. Second operand 3 states. [2019-11-19 18:26:45,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:45,042 INFO L93 Difference]: Finished difference Result 3956 states and 5317 transitions. [2019-11-19 18:26:45,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:45,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-19 18:26:45,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:45,062 INFO L225 Difference]: With dead ends: 3956 [2019-11-19 18:26:45,062 INFO L226 Difference]: Without dead ends: 1991 [2019-11-19 18:26:45,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 493 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-19 18:26:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-11-19 18:26:45,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1987. [2019-11-19 18:26:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-11-19 18:26:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2576 transitions. [2019-11-19 18:26:45,134 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2576 transitions. Word has length 493 [2019-11-19 18:26:45,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:45,135 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 2576 transitions. [2019-11-19 18:26:45,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:45,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2576 transitions. [2019-11-19 18:26:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-19 18:26:45,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:45,145 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:26:45,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:26:45,360 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:45,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:45,360 INFO L82 PathProgramCache]: Analyzing trace with hash 709390269, now seen corresponding path program 1 times [2019-11-19 18:26:45,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:45,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730865974] [2019-11-19 18:26:45,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-11-19 18:26:45,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730865974] [2019-11-19 18:26:45,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789102638] [2019-11-19 18:26:45,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:26:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:45,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 18:26:45,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:26:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1019 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2019-11-19 18:26:45,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 18:26:45,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 18:26:45,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416102810] [2019-11-19 18:26:45,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:26:45,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:45,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:26:45,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:26:45,976 INFO L87 Difference]: Start difference. First operand 1987 states and 2576 transitions. Second operand 3 states. [2019-11-19 18:26:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:46,001 INFO L93 Difference]: Finished difference Result 2038 states and 2641 transitions. [2019-11-19 18:26:46,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:26:46,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-19 18:26:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:46,006 INFO L225 Difference]: With dead ends: 2038 [2019-11-19 18:26:46,006 INFO L226 Difference]: Without dead ends: 1835 [2019-11-19 18:26:46,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 493 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-19 18:26:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-11-19 18:26:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1786. [2019-11-19 18:26:46,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2019-11-19 18:26:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2314 transitions. [2019-11-19 18:26:46,052 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2314 transitions. Word has length 493 [2019-11-19 18:26:46,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:46,053 INFO L462 AbstractCegarLoop]: Abstraction has 1786 states and 2314 transitions. [2019-11-19 18:26:46,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:26:46,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2314 transitions. [2019-11-19 18:26:46,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-11-19 18:26:46,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:26:46,087 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:26:46,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:26:46,293 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:26:46,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:26:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1730430293, now seen corresponding path program 2 times [2019-11-19 18:26:46,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:26:46,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192293122] [2019-11-19 18:26:46,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:26:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:26:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-11-19 18:26:46,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192293122] [2019-11-19 18:26:46,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894437717] [2019-11-19 18:26:46,546 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:26:46,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 18:26:46,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:26:46,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 18:26:46,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:26:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-11-19 18:26:47,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:26:47,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-19 18:26:47,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955761636] [2019-11-19 18:26:47,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:26:47,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:26:47,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:26:47,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:26:47,032 INFO L87 Difference]: Start difference. First operand 1786 states and 2314 transitions. Second operand 4 states. [2019-11-19 18:26:47,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:26:47,201 INFO L93 Difference]: Finished difference Result 2046 states and 2645 transitions. [2019-11-19 18:26:47,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:26:47,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 603 [2019-11-19 18:26:47,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:26:47,203 INFO L225 Difference]: With dead ends: 2046 [2019-11-19 18:26:47,203 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 18:26:47,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 605 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-19 18:26:47,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 18:26:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 18:26:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 18:26:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 18:26:47,207 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 603 [2019-11-19 18:26:47,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:26:47,207 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 18:26:47,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:26:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 18:26:47,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 18:26:47,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:26:47,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 18:26:47,969 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 103 [2019-11-19 18:26:48,163 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2019-11-19 18:26:48,658 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2019-11-19 18:26:48,993 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-19 18:26:49,136 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-11-19 18:26:49,805 WARN L191 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-11-19 18:26:49,888 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 370) no Hoare annotation was computed. [2019-11-19 18:26:49,888 INFO L444 ceAbstractionStarter]: For program point L366-2(lines 366 370) no Hoare annotation was computed. [2019-11-19 18:26:49,889 INFO L444 ceAbstractionStarter]: For program point L565(lines 565 593) no Hoare annotation was computed. [2019-11-19 18:26:49,889 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 540) no Hoare annotation was computed. [2019-11-19 18:26:49,889 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 551) no Hoare annotation was computed. [2019-11-19 18:26:49,889 INFO L444 ceAbstractionStarter]: For program point L103(lines 103 562) no Hoare annotation was computed. [2019-11-19 18:26:49,889 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 590) no Hoare annotation was computed. [2019-11-19 18:26:49,889 INFO L444 ceAbstractionStarter]: For program point L500-1(lines 198 528) no Hoare annotation was computed. [2019-11-19 18:26:49,889 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 340) no Hoare annotation was computed. [2019-11-19 18:26:49,889 INFO L444 ceAbstractionStarter]: For program point L302-1(lines 302 316) no Hoare annotation was computed. [2019-11-19 18:26:49,890 INFO L440 ceAbstractionStarter]: At program point L203(lines 100 563) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-11-19 18:26:49,890 INFO L440 ceAbstractionStarter]: At program point L170(lines 166 541) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse1 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))) [2019-11-19 18:26:49,890 INFO L444 ceAbstractionStarter]: For program point L600(lines 600 604) no Hoare annotation was computed. [2019-11-19 18:26:49,890 INFO L444 ceAbstractionStarter]: For program point L567(lines 567 576) no Hoare annotation was computed. [2019-11-19 18:26:49,890 INFO L444 ceAbstractionStarter]: For program point L600-2(lines 600 604) no Hoare annotation was computed. [2019-11-19 18:26:49,890 INFO L444 ceAbstractionStarter]: For program point L567-2(lines 566 588) no Hoare annotation was computed. [2019-11-19 18:26:49,890 INFO L444 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-11-19 18:26:49,890 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 539) no Hoare annotation was computed. [2019-11-19 18:26:49,890 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 550) no Hoare annotation was computed. [2019-11-19 18:26:49,891 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 561) no Hoare annotation was computed. [2019-11-19 18:26:49,891 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 573) no Hoare annotation was computed. [2019-11-19 18:26:49,892 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 442) no Hoare annotation was computed. [2019-11-19 18:26:49,892 INFO L440 ceAbstractionStarter]: At program point L140(lines 136 551) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse0 .cse1 .cse2))) [2019-11-19 18:26:49,892 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-11-19 18:26:49,892 INFO L444 ceAbstractionStarter]: For program point L471(lines 471 475) no Hoare annotation was computed. [2019-11-19 18:26:49,892 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-19 18:26:49,893 INFO L444 ceAbstractionStarter]: For program point L306-2(lines 304 316) no Hoare annotation was computed. [2019-11-19 18:26:49,893 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 505 509) no Hoare annotation was computed. [2019-11-19 18:26:49,893 INFO L444 ceAbstractionStarter]: For program point L406(lines 406 410) no Hoare annotation was computed. [2019-11-19 18:26:49,893 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 212) no Hoare annotation was computed. [2019-11-19 18:26:49,893 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 538) no Hoare annotation was computed. [2019-11-19 18:26:49,894 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 549) no Hoare annotation was computed. [2019-11-19 18:26:49,894 INFO L444 ceAbstractionStarter]: For program point L208-2(lines 198 528) no Hoare annotation was computed. [2019-11-19 18:26:49,894 INFO L444 ceAbstractionStarter]: For program point L109(lines 109 560) no Hoare annotation was computed. [2019-11-19 18:26:49,894 INFO L440 ceAbstractionStarter]: At program point L176(lines 172 539) the Hoare annotation is: (let ((.cse5 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (and .cse4 (and .cse0 .cse5)) (and .cse0 .cse5 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-19 18:26:49,894 INFO L444 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-11-19 18:26:49,895 INFO L444 ceAbstractionStarter]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-11-19 18:26:49,895 INFO L447 ceAbstractionStarter]: At program point L607(lines 7 609) the Hoare annotation is: true [2019-11-19 18:26:49,895 INFO L444 ceAbstractionStarter]: For program point L244(lines 244 249) no Hoare annotation was computed. [2019-11-19 18:26:49,895 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 537) no Hoare annotation was computed. [2019-11-19 18:26:49,895 INFO L444 ceAbstractionStarter]: For program point L145(lines 145 548) no Hoare annotation was computed. [2019-11-19 18:26:49,895 INFO L444 ceAbstractionStarter]: For program point L112(lines 112 559) no Hoare annotation was computed. [2019-11-19 18:26:49,896 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-11-19 18:26:49,896 INFO L444 ceAbstractionStarter]: For program point L476-2(lines 476 480) no Hoare annotation was computed. [2019-11-19 18:26:49,896 INFO L440 ceAbstractionStarter]: At program point L146(lines 142 549) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2))) [2019-11-19 18:26:49,896 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 382) no Hoare annotation was computed. [2019-11-19 18:26:49,896 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-11-19 18:26:49,896 INFO L444 ceAbstractionStarter]: For program point L279(lines 279 287) no Hoare annotation was computed. [2019-11-19 18:26:49,897 INFO L440 ceAbstractionStarter]: At program point L346(lines 60 608) the Hoare annotation is: false [2019-11-19 18:26:49,897 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 536) no Hoare annotation was computed. [2019-11-19 18:26:49,897 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 547) no Hoare annotation was computed. [2019-11-19 18:26:49,897 INFO L444 ceAbstractionStarter]: For program point L115(lines 115 558) no Hoare annotation was computed. [2019-11-19 18:26:49,897 INFO L444 ceAbstractionStarter]: For program point L578(lines 578 584) no Hoare annotation was computed. [2019-11-19 18:26:49,898 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 516) no Hoare annotation was computed. [2019-11-19 18:26:49,898 INFO L444 ceAbstractionStarter]: For program point L512-2(lines 512 516) no Hoare annotation was computed. [2019-11-19 18:26:49,898 INFO L440 ceAbstractionStarter]: At program point L182(lines 178 537) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse3) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 .cse4) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3)))) [2019-11-19 18:26:49,898 INFO L440 ceAbstractionStarter]: At program point L116(lines 112 559) 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-19 18:26:49,898 INFO L444 ceAbstractionStarter]: For program point L447(lines 447 451) no Hoare annotation was computed. [2019-11-19 18:26:49,898 INFO L444 ceAbstractionStarter]: For program point L282(lines 282 286) no Hoare annotation was computed. [2019-11-19 18:26:49,899 INFO L444 ceAbstractionStarter]: For program point L282-2(lines 198 528) no Hoare annotation was computed. [2019-11-19 18:26:49,899 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-11-19 18:26:49,899 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 535) no Hoare annotation was computed. [2019-11-19 18:26:49,899 INFO L444 ceAbstractionStarter]: For program point L151(lines 151 546) no Hoare annotation was computed. [2019-11-19 18:26:49,899 INFO L444 ceAbstractionStarter]: For program point L118(lines 118 557) no Hoare annotation was computed. [2019-11-19 18:26:49,899 INFO L444 ceAbstractionStarter]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-11-19 18:26:49,900 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 354) no Hoare annotation was computed. [2019-11-19 18:26:49,900 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 18:26:49,900 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 484 496) no Hoare annotation was computed. [2019-11-19 18:26:49,900 INFO L444 ceAbstractionStarter]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-11-19 18:26:49,900 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 237) no Hoare annotation was computed. [2019-11-19 18:26:49,900 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 534) no Hoare annotation was computed. [2019-11-19 18:26:49,901 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 545) no Hoare annotation was computed. [2019-11-19 18:26:49,901 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 198 528) no Hoare annotation was computed. [2019-11-19 18:26:49,901 INFO L444 ceAbstractionStarter]: For program point L121(lines 121 556) no Hoare annotation was computed. [2019-11-19 18:26:49,901 INFO L440 ceAbstractionStarter]: At program point L188(lines 184 535) the Hoare annotation is: (let ((.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse3 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 .cse1 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse4) (and (not .cse3) .cse0 .cse1 .cse5))) [2019-11-19 18:26:49,901 INFO L440 ceAbstractionStarter]: At program point L122(lines 118 557) 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-19 18:26:49,902 INFO L447 ceAbstractionStarter]: At program point L618(lines 610 620) the Hoare annotation is: true [2019-11-19 18:26:49,902 INFO L444 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-19 18:26:49,902 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 227) no Hoare annotation was computed. [2019-11-19 18:26:49,902 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 492) no Hoare annotation was computed. [2019-11-19 18:26:49,902 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 465) no Hoare annotation was computed. [2019-11-19 18:26:49,903 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 454 465) no Hoare annotation was computed. [2019-11-19 18:26:49,903 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 18:26:49,903 INFO L444 ceAbstractionStarter]: For program point L190(lines 190 533) no Hoare annotation was computed. [2019-11-19 18:26:49,903 INFO L444 ceAbstractionStarter]: For program point L157(lines 157 544) no Hoare annotation was computed. [2019-11-19 18:26:49,903 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 555) no Hoare annotation was computed. [2019-11-19 18:26:49,903 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 393) no Hoare annotation was computed. [2019-11-19 18:26:49,904 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-11-19 18:26:49,904 INFO L444 ceAbstractionStarter]: For program point L323-2(lines 198 528) no Hoare annotation was computed. [2019-11-19 18:26:49,904 INFO L440 ceAbstractionStarter]: At program point L191(lines 190 533) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.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))) (or (and .cse0 (not .cse1) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse3) (and (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse2 .cse3 .cse4 .cse1 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse1 .cse5))) [2019-11-19 18:26:49,904 INFO L440 ceAbstractionStarter]: At program point L158(lines 148 547) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2))) [2019-11-19 18:26:49,904 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 462) no Hoare annotation was computed. [2019-11-19 18:26:49,905 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 262) no Hoare annotation was computed. [2019-11-19 18:26:49,905 INFO L444 ceAbstractionStarter]: For program point L258-2(lines 198 528) no Hoare annotation was computed. [2019-11-19 18:26:49,905 INFO L444 ceAbstractionStarter]: For program point L193(lines 193 532) no Hoare annotation was computed. [2019-11-19 18:26:49,905 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 543) no Hoare annotation was computed. [2019-11-19 18:26:49,905 INFO L444 ceAbstractionStarter]: For program point L127(lines 127 554) no Hoare annotation was computed. [2019-11-19 18:26:49,905 INFO L444 ceAbstractionStarter]: For program point L94-1(lines 60 608) no Hoare annotation was computed. [2019-11-19 18:26:49,905 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 18:26:49,906 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-11-19 18:26:49,906 INFO L444 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-11-19 18:26:49,906 INFO L447 ceAbstractionStarter]: At program point L194(lines 193 532) the Hoare annotation is: true [2019-11-19 18:26:49,906 INFO L440 ceAbstractionStarter]: At program point L128(lines 124 555) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-19 18:26:49,906 INFO L444 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-11-19 18:26:49,907 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-19 18:26:49,907 INFO L444 ceAbstractionStarter]: For program point L426-2(lines 198 528) no Hoare annotation was computed. [2019-11-19 18:26:49,907 INFO L444 ceAbstractionStarter]: For program point L228(lines 228 233) no Hoare annotation was computed. [2019-11-19 18:26:49,907 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 365) no Hoare annotation was computed. [2019-11-19 18:26:49,907 INFO L444 ceAbstractionStarter]: For program point L163(lines 163 542) no Hoare annotation was computed. [2019-11-19 18:26:49,907 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 553) no Hoare annotation was computed. [2019-11-19 18:26:49,908 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 564) no Hoare annotation was computed. [2019-11-19 18:26:49,908 INFO L444 ceAbstractionStarter]: For program point L395(lines 395 400) no Hoare annotation was computed. [2019-11-19 18:26:49,908 INFO L444 ceAbstractionStarter]: For program point L395-2(lines 395 400) no Hoare annotation was computed. [2019-11-19 18:26:49,908 INFO L447 ceAbstractionStarter]: At program point L197(lines 196 531) the Hoare annotation is: true [2019-11-19 18:26:49,908 INFO L440 ceAbstractionStarter]: At program point L164(lines 160 543) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2))) [2019-11-19 18:26:49,908 INFO L440 ceAbstractionStarter]: At program point L98(lines 97 564) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-19 18:26:49,909 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed. [2019-11-19 18:26:49,909 INFO L440 ceAbstractionStarter]: At program point L529(lines 94 595) the Hoare annotation is: (let ((.cse10 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse3 (not .cse10)) (.cse6 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse11 (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse15 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse13 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse8 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse12 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse14 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse5 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse16 (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse2) (and .cse0 .cse1 .cse10) (and .cse6 .cse7 .cse0 .cse9 .cse2) (and .cse1 .cse8 .cse2) (and .cse3 .cse6 .cse7 .cse0) (and .cse11 .cse12 .cse0) (and .cse12 .cse13 .cse8 .cse10 .cse14) (and .cse8 .cse4 .cse5 .cse9 .cse10 .cse2) (and .cse8 .cse15 .cse13 .cse10 .cse2) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse0) (and .cse11 .cse12 .cse8 .cse10 .cse2) (and .cse0 .cse10 .cse15) (and .cse16 .cse13 .cse8 .cse10) (and .cse12 .cse0 .cse10 .cse14) (and .cse0 .cse4 .cse5 .cse9 .cse10 .cse2) (and .cse16 .cse0 .cse10)))) [2019-11-19 18:26:49,909 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 541) no Hoare annotation was computed. [2019-11-19 18:26:49,909 INFO L444 ceAbstractionStarter]: For program point L133(lines 133 552) no Hoare annotation was computed. [2019-11-19 18:26:49,910 INFO L444 ceAbstractionStarter]: For program point L100(lines 100 563) no Hoare annotation was computed. [2019-11-19 18:26:49,910 INFO L447 ceAbstractionStarter]: At program point L596(lines 93 597) the Hoare annotation is: true [2019-11-19 18:26:49,910 INFO L440 ceAbstractionStarter]: At program point L134(lines 130 553) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2))) [2019-11-19 18:26:49,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:26:49 BoogieIcfgContainer [2019-11-19 18:26:49,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:26:49,937 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:26:49,937 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:26:49,937 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:26:49,938 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:26:33" (3/4) ... [2019-11-19 18:26:49,941 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 18:26:49,957 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 18:26:49,958 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 18:26:50,055 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:26:50,055 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:26:50,057 INFO L168 Benchmark]: Toolchain (without parser) took 17901.11 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 965.2 MB). Free memory was 956.3 MB in the beginning and 1.7 GB in the end (delta: -729.9 MB). Peak memory consumption was 235.3 MB. Max. memory is 11.5 GB. [2019-11-19 18:26:50,057 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:26:50,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-19 18:26:50,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:26:50,058 INFO L168 Benchmark]: Boogie Preprocessor took 49.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:26:50,059 INFO L168 Benchmark]: RCFGBuilder took 665.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. [2019-11-19 18:26:50,059 INFO L168 Benchmark]: TraceAbstraction took 16573.96 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 848.3 MB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -655.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-19 18:26:50,060 INFO L168 Benchmark]: Witness Printer took 119.03 ms. Allocated memory is still 2.0 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-19 18:26:50,061 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 436.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 665.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16573.96 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 848.3 MB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -655.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 119.03 ms. Allocated memory is still 2.0 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 606]: 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: 118]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((((s__state <= 4528 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) || (4512 <= s__state && s__state <= 4528 && blastFlag <= 2)) || (((s__state <= 4528 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state)) || ((((4512 <= s__state && s__state <= 4528) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || ((((blastFlag <= 4 && s__state <= 4432) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 0 == s__hit) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((4560 <= s__state && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || ((((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560)) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((s__state <= 4464 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) || ((((s__state <= 4464 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((s__state <= 4480 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) || (((s__state <= 4480 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((((((s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0 && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((s__state <= 4512 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state) || (((s__state <= 4512 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state)) || ((((s__state <= 4512 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || (((((blastFlag <= 4 && s__state <= 4432) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((((s__state <= 4560 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state) || ((4512 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (((s__state <= 4560 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state)) || (s__state <= 4560 && ((blastFlag <= 4 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state) || ((((blastFlag <= 4 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((((((((((((((((((blastFlag <= 2 && 4368 == s__state) || ((blastFlag <= 2 && s__state <= 3) && s__s3__tmp__next_state___0 <= 4560)) || ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (((((4560 <= s__state && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state <= 3 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__s3__tmp__next_state___0 <= 4560)) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2)) || ((((s__state <= 4528 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state)) || ((((((s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0 && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((((s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0 && 4400 == s__state) && blastFlag <= 4) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (s__state == 4384 && blastFlag <= 2)) || ((((4512 <= s__state && s__state <= 4528) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || (((4416 == s__state && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit)) || (((s__state <= 4528 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state)) || (((((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((4416 == s__state && blastFlag <= 2) && 0 == s__hit) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((s__state <= 4512 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) || ((((s__state <= 4512 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 123 locations, 1 error locations. Result: SAFE, OverallTime: 16.4s, OverallIterations: 25, TraceHistogramMax: 21, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, HoareTripleCheckerStatistics: 4391 SDtfs, 2019 SDslu, 2246 SDs, 0 SdLazy, 2459 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2725 GetRequests, 2688 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3841occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2798 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 127 NumberOfFragments, 826 HoareAnnotationTreeSize, 22 FomulaSimplifications, 28203 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24378 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 8751 NumberOfCodeBlocks, 8751 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8720 ConstructedInterpolants, 0 QuantifiedInterpolants, 4981326 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4110 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 31 InterpolantComputations, 22 PerfectInterpolantSequences, 39090/39192 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...