./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer --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-cad4683 [2019-11-15 23:50:55,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:50:55,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:50:55,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:50:55,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:50:55,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:50:55,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:50:55,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:50:55,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:50:55,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:50:55,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:50:55,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:50:55,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:50:55,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:50:55,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:50:55,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:50:55,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:50:55,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:50:55,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:50:55,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:50:55,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:50:55,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:50:55,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:50:55,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:50:55,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:50:55,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:50:55,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:50:55,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:50:55,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:50:55,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:50:55,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:50:55,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:50:55,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:50:55,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:50:55,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:50:55,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:50:55,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:50:55,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:50:55,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:50:55,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:50:55,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:50:55,980 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:50:55,994 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:50:55,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:50:55,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:50:55,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:50:55,996 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:50:55,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:50:55,996 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:50:55,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:50:55,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:50:55,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:50:55,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:50:55,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:50:55,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:50:55,998 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:50:55,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:50:55,998 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:50:55,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:50:55,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:50:55,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:50:55,999 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:50:55,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:50:55,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:50:55,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:50:55,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:50:56,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:50:56,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:50:56,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:50:56,000 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:50:56,000 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer 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-15 23:50:56,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:50:56,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:50:56,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:50:56,040 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:50:56,040 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:50:56,042 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c [2019-11-15 23:50:56,098 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/data/2d8950349/aa1837580aee4f40b541c2ef45e5f046/FLAG973aa91e0 [2019-11-15 23:50:56,526 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:50:56,526 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c [2019-11-15 23:50:56,539 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/data/2d8950349/aa1837580aee4f40b541c2ef45e5f046/FLAG973aa91e0 [2019-11-15 23:50:56,825 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/data/2d8950349/aa1837580aee4f40b541c2ef45e5f046 [2019-11-15 23:50:56,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:50:56,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:50:56,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:50:56,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:50:56,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:50:56,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:50:56" (1/1) ... [2019-11-15 23:50:56,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3566325e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:56, skipping insertion in model container [2019-11-15 23:50:56,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:50:56" (1/1) ... [2019-11-15 23:50:56,846 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:50:56,888 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:50:57,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:50:57,180 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:50:57,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:50:57,251 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:50:57,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:57 WrapperNode [2019-11-15 23:50:57,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:50:57,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:50:57,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:50:57,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:50:57,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:57" (1/1) ... [2019-11-15 23:50:57,270 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:57" (1/1) ... [2019-11-15 23:50:57,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:50:57,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:50:57,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:50:57,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:50:57,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:57" (1/1) ... [2019-11-15 23:50:57,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:57" (1/1) ... [2019-11-15 23:50:57,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:57" (1/1) ... [2019-11-15 23:50:57,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:57" (1/1) ... [2019-11-15 23:50:57,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:57" (1/1) ... [2019-11-15 23:50:57,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:57" (1/1) ... [2019-11-15 23:50:57,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:57" (1/1) ... [2019-11-15 23:50:57,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:50:57,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:50:57,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:50:57,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:50:57,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/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-15 23:50:57,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:50:57,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:50:57,498 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:50:57,934 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 23:50:57,934 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 23:50:57,935 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:50:57,936 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:50:57,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:50:57 BoogieIcfgContainer [2019-11-15 23:50:57,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:50:57,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:50:57,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:50:57,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:50:57,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:50:56" (1/3) ... [2019-11-15 23:50:57,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c99842b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:50:57, skipping insertion in model container [2019-11-15 23:50:57,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:57" (2/3) ... [2019-11-15 23:50:57,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c99842b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:50:57, skipping insertion in model container [2019-11-15 23:50:57,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:50:57" (3/3) ... [2019-11-15 23:50:57,947 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2019-11-15 23:50:57,956 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:50:57,964 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:50:57,974 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:50:58,013 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:50:58,014 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:50:58,014 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:50:58,014 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:50:58,014 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:50:58,014 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:50:58,014 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:50:58,015 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:50:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-11-15 23:50:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:50:58,045 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:58,046 INFO L380 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-15 23:50:58,048 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:58,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:58,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-15 23:50:58,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:58,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702136087] [2019-11-15 23:50:58,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:58,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:58,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:50:58,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702136087] [2019-11-15 23:50:58,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:58,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:50:58,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121437514] [2019-11-15 23:50:58,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:58,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:58,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:58,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:50:58,226 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states. [2019-11-15 23:50:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:58,422 INFO L93 Difference]: Finished difference Result 243 states and 418 transitions. [2019-11-15 23:50:58,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:58,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 23:50:58,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:58,437 INFO L225 Difference]: With dead ends: 243 [2019-11-15 23:50:58,438 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 23:50:58,442 INFO L600 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-15 23:50:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 23:50:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-15 23:50:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 23:50:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-15 23:50:58,493 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-15 23:50:58,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:58,494 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-15 23:50:58,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:50:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-15 23:50:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:50:58,495 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:58,496 INFO L380 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-15 23:50:58,496 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:58,497 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-15 23:50:58,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:58,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114797854] [2019-11-15 23:50:58,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:58,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:58,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:58,583 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-15 23:50:58,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114797854] [2019-11-15 23:50:58,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:58,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:50:58,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109288687] [2019-11-15 23:50:58,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:58,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:58,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:58,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:50:58,586 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-15 23:50:58,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:58,742 INFO L93 Difference]: Finished difference Result 231 states and 353 transitions. [2019-11-15 23:50:58,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:58,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-15 23:50:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:58,744 INFO L225 Difference]: With dead ends: 231 [2019-11-15 23:50:58,744 INFO L226 Difference]: Without dead ends: 129 [2019-11-15 23:50:58,745 INFO L600 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-15 23:50:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-15 23:50:58,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-11-15 23:50:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 23:50:58,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-15 23:50:58,756 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-15 23:50:58,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:58,756 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-15 23:50:58,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:50:58,756 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-15 23:50:58,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:50:58,762 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:58,762 INFO L380 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-15 23:50:58,763 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:58,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:58,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1382730084, now seen corresponding path program 1 times [2019-11-15 23:50:58,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:58,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038747177] [2019-11-15 23:50:58,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:58,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:58,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:58,830 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-15 23:50:58,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038747177] [2019-11-15 23:50:58,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:58,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:50:58,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675477370] [2019-11-15 23:50:58,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:58,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:58,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:58,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:50:58,832 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-15 23:50:58,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:58,977 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2019-11-15 23:50:58,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:58,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 23:50:58,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:58,979 INFO L225 Difference]: With dead ends: 265 [2019-11-15 23:50:58,979 INFO L226 Difference]: Without dead ends: 148 [2019-11-15 23:50:58,980 INFO L600 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-15 23:50:58,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-15 23:50:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2019-11-15 23:50:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-15 23:50:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-15 23:50:58,991 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-15 23:50:58,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:58,994 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-15 23:50:58,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:50:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-15 23:50:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:50:58,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:58,998 INFO L380 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-15 23:50:58,999 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:58,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:58,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1259053610, now seen corresponding path program 1 times [2019-11-15 23:50:58,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:59,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851688383] [2019-11-15 23:50:59,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:59,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:59,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:59,104 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-15 23:50:59,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851688383] [2019-11-15 23:50:59,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:59,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:50:59,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286818242] [2019-11-15 23:50:59,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:59,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:59,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:59,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:50:59,109 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-15 23:50:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:59,314 INFO L93 Difference]: Finished difference Result 327 states and 495 transitions. [2019-11-15 23:50:59,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:59,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 23:50:59,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:59,317 INFO L225 Difference]: With dead ends: 327 [2019-11-15 23:50:59,317 INFO L226 Difference]: Without dead ends: 192 [2019-11-15 23:50:59,318 INFO L600 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-15 23:50:59,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-15 23:50:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2019-11-15 23:50:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-15 23:50:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 260 transitions. [2019-11-15 23:50:59,337 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 260 transitions. Word has length 66 [2019-11-15 23:50:59,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:59,338 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 260 transitions. [2019-11-15 23:50:59,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:50:59,338 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 260 transitions. [2019-11-15 23:50:59,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:50:59,340 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:59,340 INFO L380 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-15 23:50:59,341 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:59,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:59,341 INFO L82 PathProgramCache]: Analyzing trace with hash -546384724, now seen corresponding path program 1 times [2019-11-15 23:50:59,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:59,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447210902] [2019-11-15 23:50:59,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:59,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:59,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:59,392 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-15 23:50:59,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447210902] [2019-11-15 23:50:59,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:59,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:50:59,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9500453] [2019-11-15 23:50:59,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:59,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:59,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:59,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:50:59,394 INFO L87 Difference]: Start difference. First operand 184 states and 260 transitions. Second operand 3 states. [2019-11-15 23:50:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:59,541 INFO L93 Difference]: Finished difference Result 382 states and 547 transitions. [2019-11-15 23:50:59,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:59,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 23:50:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:59,544 INFO L225 Difference]: With dead ends: 382 [2019-11-15 23:50:59,544 INFO L226 Difference]: Without dead ends: 207 [2019-11-15 23:50:59,545 INFO L600 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-15 23:50:59,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-11-15 23:50:59,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-11-15 23:50:59,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-15 23:50:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 284 transitions. [2019-11-15 23:50:59,566 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 284 transitions. Word has length 66 [2019-11-15 23:50:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:59,567 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 284 transitions. [2019-11-15 23:50:59,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:50:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 284 transitions. [2019-11-15 23:50:59,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:50:59,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:59,578 INFO L380 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-15 23:50:59,579 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:59,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:59,579 INFO L82 PathProgramCache]: Analyzing trace with hash 819829122, now seen corresponding path program 1 times [2019-11-15 23:50:59,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:59,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755959987] [2019-11-15 23:50:59,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:59,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:59,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:59,680 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-15 23:50:59,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755959987] [2019-11-15 23:50:59,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:59,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:50:59,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124635486] [2019-11-15 23:50:59,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:59,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:59,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:59,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:50:59,685 INFO L87 Difference]: Start difference. First operand 203 states and 284 transitions. Second operand 3 states. [2019-11-15 23:50:59,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:59,846 INFO L93 Difference]: Finished difference Result 421 states and 597 transitions. [2019-11-15 23:50:59,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:59,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-15 23:50:59,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:59,849 INFO L225 Difference]: With dead ends: 421 [2019-11-15 23:50:59,849 INFO L226 Difference]: Without dead ends: 227 [2019-11-15 23:50:59,850 INFO L600 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-15 23:50:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-15 23:50:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-11-15 23:50:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-15 23:50:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 310 transitions. [2019-11-15 23:50:59,861 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 310 transitions. Word has length 82 [2019-11-15 23:50:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:59,862 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 310 transitions. [2019-11-15 23:50:59,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:50:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 310 transitions. [2019-11-15 23:50:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 23:50:59,864 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:59,864 INFO L380 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-15 23:50:59,864 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:59,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:59,865 INFO L82 PathProgramCache]: Analyzing trace with hash 426015802, now seen corresponding path program 1 times [2019-11-15 23:50:59,865 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:59,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764359979] [2019-11-15 23:50:59,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:59,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:59,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:59,946 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-15 23:50:59,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764359979] [2019-11-15 23:50:59,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:59,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:50:59,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148970705] [2019-11-15 23:50:59,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:59,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:59,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:59,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:50:59,949 INFO L87 Difference]: Start difference. First operand 224 states and 310 transitions. Second operand 3 states. [2019-11-15 23:50:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:59,992 INFO L93 Difference]: Finished difference Result 652 states and 903 transitions. [2019-11-15 23:50:59,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:59,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-15 23:50:59,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:59,996 INFO L225 Difference]: With dead ends: 652 [2019-11-15 23:50:59,997 INFO L226 Difference]: Without dead ends: 437 [2019-11-15 23:50:59,997 INFO L600 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-15 23:50:59,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-15 23:51:00,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-11-15 23:51:00,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-11-15 23:51:00,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 603 transitions. [2019-11-15 23:51:00,016 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 603 transitions. Word has length 102 [2019-11-15 23:51:00,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:00,016 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 603 transitions. [2019-11-15 23:51:00,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:00,017 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 603 transitions. [2019-11-15 23:51:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 23:51:00,019 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:00,020 INFO L380 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-15 23:51:00,020 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:00,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:00,020 INFO L82 PathProgramCache]: Analyzing trace with hash -527041180, now seen corresponding path program 1 times [2019-11-15 23:51:00,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:00,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295869979] [2019-11-15 23:51:00,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:00,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:00,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:00,111 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-15 23:51:00,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295869979] [2019-11-15 23:51:00,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:00,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:00,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584117536] [2019-11-15 23:51:00,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:00,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:00,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:00,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:00,129 INFO L87 Difference]: Start difference. First operand 437 states and 603 transitions. Second operand 3 states. [2019-11-15 23:51:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:00,182 INFO L93 Difference]: Finished difference Result 652 states and 900 transitions. [2019-11-15 23:51:00,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:00,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-15 23:51:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:00,187 INFO L225 Difference]: With dead ends: 652 [2019-11-15 23:51:00,187 INFO L226 Difference]: Without dead ends: 650 [2019-11-15 23:51:00,188 INFO L600 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-15 23:51:00,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-11-15 23:51:00,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-11-15 23:51:00,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-11-15 23:51:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 898 transitions. [2019-11-15 23:51:00,208 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 898 transitions. Word has length 104 [2019-11-15 23:51:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:00,209 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 898 transitions. [2019-11-15 23:51:00,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 898 transitions. [2019-11-15 23:51:00,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-15 23:51:00,211 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:00,212 INFO L380 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-15 23:51:00,212 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:00,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:00,212 INFO L82 PathProgramCache]: Analyzing trace with hash -892474837, now seen corresponding path program 1 times [2019-11-15 23:51:00,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:00,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205966726] [2019-11-15 23:51:00,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:00,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:00,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:00,280 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-15 23:51:00,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205966726] [2019-11-15 23:51:00,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:00,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:00,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85428247] [2019-11-15 23:51:00,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:00,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:00,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:00,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:00,283 INFO L87 Difference]: Start difference. First operand 650 states and 898 transitions. Second operand 3 states. [2019-11-15 23:51:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:00,460 INFO L93 Difference]: Finished difference Result 1441 states and 2047 transitions. [2019-11-15 23:51:00,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:00,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-15 23:51:00,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:00,466 INFO L225 Difference]: With dead ends: 1441 [2019-11-15 23:51:00,466 INFO L226 Difference]: Without dead ends: 797 [2019-11-15 23:51:00,467 INFO L600 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-15 23:51:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-11-15 23:51:00,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 767. [2019-11-15 23:51:00,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-11-15 23:51:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1087 transitions. [2019-11-15 23:51:00,487 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1087 transitions. Word has length 158 [2019-11-15 23:51:00,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:00,488 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1087 transitions. [2019-11-15 23:51:00,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1087 transitions. [2019-11-15 23:51:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-15 23:51:00,491 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:00,491 INFO L380 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-15 23:51:00,491 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:00,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:00,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1787424402, now seen corresponding path program 1 times [2019-11-15 23:51:00,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:00,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477797943] [2019-11-15 23:51:00,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:00,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:00,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:00,546 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-15 23:51:00,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477797943] [2019-11-15 23:51:00,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:00,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:00,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093048432] [2019-11-15 23:51:00,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:00,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:00,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:00,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:00,556 INFO L87 Difference]: Start difference. First operand 767 states and 1087 transitions. Second operand 3 states. [2019-11-15 23:51:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:00,724 INFO L93 Difference]: Finished difference Result 1803 states and 2628 transitions. [2019-11-15 23:51:00,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:00,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-15 23:51:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:00,731 INFO L225 Difference]: With dead ends: 1803 [2019-11-15 23:51:00,732 INFO L226 Difference]: Without dead ends: 994 [2019-11-15 23:51:00,737 INFO L600 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-15 23:51:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-11-15 23:51:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 956. [2019-11-15 23:51:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-11-15 23:51:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1339 transitions. [2019-11-15 23:51:00,763 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1339 transitions. Word has length 184 [2019-11-15 23:51:00,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:00,764 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 1339 transitions. [2019-11-15 23:51:00,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1339 transitions. [2019-11-15 23:51:00,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-15 23:51:00,769 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:00,769 INFO L380 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-15 23:51:00,769 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:00,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:00,770 INFO L82 PathProgramCache]: Analyzing trace with hash 78119093, now seen corresponding path program 1 times [2019-11-15 23:51:00,770 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:00,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050262866] [2019-11-15 23:51:00,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:00,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:00,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:00,838 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-15 23:51:00,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050262866] [2019-11-15 23:51:00,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:00,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:00,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010379327] [2019-11-15 23:51:00,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:00,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:00,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:00,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:00,841 INFO L87 Difference]: Start difference. First operand 956 states and 1339 transitions. Second operand 3 states. [2019-11-15 23:51:01,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:01,025 INFO L93 Difference]: Finished difference Result 2059 states and 2905 transitions. [2019-11-15 23:51:01,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:01,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-15 23:51:01,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:01,032 INFO L225 Difference]: With dead ends: 2059 [2019-11-15 23:51:01,032 INFO L226 Difference]: Without dead ends: 1067 [2019-11-15 23:51:01,033 INFO L600 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-15 23:51:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-11-15 23:51:01,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1031. [2019-11-15 23:51:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2019-11-15 23:51:01,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1435 transitions. [2019-11-15 23:51:01,060 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1435 transitions. Word has length 205 [2019-11-15 23:51:01,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:01,061 INFO L462 AbstractCegarLoop]: Abstraction has 1031 states and 1435 transitions. [2019-11-15 23:51:01,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1435 transitions. [2019-11-15 23:51:01,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-15 23:51:01,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:01,065 INFO L380 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-15 23:51:01,065 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:01,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:01,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2106820770, now seen corresponding path program 1 times [2019-11-15 23:51:01,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:01,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195363041] [2019-11-15 23:51:01,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:01,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:01,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:01,164 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-15 23:51:01,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195363041] [2019-11-15 23:51:01,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:01,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:01,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914244286] [2019-11-15 23:51:01,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:01,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:01,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:01,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:01,167 INFO L87 Difference]: Start difference. First operand 1031 states and 1435 transitions. Second operand 3 states. [2019-11-15 23:51:01,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:01,368 INFO L93 Difference]: Finished difference Result 2209 states and 3094 transitions. [2019-11-15 23:51:01,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:01,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-15 23:51:01,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:01,375 INFO L225 Difference]: With dead ends: 2209 [2019-11-15 23:51:01,375 INFO L226 Difference]: Without dead ends: 1148 [2019-11-15 23:51:01,377 INFO L600 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-15 23:51:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-11-15 23:51:01,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1115. [2019-11-15 23:51:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-11-15 23:51:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1546 transitions. [2019-11-15 23:51:01,414 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1546 transitions. Word has length 229 [2019-11-15 23:51:01,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:01,414 INFO L462 AbstractCegarLoop]: Abstraction has 1115 states and 1546 transitions. [2019-11-15 23:51:01,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1546 transitions. [2019-11-15 23:51:01,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-15 23:51:01,419 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:01,419 INFO L380 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-15 23:51:01,420 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:01,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:01,420 INFO L82 PathProgramCache]: Analyzing trace with hash 73426724, now seen corresponding path program 1 times [2019-11-15 23:51:01,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:01,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641322797] [2019-11-15 23:51:01,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:01,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:01,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:01,531 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-15 23:51:01,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641322797] [2019-11-15 23:51:01,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:01,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:01,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041072473] [2019-11-15 23:51:01,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:01,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:01,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:01,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:01,533 INFO L87 Difference]: Start difference. First operand 1115 states and 1546 transitions. Second operand 3 states. [2019-11-15 23:51:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:01,713 INFO L93 Difference]: Finished difference Result 2377 states and 3319 transitions. [2019-11-15 23:51:01,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:01,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-15 23:51:01,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:01,720 INFO L225 Difference]: With dead ends: 2377 [2019-11-15 23:51:01,721 INFO L226 Difference]: Without dead ends: 1244 [2019-11-15 23:51:01,722 INFO L600 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-15 23:51:01,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-11-15 23:51:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1208. [2019-11-15 23:51:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2019-11-15 23:51:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1678 transitions. [2019-11-15 23:51:01,754 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1678 transitions. Word has length 229 [2019-11-15 23:51:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:01,754 INFO L462 AbstractCegarLoop]: Abstraction has 1208 states and 1678 transitions. [2019-11-15 23:51:01,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1678 transitions. [2019-11-15 23:51:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-15 23:51:01,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:01,759 INFO L380 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-15 23:51:01,760 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:01,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:01,760 INFO L82 PathProgramCache]: Analyzing trace with hash 837799332, now seen corresponding path program 1 times [2019-11-15 23:51:01,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:01,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020607441] [2019-11-15 23:51:01,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:01,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:01,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:01,850 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-15 23:51:01,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020607441] [2019-11-15 23:51:01,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:01,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:01,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398022321] [2019-11-15 23:51:01,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:01,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:01,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:01,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:01,852 INFO L87 Difference]: Start difference. First operand 1208 states and 1678 transitions. Second operand 3 states. [2019-11-15 23:51:02,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:02,025 INFO L93 Difference]: Finished difference Result 2560 states and 3577 transitions. [2019-11-15 23:51:02,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:02,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-11-15 23:51:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:02,033 INFO L225 Difference]: With dead ends: 2560 [2019-11-15 23:51:02,033 INFO L226 Difference]: Without dead ends: 1346 [2019-11-15 23:51:02,036 INFO L600 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-15 23:51:02,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2019-11-15 23:51:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1313. [2019-11-15 23:51:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2019-11-15 23:51:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1834 transitions. [2019-11-15 23:51:02,073 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1834 transitions. Word has length 259 [2019-11-15 23:51:02,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:02,073 INFO L462 AbstractCegarLoop]: Abstraction has 1313 states and 1834 transitions. [2019-11-15 23:51:02,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1834 transitions. [2019-11-15 23:51:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-15 23:51:02,079 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:02,079 INFO L380 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-15 23:51:02,079 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:02,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:02,080 INFO L82 PathProgramCache]: Analyzing trace with hash 298818312, now seen corresponding path program 1 times [2019-11-15 23:51:02,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:02,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065893913] [2019-11-15 23:51:02,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:02,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:02,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:02,180 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-15 23:51:02,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065893913] [2019-11-15 23:51:02,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:02,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:02,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180452968] [2019-11-15 23:51:02,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:02,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:02,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:02,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:02,182 INFO L87 Difference]: Start difference. First operand 1313 states and 1834 transitions. Second operand 3 states. [2019-11-15 23:51:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:02,350 INFO L93 Difference]: Finished difference Result 2656 states and 3703 transitions. [2019-11-15 23:51:02,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:02,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-11-15 23:51:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:02,358 INFO L225 Difference]: With dead ends: 2656 [2019-11-15 23:51:02,358 INFO L226 Difference]: Without dead ends: 1343 [2019-11-15 23:51:02,361 INFO L600 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-15 23:51:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-11-15 23:51:02,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1310. [2019-11-15 23:51:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-11-15 23:51:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1816 transitions. [2019-11-15 23:51:02,398 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1816 transitions. Word has length 294 [2019-11-15 23:51:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:02,399 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1816 transitions. [2019-11-15 23:51:02,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1816 transitions. [2019-11-15 23:51:02,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-11-15 23:51:02,408 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:02,408 INFO L380 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-15 23:51:02,408 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:02,409 INFO L82 PathProgramCache]: Analyzing trace with hash 430194802, now seen corresponding path program 1 times [2019-11-15 23:51:02,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:02,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578868845] [2019-11-15 23:51:02,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:02,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:02,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:02,559 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-15 23:51:02,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578868845] [2019-11-15 23:51:02,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:02,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:02,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791323506] [2019-11-15 23:51:02,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:02,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:02,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:02,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:02,566 INFO L87 Difference]: Start difference. First operand 1310 states and 1816 transitions. Second operand 3 states. [2019-11-15 23:51:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:02,724 INFO L93 Difference]: Finished difference Result 2638 states and 3652 transitions. [2019-11-15 23:51:02,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:02,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-11-15 23:51:02,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:02,732 INFO L225 Difference]: With dead ends: 2638 [2019-11-15 23:51:02,733 INFO L226 Difference]: Without dead ends: 1337 [2019-11-15 23:51:02,735 INFO L600 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-15 23:51:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2019-11-15 23:51:02,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1310. [2019-11-15 23:51:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-11-15 23:51:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1789 transitions. [2019-11-15 23:51:02,772 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1789 transitions. Word has length 304 [2019-11-15 23:51:02,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:02,772 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1789 transitions. [2019-11-15 23:51:02,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:02,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1789 transitions. [2019-11-15 23:51:02,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-11-15 23:51:02,779 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:02,779 INFO L380 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-15 23:51:02,779 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:02,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:02,780 INFO L82 PathProgramCache]: Analyzing trace with hash 863432469, now seen corresponding path program 1 times [2019-11-15 23:51:02,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:02,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943784389] [2019-11-15 23:51:02,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:02,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:02,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:02,910 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-15 23:51:02,910 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943784389] [2019-11-15 23:51:02,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:02,911 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:02,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838149979] [2019-11-15 23:51:02,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:02,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:02,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:02,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:02,912 INFO L87 Difference]: Start difference. First operand 1310 states and 1789 transitions. Second operand 3 states. [2019-11-15 23:51:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:03,073 INFO L93 Difference]: Finished difference Result 2761 states and 3742 transitions. [2019-11-15 23:51:03,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:03,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-11-15 23:51:03,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:03,081 INFO L225 Difference]: With dead ends: 2761 [2019-11-15 23:51:03,081 INFO L226 Difference]: Without dead ends: 1460 [2019-11-15 23:51:03,084 INFO L600 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-15 23:51:03,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2019-11-15 23:51:03,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1355. [2019-11-15 23:51:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2019-11-15 23:51:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1849 transitions. [2019-11-15 23:51:03,122 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1849 transitions. Word has length 331 [2019-11-15 23:51:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:03,122 INFO L462 AbstractCegarLoop]: Abstraction has 1355 states and 1849 transitions. [2019-11-15 23:51:03,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:03,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1849 transitions. [2019-11-15 23:51:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-15 23:51:03,128 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:03,130 INFO L380 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-15 23:51:03,130 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:03,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:03,131 INFO L82 PathProgramCache]: Analyzing trace with hash 762439870, now seen corresponding path program 1 times [2019-11-15 23:51:03,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:03,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78764127] [2019-11-15 23:51:03,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:03,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:03,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:03,278 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-15 23:51:03,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78764127] [2019-11-15 23:51:03,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:03,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:03,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586430109] [2019-11-15 23:51:03,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:03,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:03,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:03,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:03,281 INFO L87 Difference]: Start difference. First operand 1355 states and 1849 transitions. Second operand 3 states. [2019-11-15 23:51:03,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:03,329 INFO L93 Difference]: Finished difference Result 3852 states and 5281 transitions. [2019-11-15 23:51:03,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:03,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-15 23:51:03,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:03,343 INFO L225 Difference]: With dead ends: 3852 [2019-11-15 23:51:03,343 INFO L226 Difference]: Without dead ends: 2506 [2019-11-15 23:51:03,345 INFO L600 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-15 23:51:03,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-11-15 23:51:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2019-11-15 23:51:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-11-15 23:51:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3435 transitions. [2019-11-15 23:51:03,456 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3435 transitions. Word has length 332 [2019-11-15 23:51:03,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:03,457 INFO L462 AbstractCegarLoop]: Abstraction has 2504 states and 3435 transitions. [2019-11-15 23:51:03,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3435 transitions. [2019-11-15 23:51:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-11-15 23:51:03,464 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:03,465 INFO L380 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-15 23:51:03,465 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:03,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:03,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1156712834, now seen corresponding path program 1 times [2019-11-15 23:51:03,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:03,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366414547] [2019-11-15 23:51:03,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:03,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:03,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:03,602 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-15 23:51:03,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366414547] [2019-11-15 23:51:03,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535719140] [2019-11-15 23:51:03,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/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-15 23:51:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:03,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:51:03,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:51:04,015 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-15 23:51:04,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:51:04,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 23:51:04,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315300862] [2019-11-15 23:51:04,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:04,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:04,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:04,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:04,018 INFO L87 Difference]: Start difference. First operand 2504 states and 3435 transitions. Second operand 3 states. [2019-11-15 23:51:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:04,089 INFO L93 Difference]: Finished difference Result 5826 states and 7988 transitions. [2019-11-15 23:51:04,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:04,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-11-15 23:51:04,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:04,107 INFO L225 Difference]: With dead ends: 5826 [2019-11-15 23:51:04,108 INFO L226 Difference]: Without dead ends: 3331 [2019-11-15 23:51:04,111 INFO L600 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-15 23:51:04,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2019-11-15 23:51:04,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3331. [2019-11-15 23:51:04,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3331 states. [2019-11-15 23:51:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4560 transitions. [2019-11-15 23:51:04,214 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4560 transitions. Word has length 342 [2019-11-15 23:51:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:04,214 INFO L462 AbstractCegarLoop]: Abstraction has 3331 states and 4560 transitions. [2019-11-15 23:51:04,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4560 transitions. [2019-11-15 23:51:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-11-15 23:51:04,223 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:04,223 INFO L380 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-15 23:51:04,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:51:04,436 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:04,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:04,437 INFO L82 PathProgramCache]: Analyzing trace with hash 938688742, now seen corresponding path program 1 times [2019-11-15 23:51:04,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:04,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355469620] [2019-11-15 23:51:04,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:04,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:04,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:04,698 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-15 23:51:04,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355469620] [2019-11-15 23:51:04,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472777718] [2019-11-15 23:51:04,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/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-15 23:51:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:04,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:51:04,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:51:04,926 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-15 23:51:04,926 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:51:04,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 23:51:04,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6983967] [2019-11-15 23:51:04,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:04,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:04,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:04,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:04,929 INFO L87 Difference]: Start difference. First operand 3331 states and 4560 transitions. Second operand 4 states. [2019-11-15 23:51:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:05,324 INFO L93 Difference]: Finished difference Result 6603 states and 9028 transitions. [2019-11-15 23:51:05,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:51:05,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 344 [2019-11-15 23:51:05,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:05,351 INFO L225 Difference]: With dead ends: 6603 [2019-11-15 23:51:05,351 INFO L226 Difference]: Without dead ends: 4983 [2019-11-15 23:51:05,354 INFO L600 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-15 23:51:05,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4983 states. [2019-11-15 23:51:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4983 to 3683. [2019-11-15 23:51:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3683 states. [2019-11-15 23:51:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 4980 transitions. [2019-11-15 23:51:05,479 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 4980 transitions. Word has length 344 [2019-11-15 23:51:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:05,479 INFO L462 AbstractCegarLoop]: Abstraction has 3683 states and 4980 transitions. [2019-11-15 23:51:05,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 4980 transitions. [2019-11-15 23:51:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-11-15 23:51:05,488 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:05,488 INFO L380 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-15 23:51:05,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:51:05,692 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:05,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:05,692 INFO L82 PathProgramCache]: Analyzing trace with hash 741254605, now seen corresponding path program 1 times [2019-11-15 23:51:05,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:05,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013998755] [2019-11-15 23:51:05,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:05,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:05,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:05,844 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-15 23:51:05,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013998755] [2019-11-15 23:51:05,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549847471] [2019-11-15 23:51:05,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/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-15 23:51:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:05,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:51:05,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:51:06,123 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-15 23:51:06,123 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:51:06,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 23:51:06,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288537365] [2019-11-15 23:51:06,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:06,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:06,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:06,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:06,127 INFO L87 Difference]: Start difference. First operand 3683 states and 4980 transitions. Second operand 4 states. [2019-11-15 23:51:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:06,487 INFO L93 Difference]: Finished difference Result 8481 states and 11469 transitions. [2019-11-15 23:51:06,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:06,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2019-11-15 23:51:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:06,525 INFO L225 Difference]: With dead ends: 8481 [2019-11-15 23:51:06,525 INFO L226 Difference]: Without dead ends: 4798 [2019-11-15 23:51:06,530 INFO L600 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-15 23:51:06,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4798 states. [2019-11-15 23:51:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4798 to 3841. [2019-11-15 23:51:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2019-11-15 23:51:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 5140 transitions. [2019-11-15 23:51:06,648 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 5140 transitions. Word has length 370 [2019-11-15 23:51:06,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:06,648 INFO L462 AbstractCegarLoop]: Abstraction has 3841 states and 5140 transitions. [2019-11-15 23:51:06,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 5140 transitions. [2019-11-15 23:51:06,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-11-15 23:51:06,663 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:06,663 INFO L380 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-15 23:51:06,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:51:06,868 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:06,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:06,868 INFO L82 PathProgramCache]: Analyzing trace with hash 232077189, now seen corresponding path program 1 times [2019-11-15 23:51:06,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:06,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835379390] [2019-11-15 23:51:06,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:06,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:06,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:07,029 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-15 23:51:07,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835379390] [2019-11-15 23:51:07,029 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:07,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:07,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86579970] [2019-11-15 23:51:07,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:07,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:07,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:07,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:07,031 INFO L87 Difference]: Start difference. First operand 3841 states and 5140 transitions. Second operand 3 states. [2019-11-15 23:51:07,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:07,210 INFO L93 Difference]: Finished difference Result 7373 states and 9714 transitions. [2019-11-15 23:51:07,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:07,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 409 [2019-11-15 23:51:07,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:07,215 INFO L225 Difference]: With dead ends: 7373 [2019-11-15 23:51:07,215 INFO L226 Difference]: Without dead ends: 1985 [2019-11-15 23:51:07,222 INFO L600 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-15 23:51:07,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-11-15 23:51:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1893. [2019-11-15 23:51:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-11-15 23:51:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2533 transitions. [2019-11-15 23:51:07,267 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2533 transitions. Word has length 409 [2019-11-15 23:51:07,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:07,268 INFO L462 AbstractCegarLoop]: Abstraction has 1893 states and 2533 transitions. [2019-11-15 23:51:07,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2533 transitions. [2019-11-15 23:51:07,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-15 23:51:07,279 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:07,280 INFO L380 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-15 23:51:07,280 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1256651121, now seen corresponding path program 1 times [2019-11-15 23:51:07,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:07,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786302610] [2019-11-15 23:51:07,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:07,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:07,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:07,549 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-15 23:51:07,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786302610] [2019-11-15 23:51:07,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430771244] [2019-11-15 23:51:07,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/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-15 23:51:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:07,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:51:07,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:51:07,857 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-15 23:51:07,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:51:07,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 23:51:07,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597800996] [2019-11-15 23:51:07,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:07,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:07,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:07,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:07,860 INFO L87 Difference]: Start difference. First operand 1893 states and 2533 transitions. Second operand 3 states. [2019-11-15 23:51:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:08,044 INFO L93 Difference]: Finished difference Result 3956 states and 5317 transitions. [2019-11-15 23:51:08,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:08,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-15 23:51:08,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:08,049 INFO L225 Difference]: With dead ends: 3956 [2019-11-15 23:51:08,049 INFO L226 Difference]: Without dead ends: 1991 [2019-11-15 23:51:08,052 INFO L600 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-15 23:51:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-11-15 23:51:08,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1987. [2019-11-15 23:51:08,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-11-15 23:51:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2576 transitions. [2019-11-15 23:51:08,098 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2576 transitions. Word has length 493 [2019-11-15 23:51:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:08,099 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 2576 transitions. [2019-11-15 23:51:08,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:08,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2576 transitions. [2019-11-15 23:51:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-15 23:51:08,104 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:08,105 INFO L380 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-15 23:51:08,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:51:08,310 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:08,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:08,310 INFO L82 PathProgramCache]: Analyzing trace with hash 709390269, now seen corresponding path program 1 times [2019-11-15 23:51:08,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:08,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521613928] [2019-11-15 23:51:08,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:08,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:08,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:08,501 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-15 23:51:08,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521613928] [2019-11-15 23:51:08,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745309598] [2019-11-15 23:51:08,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/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-15 23:51:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:08,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:51:08,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:51:08,950 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-15 23:51:08,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:51:08,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 23:51:08,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598846042] [2019-11-15 23:51:08,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:08,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:08,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:08,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:08,954 INFO L87 Difference]: Start difference. First operand 1987 states and 2576 transitions. Second operand 3 states. [2019-11-15 23:51:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:08,980 INFO L93 Difference]: Finished difference Result 2038 states and 2641 transitions. [2019-11-15 23:51:08,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:08,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-15 23:51:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:08,984 INFO L225 Difference]: With dead ends: 2038 [2019-11-15 23:51:08,984 INFO L226 Difference]: Without dead ends: 1835 [2019-11-15 23:51:08,985 INFO L600 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-15 23:51:08,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-11-15 23:51:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1786. [2019-11-15 23:51:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2019-11-15 23:51:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2314 transitions. [2019-11-15 23:51:09,025 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2314 transitions. Word has length 493 [2019-11-15 23:51:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:09,026 INFO L462 AbstractCegarLoop]: Abstraction has 1786 states and 2314 transitions. [2019-11-15 23:51:09,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2314 transitions. [2019-11-15 23:51:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-11-15 23:51:09,032 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:09,032 INFO L380 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-15 23:51:09,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:51:09,245 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:09,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:09,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1730430293, now seen corresponding path program 2 times [2019-11-15 23:51:09,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:09,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611666733] [2019-11-15 23:51:09,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:09,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:09,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:09,516 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-15 23:51:09,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611666733] [2019-11-15 23:51:09,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628538060] [2019-11-15 23:51:09,517 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/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-15 23:51:09,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:51:09,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:51:09,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:51:09,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:51:09,976 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-15 23:51:09,977 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:51:09,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 23:51:09,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326451674] [2019-11-15 23:51:09,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:09,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:09,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:09,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:09,980 INFO L87 Difference]: Start difference. First operand 1786 states and 2314 transitions. Second operand 4 states. [2019-11-15 23:51:10,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:10,152 INFO L93 Difference]: Finished difference Result 2046 states and 2645 transitions. [2019-11-15 23:51:10,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:10,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 603 [2019-11-15 23:51:10,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:10,154 INFO L225 Difference]: With dead ends: 2046 [2019-11-15 23:51:10,154 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:51:10,156 INFO L600 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-15 23:51:10,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:51:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:51:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:51:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:51:10,157 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 603 [2019-11-15 23:51:10,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:10,157 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:51:10,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:51:10,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:51:10,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:51:10,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:51:10,814 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 103 [2019-11-15 23:51:11,009 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2019-11-15 23:51:11,211 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2019-11-15 23:51:11,513 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2019-11-15 23:51:11,805 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-15 23:51:11,936 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-11-15 23:51:12,671 WARN L191 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-11-15 23:51:12,773 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 370) no Hoare annotation was computed. [2019-11-15 23:51:12,773 INFO L443 ceAbstractionStarter]: For program point L366-2(lines 366 370) no Hoare annotation was computed. [2019-11-15 23:51:12,773 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 593) no Hoare annotation was computed. [2019-11-15 23:51:12,773 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 540) no Hoare annotation was computed. [2019-11-15 23:51:12,773 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 551) no Hoare annotation was computed. [2019-11-15 23:51:12,773 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 562) no Hoare annotation was computed. [2019-11-15 23:51:12,773 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 590) no Hoare annotation was computed. [2019-11-15 23:51:12,773 INFO L443 ceAbstractionStarter]: For program point L500-1(lines 198 528) no Hoare annotation was computed. [2019-11-15 23:51:12,773 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 340) no Hoare annotation was computed. [2019-11-15 23:51:12,774 INFO L443 ceAbstractionStarter]: For program point L302-1(lines 302 316) no Hoare annotation was computed. [2019-11-15 23:51:12,774 INFO L439 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-15 23:51:12,774 INFO L439 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-15 23:51:12,774 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 604) no Hoare annotation was computed. [2019-11-15 23:51:12,774 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 576) no Hoare annotation was computed. [2019-11-15 23:51:12,774 INFO L443 ceAbstractionStarter]: For program point L600-2(lines 600 604) no Hoare annotation was computed. [2019-11-15 23:51:12,774 INFO L443 ceAbstractionStarter]: For program point L567-2(lines 566 588) no Hoare annotation was computed. [2019-11-15 23:51:12,774 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-11-15 23:51:12,774 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 539) no Hoare annotation was computed. [2019-11-15 23:51:12,775 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 550) no Hoare annotation was computed. [2019-11-15 23:51:12,775 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 561) no Hoare annotation was computed. [2019-11-15 23:51:12,775 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 573) no Hoare annotation was computed. [2019-11-15 23:51:12,775 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 442) no Hoare annotation was computed. [2019-11-15 23:51:12,775 INFO L439 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-15 23:51:12,775 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-11-15 23:51:12,775 INFO L443 ceAbstractionStarter]: For program point L471(lines 471 475) no Hoare annotation was computed. [2019-11-15 23:51:12,775 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-15 23:51:12,775 INFO L443 ceAbstractionStarter]: For program point L306-2(lines 304 316) no Hoare annotation was computed. [2019-11-15 23:51:12,775 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 505 509) no Hoare annotation was computed. [2019-11-15 23:51:12,775 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 410) no Hoare annotation was computed. [2019-11-15 23:51:12,776 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 212) no Hoare annotation was computed. [2019-11-15 23:51:12,776 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 538) no Hoare annotation was computed. [2019-11-15 23:51:12,776 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 549) no Hoare annotation was computed. [2019-11-15 23:51:12,776 INFO L443 ceAbstractionStarter]: For program point L208-2(lines 198 528) no Hoare annotation was computed. [2019-11-15 23:51:12,776 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 560) no Hoare annotation was computed. [2019-11-15 23:51:12,776 INFO L439 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-15 23:51:12,776 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-11-15 23:51:12,776 INFO L443 ceAbstractionStarter]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-11-15 23:51:12,776 INFO L446 ceAbstractionStarter]: At program point L607(lines 7 609) the Hoare annotation is: true [2019-11-15 23:51:12,776 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 249) no Hoare annotation was computed. [2019-11-15 23:51:12,777 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 537) no Hoare annotation was computed. [2019-11-15 23:51:12,777 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 548) no Hoare annotation was computed. [2019-11-15 23:51:12,777 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 559) no Hoare annotation was computed. [2019-11-15 23:51:12,777 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-11-15 23:51:12,777 INFO L443 ceAbstractionStarter]: For program point L476-2(lines 476 480) no Hoare annotation was computed. [2019-11-15 23:51:12,777 INFO L439 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-15 23:51:12,777 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 382) no Hoare annotation was computed. [2019-11-15 23:51:12,777 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-11-15 23:51:12,777 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 287) no Hoare annotation was computed. [2019-11-15 23:51:12,777 INFO L439 ceAbstractionStarter]: At program point L346(lines 60 608) the Hoare annotation is: false [2019-11-15 23:51:12,778 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 536) no Hoare annotation was computed. [2019-11-15 23:51:12,780 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 547) no Hoare annotation was computed. [2019-11-15 23:51:12,780 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 558) no Hoare annotation was computed. [2019-11-15 23:51:12,780 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 584) no Hoare annotation was computed. [2019-11-15 23:51:12,780 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 516) no Hoare annotation was computed. [2019-11-15 23:51:12,780 INFO L443 ceAbstractionStarter]: For program point L512-2(lines 512 516) no Hoare annotation was computed. [2019-11-15 23:51:12,781 INFO L439 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-15 23:51:12,781 INFO L439 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-15 23:51:12,781 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 451) no Hoare annotation was computed. [2019-11-15 23:51:12,781 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 286) no Hoare annotation was computed. [2019-11-15 23:51:12,781 INFO L443 ceAbstractionStarter]: For program point L282-2(lines 198 528) no Hoare annotation was computed. [2019-11-15 23:51:12,781 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-11-15 23:51:12,781 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 535) no Hoare annotation was computed. [2019-11-15 23:51:12,782 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 546) no Hoare annotation was computed. [2019-11-15 23:51:12,782 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 557) no Hoare annotation was computed. [2019-11-15 23:51:12,782 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-11-15 23:51:12,782 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 354) no Hoare annotation was computed. [2019-11-15 23:51:12,782 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:51:12,782 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 484 496) no Hoare annotation was computed. [2019-11-15 23:51:12,782 INFO L443 ceAbstractionStarter]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-11-15 23:51:12,782 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 237) no Hoare annotation was computed. [2019-11-15 23:51:12,783 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 534) no Hoare annotation was computed. [2019-11-15 23:51:12,783 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 545) no Hoare annotation was computed. [2019-11-15 23:51:12,783 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 198 528) no Hoare annotation was computed. [2019-11-15 23:51:12,783 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 556) no Hoare annotation was computed. [2019-11-15 23:51:12,783 INFO L439 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-15 23:51:12,783 INFO L439 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-15 23:51:12,784 INFO L446 ceAbstractionStarter]: At program point L618(lines 610 620) the Hoare annotation is: true [2019-11-15 23:51:12,784 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-15 23:51:12,784 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 227) no Hoare annotation was computed. [2019-11-15 23:51:12,784 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 492) no Hoare annotation was computed. [2019-11-15 23:51:12,784 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 465) no Hoare annotation was computed. [2019-11-15 23:51:12,784 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 454 465) no Hoare annotation was computed. [2019-11-15 23:51:12,784 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:51:12,785 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 533) no Hoare annotation was computed. [2019-11-15 23:51:12,785 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 544) no Hoare annotation was computed. [2019-11-15 23:51:12,786 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 555) no Hoare annotation was computed. [2019-11-15 23:51:12,786 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 393) no Hoare annotation was computed. [2019-11-15 23:51:12,786 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-11-15 23:51:12,786 INFO L443 ceAbstractionStarter]: For program point L323-2(lines 198 528) no Hoare annotation was computed. [2019-11-15 23:51:12,787 INFO L439 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-15 23:51:12,788 INFO L439 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-15 23:51:12,788 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 462) no Hoare annotation was computed. [2019-11-15 23:51:12,788 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 262) no Hoare annotation was computed. [2019-11-15 23:51:12,788 INFO L443 ceAbstractionStarter]: For program point L258-2(lines 198 528) no Hoare annotation was computed. [2019-11-15 23:51:12,788 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 532) no Hoare annotation was computed. [2019-11-15 23:51:12,788 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 543) no Hoare annotation was computed. [2019-11-15 23:51:12,788 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 554) no Hoare annotation was computed. [2019-11-15 23:51:12,789 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 60 608) no Hoare annotation was computed. [2019-11-15 23:51:12,789 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:51:12,789 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-11-15 23:51:12,789 INFO L443 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-11-15 23:51:12,789 INFO L446 ceAbstractionStarter]: At program point L194(lines 193 532) the Hoare annotation is: true [2019-11-15 23:51:12,789 INFO L439 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-15 23:51:12,789 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-11-15 23:51:12,790 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-15 23:51:12,790 INFO L443 ceAbstractionStarter]: For program point L426-2(lines 198 528) no Hoare annotation was computed. [2019-11-15 23:51:12,790 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 233) no Hoare annotation was computed. [2019-11-15 23:51:12,790 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 365) no Hoare annotation was computed. [2019-11-15 23:51:12,790 INFO L443 ceAbstractionStarter]: For program point L163(lines 163 542) no Hoare annotation was computed. [2019-11-15 23:51:12,790 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 553) no Hoare annotation was computed. [2019-11-15 23:51:12,790 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 564) no Hoare annotation was computed. [2019-11-15 23:51:12,790 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 400) no Hoare annotation was computed. [2019-11-15 23:51:12,791 INFO L443 ceAbstractionStarter]: For program point L395-2(lines 395 400) no Hoare annotation was computed. [2019-11-15 23:51:12,791 INFO L446 ceAbstractionStarter]: At program point L197(lines 196 531) the Hoare annotation is: true [2019-11-15 23:51:12,791 INFO L439 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-15 23:51:12,791 INFO L439 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-15 23:51:12,791 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed. [2019-11-15 23:51:12,792 INFO L439 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-15 23:51:12,792 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 541) no Hoare annotation was computed. [2019-11-15 23:51:12,792 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 552) no Hoare annotation was computed. [2019-11-15 23:51:12,793 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 563) no Hoare annotation was computed. [2019-11-15 23:51:12,793 INFO L446 ceAbstractionStarter]: At program point L596(lines 93 597) the Hoare annotation is: true [2019-11-15 23:51:12,793 INFO L439 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-15 23:51:12,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:51:12 BoogieIcfgContainer [2019-11-15 23:51:12,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:51:12,834 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:51:12,835 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:51:12,835 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:51:12,835 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:50:57" (3/4) ... [2019-11-15 23:51:12,839 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:51:12,861 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:51:12,862 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:51:13,009 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9a56bba1-f2f3-4dd6-8c46-aebb0b501824/bin/uautomizer/witness.graphml [2019-11-15 23:51:13,010 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:51:13,011 INFO L168 Benchmark]: Toolchain (without parser) took 16183.27 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 891.3 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -278.3 MB). Peak memory consumption was 613.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:13,011 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:51:13,012 INFO L168 Benchmark]: CACSL2BoogieTranslator took 420.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -200.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:13,012 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:13,013 INFO L168 Benchmark]: Boogie Preprocessor took 33.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:51:13,013 INFO L168 Benchmark]: RCFGBuilder took 596.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:13,013 INFO L168 Benchmark]: TraceAbstraction took 14896.09 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 740.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -147.1 MB). Peak memory consumption was 593.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:13,014 INFO L168 Benchmark]: Witness Printer took 175.25 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:13,016 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.49 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 420.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -200.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 596.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14896.09 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 740.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -147.1 MB). Peak memory consumption was 593.7 MB. Max. memory is 11.5 GB. * Witness Printer took 175.25 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.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: 14.7s, OverallIterations: 25, TraceHistogramMax: 21, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, HoareTripleCheckerStatistics: 4391 SDtfs, 2019 SDslu, 2246 SDs, 0 SdLazy, 2459 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2725 GetRequests, 2688 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s 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.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 2798 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 127 NumberOfFragments, 826 HoareAnnotationTreeSize, 22 FomulaSimplifications, 28203 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24378 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.4s 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...