./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c83e1c64d2af1ac92027e4b29fb95a984369de1 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:42:46,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:42:46,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:42:46,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:42:46,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:42:46,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:42:46,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:42:46,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:42:46,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:42:46,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:42:46,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:42:46,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:42:46,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:42:46,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:42:46,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:42:46,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:42:46,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:42:46,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:42:46,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:42:46,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:42:46,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:42:46,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:42:46,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:42:46,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:42:46,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:42:46,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:42:46,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:42:46,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:42:46,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:42:46,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:42:46,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:42:46,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:42:46,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:42:46,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:42:46,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:42:46,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:42:46,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:42:46,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:42:46,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:42:46,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:42:46,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:42:46,503 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-12-07 12:42:46,513 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:42:46,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:42:46,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:42:46,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:42:46,514 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:42:46,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:42:46,514 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:42:46,515 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:42:46,515 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:42:46,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:42:46,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:42:46,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:42:46,515 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:42:46,515 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:42:46,515 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 12:42:46,516 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:42:46,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:42:46,516 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:42:46,516 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:42:46,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:42:46,516 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:42:46,516 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:42:46,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:42:46,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:42:46,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:42:46,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:42:46,517 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:42:46,517 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:42:46,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:42:46,517 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:42:46,517 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:42:46,517 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_e8f63674-ac2f-4d80-9305-79cd35162f30/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 ! overflow) ) 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 -> 3c83e1c64d2af1ac92027e4b29fb95a984369de1 [2019-12-07 12:42:46,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:42:46,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:42:46,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:42:46,630 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:42:46,631 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:42:46,631 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-12-07 12:42:46,673 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/data/fc5f4d856/50974571c3a745ccba6aa4a95e8f1800/FLAG436971f87 [2019-12-07 12:42:47,110 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:42:47,111 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-12-07 12:42:47,122 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/data/fc5f4d856/50974571c3a745ccba6aa4a95e8f1800/FLAG436971f87 [2019-12-07 12:42:47,134 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/data/fc5f4d856/50974571c3a745ccba6aa4a95e8f1800 [2019-12-07 12:42:47,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:42:47,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:42:47,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:42:47,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:42:47,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:42:47,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:42:47" (1/1) ... [2019-12-07 12:42:47,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17574348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:47, skipping insertion in model container [2019-12-07 12:42:47,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:42:47" (1/1) ... [2019-12-07 12:42:47,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:42:47,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:42:47,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:42:47,351 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:42:47,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:42:47,397 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:42:47,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:47 WrapperNode [2019-12-07 12:42:47,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:42:47,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:42:47,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:42:47,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:42:47,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:47" (1/1) ... [2019-12-07 12:42:47,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:47" (1/1) ... [2019-12-07 12:42:47,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:42:47,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:42:47,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:42:47,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:42:47,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:47" (1/1) ... [2019-12-07 12:42:47,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:47" (1/1) ... [2019-12-07 12:42:47,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:47" (1/1) ... [2019-12-07 12:42:47,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:47" (1/1) ... [2019-12-07 12:42:47,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:47" (1/1) ... [2019-12-07 12:42:47,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:47" (1/1) ... [2019-12-07 12:42:47,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:47" (1/1) ... [2019-12-07 12:42:47,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:42:47,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:42:47,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:42:47,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:42:47,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/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-12-07 12:42:47,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:42:47,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:42:47,571 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:42:47,875 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 12:42:47,875 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 12:42:47,876 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:42:47,876 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 12:42:47,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:42:47 BoogieIcfgContainer [2019-12-07 12:42:47,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:42:47,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:42:47,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:42:47,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:42:47,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:42:47" (1/3) ... [2019-12-07 12:42:47,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ba3df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:42:47, skipping insertion in model container [2019-12-07 12:42:47,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:47" (2/3) ... [2019-12-07 12:42:47,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ba3df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:42:47, skipping insertion in model container [2019-12-07 12:42:47,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:42:47" (3/3) ... [2019-12-07 12:42:47,881 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a.BV.c.cil.c [2019-12-07 12:42:47,887 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:42:47,892 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-12-07 12:42:47,899 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-07 12:42:47,914 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:42:47,914 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:42:47,914 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:42:47,914 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:42:47,915 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:42:47,915 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:42:47,915 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:42:47,915 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:42:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-12-07 12:42:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:42:47,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:47,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:47,932 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:47,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:47,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1287811732, now seen corresponding path program 1 times [2019-12-07 12:42:47,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:47,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013206394] [2019-12-07 12:42:47,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:48,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013206394] [2019-12-07 12:42:48,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:48,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:48,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992419060] [2019-12-07 12:42:48,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:48,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:48,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:48,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:48,071 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-12-07 12:42:48,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:48,203 INFO L93 Difference]: Finished difference Result 323 states and 532 transitions. [2019-12-07 12:42:48,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:48,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 12:42:48,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:48,213 INFO L225 Difference]: With dead ends: 323 [2019-12-07 12:42:48,213 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 12:42:48,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:48,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 12:42:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-12-07 12:42:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 12:42:48,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 230 transitions. [2019-12-07 12:42:48,249 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 230 transitions. Word has length 16 [2019-12-07 12:42:48,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:48,250 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 230 transitions. [2019-12-07 12:42:48,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:48,250 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 230 transitions. [2019-12-07 12:42:48,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:42:48,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:48,251 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:48,251 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:48,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:48,251 INFO L82 PathProgramCache]: Analyzing trace with hash 664085130, now seen corresponding path program 1 times [2019-12-07 12:42:48,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:48,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349310346] [2019-12-07 12:42:48,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:48,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349310346] [2019-12-07 12:42:48,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:48,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:48,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599377833] [2019-12-07 12:42:48,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:48,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:48,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:48,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:48,284 INFO L87 Difference]: Start difference. First operand 155 states and 230 transitions. Second operand 3 states. [2019-12-07 12:42:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:48,373 INFO L93 Difference]: Finished difference Result 313 states and 462 transitions. [2019-12-07 12:42:48,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:48,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 12:42:48,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:48,374 INFO L225 Difference]: With dead ends: 313 [2019-12-07 12:42:48,375 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 12:42:48,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 12:42:48,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 156. [2019-12-07 12:42:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-12-07 12:42:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 231 transitions. [2019-12-07 12:42:48,386 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 231 transitions. Word has length 17 [2019-12-07 12:42:48,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:48,386 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 231 transitions. [2019-12-07 12:42:48,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 231 transitions. [2019-12-07 12:42:48,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:42:48,387 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:48,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:48,387 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:48,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:48,387 INFO L82 PathProgramCache]: Analyzing trace with hash 37329238, now seen corresponding path program 1 times [2019-12-07 12:42:48,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:48,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110155742] [2019-12-07 12:42:48,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:48,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110155742] [2019-12-07 12:42:48,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:48,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:48,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596779219] [2019-12-07 12:42:48,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:48,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:48,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:48,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:48,416 INFO L87 Difference]: Start difference. First operand 156 states and 231 transitions. Second operand 3 states. [2019-12-07 12:42:48,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:48,506 INFO L93 Difference]: Finished difference Result 315 states and 464 transitions. [2019-12-07 12:42:48,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:48,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 12:42:48,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:48,508 INFO L225 Difference]: With dead ends: 315 [2019-12-07 12:42:48,508 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 12:42:48,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:48,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 12:42:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2019-12-07 12:42:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 12:42:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2019-12-07 12:42:48,517 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 18 [2019-12-07 12:42:48,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:48,517 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2019-12-07 12:42:48,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:48,518 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2019-12-07 12:42:48,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:42:48,518 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:48,518 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:48,518 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:48,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:48,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1635395343, now seen corresponding path program 1 times [2019-12-07 12:42:48,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:48,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880053177] [2019-12-07 12:42:48,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:48,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:48,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880053177] [2019-12-07 12:42:48,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:48,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:48,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196456487] [2019-12-07 12:42:48,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:48,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:48,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:48,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:48,544 INFO L87 Difference]: Start difference. First operand 157 states and 232 transitions. Second operand 3 states. [2019-12-07 12:42:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:48,634 INFO L93 Difference]: Finished difference Result 317 states and 466 transitions. [2019-12-07 12:42:48,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:48,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 12:42:48,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:48,636 INFO L225 Difference]: With dead ends: 317 [2019-12-07 12:42:48,636 INFO L226 Difference]: Without dead ends: 167 [2019-12-07 12:42:48,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:48,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-12-07 12:42:48,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2019-12-07 12:42:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 12:42:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 233 transitions. [2019-12-07 12:42:48,645 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 233 transitions. Word has length 19 [2019-12-07 12:42:48,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:48,645 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 233 transitions. [2019-12-07 12:42:48,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 233 transitions. [2019-12-07 12:42:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:42:48,646 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:48,646 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:48,646 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:48,647 INFO L82 PathProgramCache]: Analyzing trace with hash -811500677, now seen corresponding path program 1 times [2019-12-07 12:42:48,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:48,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735142649] [2019-12-07 12:42:48,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:48,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735142649] [2019-12-07 12:42:48,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:48,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:48,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417685311] [2019-12-07 12:42:48,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:48,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:48,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:48,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:48,670 INFO L87 Difference]: Start difference. First operand 158 states and 233 transitions. Second operand 3 states. [2019-12-07 12:42:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:48,755 INFO L93 Difference]: Finished difference Result 319 states and 468 transitions. [2019-12-07 12:42:48,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:48,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:42:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:48,756 INFO L225 Difference]: With dead ends: 319 [2019-12-07 12:42:48,756 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 12:42:48,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 12:42:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2019-12-07 12:42:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-12-07 12:42:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 234 transitions. [2019-12-07 12:42:48,764 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 234 transitions. Word has length 20 [2019-12-07 12:42:48,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:48,764 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 234 transitions. [2019-12-07 12:42:48,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 234 transitions. [2019-12-07 12:42:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 12:42:48,766 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:48,766 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:48,766 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:48,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:48,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1579118521, now seen corresponding path program 1 times [2019-12-07 12:42:48,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:48,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587627715] [2019-12-07 12:42:48,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:48,777 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 12:42:48,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [289558048] [2019-12-07 12:42:48,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/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-12-07 12:42:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:48,817 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:42:48,822 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:48,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587627715] [2019-12-07 12:42:48,840 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:42:48,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289558048] [2019-12-07 12:42:48,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:48,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:48,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410124655] [2019-12-07 12:42:48,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:48,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:48,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:48,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:48,842 INFO L87 Difference]: Start difference. First operand 159 states and 234 transitions. Second operand 3 states. [2019-12-07 12:42:48,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:48,873 INFO L93 Difference]: Finished difference Result 455 states and 672 transitions. [2019-12-07 12:42:48,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:48,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 12:42:48,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:48,876 INFO L225 Difference]: With dead ends: 455 [2019-12-07 12:42:48,876 INFO L226 Difference]: Without dead ends: 303 [2019-12-07 12:42:48,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-12-07 12:42:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-07 12:42:48,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2019-12-07 12:42:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-12-07 12:42:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 446 transitions. [2019-12-07 12:42:48,892 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 446 transitions. Word has length 39 [2019-12-07 12:42:48,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:48,893 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 446 transitions. [2019-12-07 12:42:48,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 446 transitions. [2019-12-07 12:42:48,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 12:42:48,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:48,895 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:49,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:49,097 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:49,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:49,098 INFO L82 PathProgramCache]: Analyzing trace with hash 643824433, now seen corresponding path program 1 times [2019-12-07 12:42:49,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:49,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227344622] [2019-12-07 12:42:49,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:49,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227344622] [2019-12-07 12:42:49,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:49,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:49,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005441135] [2019-12-07 12:42:49,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:49,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:49,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:49,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:49,144 INFO L87 Difference]: Start difference. First operand 299 states and 446 transitions. Second operand 3 states. [2019-12-07 12:42:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:49,242 INFO L93 Difference]: Finished difference Result 653 states and 987 transitions. [2019-12-07 12:42:49,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:49,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 12:42:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:49,244 INFO L225 Difference]: With dead ends: 653 [2019-12-07 12:42:49,244 INFO L226 Difference]: Without dead ends: 361 [2019-12-07 12:42:49,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-12-07 12:42:49,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2019-12-07 12:42:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 12:42:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 550 transitions. [2019-12-07 12:42:49,255 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 550 transitions. Word has length 44 [2019-12-07 12:42:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:49,255 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 550 transitions. [2019-12-07 12:42:49,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 550 transitions. [2019-12-07 12:42:49,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 12:42:49,257 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:49,257 INFO L410 BasicCegarLoop]: trace histogram [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-12-07 12:42:49,257 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:49,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:49,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1369957728, now seen corresponding path program 1 times [2019-12-07 12:42:49,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:49,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382168185] [2019-12-07 12:42:49,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:49,266 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 12:42:49,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2002263896] [2019-12-07 12:42:49,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/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-12-07 12:42:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:49,300 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:42:49,302 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:49,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382168185] [2019-12-07 12:42:49,309 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:42:49,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002263896] [2019-12-07 12:42:49,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:49,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:49,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846429792] [2019-12-07 12:42:49,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:49,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:49,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:49,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:49,311 INFO L87 Difference]: Start difference. First operand 361 states and 550 transitions. Second operand 3 states. [2019-12-07 12:42:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:49,340 INFO L93 Difference]: Finished difference Result 719 states and 1092 transitions. [2019-12-07 12:42:49,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:49,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 12:42:49,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:49,344 INFO L225 Difference]: With dead ends: 719 [2019-12-07 12:42:49,344 INFO L226 Difference]: Without dead ends: 536 [2019-12-07 12:42:49,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-12-07 12:42:49,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-12-07 12:42:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 532. [2019-12-07 12:42:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-12-07 12:42:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 815 transitions. [2019-12-07 12:42:49,364 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 815 transitions. Word has length 55 [2019-12-07 12:42:49,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:49,365 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 815 transitions. [2019-12-07 12:42:49,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 815 transitions. [2019-12-07 12:42:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 12:42:49,366 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:49,367 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:49,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:49,567 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:49,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:49,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1405602907, now seen corresponding path program 1 times [2019-12-07 12:42:49,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:49,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031739924] [2019-12-07 12:42:49,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 12:42:49,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031739924] [2019-12-07 12:42:49,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:49,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:49,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833500444] [2019-12-07 12:42:49,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:49,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:49,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:49,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:49,594 INFO L87 Difference]: Start difference. First operand 532 states and 815 transitions. Second operand 3 states. [2019-12-07 12:42:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:49,686 INFO L93 Difference]: Finished difference Result 1111 states and 1694 transitions. [2019-12-07 12:42:49,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:49,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 12:42:49,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:49,689 INFO L225 Difference]: With dead ends: 1111 [2019-12-07 12:42:49,690 INFO L226 Difference]: Without dead ends: 586 [2019-12-07 12:42:49,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-12-07 12:42:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 580. [2019-12-07 12:42:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-07 12:42:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 878 transitions. [2019-12-07 12:42:49,706 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 878 transitions. Word has length 56 [2019-12-07 12:42:49,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:49,706 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 878 transitions. [2019-12-07 12:42:49,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:49,706 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 878 transitions. [2019-12-07 12:42:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 12:42:49,707 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:49,708 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:49,708 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:49,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:49,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2147424561, now seen corresponding path program 1 times [2019-12-07 12:42:49,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:49,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021954731] [2019-12-07 12:42:49,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 12:42:49,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021954731] [2019-12-07 12:42:49,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:49,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:49,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325074014] [2019-12-07 12:42:49,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:49,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:49,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:49,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:49,734 INFO L87 Difference]: Start difference. First operand 580 states and 878 transitions. Second operand 3 states. [2019-12-07 12:42:49,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:49,821 INFO L93 Difference]: Finished difference Result 1162 states and 1757 transitions. [2019-12-07 12:42:49,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:49,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-07 12:42:49,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:49,825 INFO L225 Difference]: With dead ends: 1162 [2019-12-07 12:42:49,825 INFO L226 Difference]: Without dead ends: 589 [2019-12-07 12:42:49,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-12-07 12:42:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 583. [2019-12-07 12:42:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-12-07 12:42:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 878 transitions. [2019-12-07 12:42:49,847 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 878 transitions. Word has length 57 [2019-12-07 12:42:49,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:49,847 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 878 transitions. [2019-12-07 12:42:49,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 878 transitions. [2019-12-07 12:42:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 12:42:49,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:49,848 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:49,849 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:49,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:49,849 INFO L82 PathProgramCache]: Analyzing trace with hash -216125576, now seen corresponding path program 1 times [2019-12-07 12:42:49,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:49,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148552619] [2019-12-07 12:42:49,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 12:42:49,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148552619] [2019-12-07 12:42:49,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:49,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:49,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137004691] [2019-12-07 12:42:49,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:49,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:49,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:49,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:49,880 INFO L87 Difference]: Start difference. First operand 583 states and 878 transitions. Second operand 3 states. [2019-12-07 12:42:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:50,005 INFO L93 Difference]: Finished difference Result 1291 states and 1970 transitions. [2019-12-07 12:42:50,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:50,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-07 12:42:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:50,009 INFO L225 Difference]: With dead ends: 1291 [2019-12-07 12:42:50,010 INFO L226 Difference]: Without dead ends: 715 [2019-12-07 12:42:50,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-12-07 12:42:50,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 709. [2019-12-07 12:42:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-12-07 12:42:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1091 transitions. [2019-12-07 12:42:50,029 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1091 transitions. Word has length 70 [2019-12-07 12:42:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:50,029 INFO L462 AbstractCegarLoop]: Abstraction has 709 states and 1091 transitions. [2019-12-07 12:42:50,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1091 transitions. [2019-12-07 12:42:50,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 12:42:50,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:50,030 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:50,031 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:50,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:50,031 INFO L82 PathProgramCache]: Analyzing trace with hash 380295080, now seen corresponding path program 1 times [2019-12-07 12:42:50,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:50,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541499053] [2019-12-07 12:42:50,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 12:42:50,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541499053] [2019-12-07 12:42:50,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:50,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:50,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437020737] [2019-12-07 12:42:50,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:50,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:50,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:50,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:50,054 INFO L87 Difference]: Start difference. First operand 709 states and 1091 transitions. Second operand 3 states. [2019-12-07 12:42:50,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:50,201 INFO L93 Difference]: Finished difference Result 1513 states and 2336 transitions. [2019-12-07 12:42:50,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:50,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 12:42:50,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:50,206 INFO L225 Difference]: With dead ends: 1513 [2019-12-07 12:42:50,206 INFO L226 Difference]: Without dead ends: 811 [2019-12-07 12:42:50,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:50,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-12-07 12:42:50,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 790. [2019-12-07 12:42:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-12-07 12:42:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1211 transitions. [2019-12-07 12:42:50,233 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1211 transitions. Word has length 71 [2019-12-07 12:42:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:50,233 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1211 transitions. [2019-12-07 12:42:50,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1211 transitions. [2019-12-07 12:42:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 12:42:50,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:50,235 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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-12-07 12:42:50,235 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:50,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:50,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1769518732, now seen corresponding path program 1 times [2019-12-07 12:42:50,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:50,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779618937] [2019-12-07 12:42:50,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 12:42:50,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779618937] [2019-12-07 12:42:50,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:50,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:50,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743729915] [2019-12-07 12:42:50,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:50,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:50,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:50,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:50,258 INFO L87 Difference]: Start difference. First operand 790 states and 1211 transitions. Second operand 3 states. [2019-12-07 12:42:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:50,387 INFO L93 Difference]: Finished difference Result 1582 states and 2423 transitions. [2019-12-07 12:42:50,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:50,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 12:42:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:50,392 INFO L225 Difference]: With dead ends: 1582 [2019-12-07 12:42:50,392 INFO L226 Difference]: Without dead ends: 799 [2019-12-07 12:42:50,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-07 12:42:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 793. [2019-12-07 12:42:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-12-07 12:42:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1211 transitions. [2019-12-07 12:42:50,423 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1211 transitions. Word has length 71 [2019-12-07 12:42:50,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:50,424 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1211 transitions. [2019-12-07 12:42:50,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1211 transitions. [2019-12-07 12:42:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 12:42:50,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:50,425 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:50,426 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:50,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:50,426 INFO L82 PathProgramCache]: Analyzing trace with hash -953703820, now seen corresponding path program 1 times [2019-12-07 12:42:50,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:50,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920613869] [2019-12-07 12:42:50,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 12:42:50,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920613869] [2019-12-07 12:42:50,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:50,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:50,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243834446] [2019-12-07 12:42:50,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:50,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:50,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:50,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:50,455 INFO L87 Difference]: Start difference. First operand 793 states and 1211 transitions. Second operand 3 states. [2019-12-07 12:42:50,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:50,567 INFO L93 Difference]: Finished difference Result 1600 states and 2447 transitions. [2019-12-07 12:42:50,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:50,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-07 12:42:50,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:50,571 INFO L225 Difference]: With dead ends: 1600 [2019-12-07 12:42:50,571 INFO L226 Difference]: Without dead ends: 814 [2019-12-07 12:42:50,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-12-07 12:42:50,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 793. [2019-12-07 12:42:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-12-07 12:42:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1202 transitions. [2019-12-07 12:42:50,591 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1202 transitions. Word has length 72 [2019-12-07 12:42:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:50,591 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1202 transitions. [2019-12-07 12:42:50,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1202 transitions. [2019-12-07 12:42:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 12:42:50,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:50,592 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:50,592 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:50,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:50,592 INFO L82 PathProgramCache]: Analyzing trace with hash -816065300, now seen corresponding path program 1 times [2019-12-07 12:42:50,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:50,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949575054] [2019-12-07 12:42:50,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:50,598 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 12:42:50,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [948538025] [2019-12-07 12:42:50,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/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-12-07 12:42:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:50,643 INFO L264 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:42:50,645 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:42:50,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949575054] [2019-12-07 12:42:50,657 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:42:50,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948538025] [2019-12-07 12:42:50,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:50,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:50,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636599511] [2019-12-07 12:42:50,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:50,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:50,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:50,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:50,658 INFO L87 Difference]: Start difference. First operand 793 states and 1202 transitions. Second operand 3 states. [2019-12-07 12:42:50,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:50,703 INFO L93 Difference]: Finished difference Result 1583 states and 2396 transitions. [2019-12-07 12:42:50,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:50,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-12-07 12:42:50,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:50,709 INFO L225 Difference]: With dead ends: 1583 [2019-12-07 12:42:50,710 INFO L226 Difference]: Without dead ends: 1055 [2019-12-07 12:42:50,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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-12-07 12:42:50,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-12-07 12:42:50,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1051. [2019-12-07 12:42:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-12-07 12:42:50,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1597 transitions. [2019-12-07 12:42:50,741 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1597 transitions. Word has length 76 [2019-12-07 12:42:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:50,742 INFO L462 AbstractCegarLoop]: Abstraction has 1051 states and 1597 transitions. [2019-12-07 12:42:50,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1597 transitions. [2019-12-07 12:42:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 12:42:50,743 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:50,743 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:50,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:50,943 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:50,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:50,944 INFO L82 PathProgramCache]: Analyzing trace with hash -174298828, now seen corresponding path program 1 times [2019-12-07 12:42:50,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:50,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146928918] [2019-12-07 12:42:50,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:50,971 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 12:42:50,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146928918] [2019-12-07 12:42:50,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:50,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:50,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783568053] [2019-12-07 12:42:50,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:50,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:50,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:50,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:50,972 INFO L87 Difference]: Start difference. First operand 1051 states and 1597 transitions. Second operand 3 states. [2019-12-07 12:42:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:51,097 INFO L93 Difference]: Finished difference Result 2279 states and 3475 transitions. [2019-12-07 12:42:51,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:51,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-07 12:42:51,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:51,102 INFO L225 Difference]: With dead ends: 2279 [2019-12-07 12:42:51,102 INFO L226 Difference]: Without dead ends: 1235 [2019-12-07 12:42:51,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:51,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-12-07 12:42:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1223. [2019-12-07 12:42:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-07 12:42:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1873 transitions. [2019-12-07 12:42:51,128 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1873 transitions. Word has length 86 [2019-12-07 12:42:51,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:51,128 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1873 transitions. [2019-12-07 12:42:51,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1873 transitions. [2019-12-07 12:42:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 12:42:51,130 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:51,130 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:51,130 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:51,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1676680243, now seen corresponding path program 1 times [2019-12-07 12:42:51,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:51,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107662750] [2019-12-07 12:42:51,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 12:42:51,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107662750] [2019-12-07 12:42:51,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:51,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:51,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229699252] [2019-12-07 12:42:51,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:51,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:51,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:51,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:51,163 INFO L87 Difference]: Start difference. First operand 1223 states and 1873 transitions. Second operand 3 states. [2019-12-07 12:42:51,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:51,313 INFO L93 Difference]: Finished difference Result 2499 states and 3839 transitions. [2019-12-07 12:42:51,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:51,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-12-07 12:42:51,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:51,318 INFO L225 Difference]: With dead ends: 2499 [2019-12-07 12:42:51,318 INFO L226 Difference]: Without dead ends: 1275 [2019-12-07 12:42:51,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:51,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-12-07 12:42:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1263. [2019-12-07 12:42:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-12-07 12:42:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1949 transitions. [2019-12-07 12:42:51,346 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1949 transitions. Word has length 87 [2019-12-07 12:42:51,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:51,347 INFO L462 AbstractCegarLoop]: Abstraction has 1263 states and 1949 transitions. [2019-12-07 12:42:51,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:51,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1949 transitions. [2019-12-07 12:42:51,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 12:42:51,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:51,348 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:51,348 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:51,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:51,349 INFO L82 PathProgramCache]: Analyzing trace with hash 538835484, now seen corresponding path program 1 times [2019-12-07 12:42:51,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:51,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605790430] [2019-12-07 12:42:51,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 12:42:51,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605790430] [2019-12-07 12:42:51,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:51,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:51,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527419290] [2019-12-07 12:42:51,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:51,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:51,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:51,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:51,373 INFO L87 Difference]: Start difference. First operand 1263 states and 1949 transitions. Second operand 3 states. [2019-12-07 12:42:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:51,482 INFO L93 Difference]: Finished difference Result 2667 states and 4123 transitions. [2019-12-07 12:42:51,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:51,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 12:42:51,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:51,489 INFO L225 Difference]: With dead ends: 2667 [2019-12-07 12:42:51,489 INFO L226 Difference]: Without dead ends: 1411 [2019-12-07 12:42:51,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-12-07 12:42:51,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-12-07 12:42:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-12-07 12:42:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2085 transitions. [2019-12-07 12:42:51,533 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2085 transitions. Word has length 97 [2019-12-07 12:42:51,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:51,534 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2085 transitions. [2019-12-07 12:42:51,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2085 transitions. [2019-12-07 12:42:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 12:42:51,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:51,536 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-07 12:42:51,536 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:51,536 INFO L82 PathProgramCache]: Analyzing trace with hash 704331080, now seen corresponding path program 1 times [2019-12-07 12:42:51,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:51,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539152827] [2019-12-07 12:42:51,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:51,557 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 12:42:51,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539152827] [2019-12-07 12:42:51,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:51,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:51,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247991413] [2019-12-07 12:42:51,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:51,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:51,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:51,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:51,558 INFO L87 Difference]: Start difference. First operand 1363 states and 2085 transitions. Second operand 3 states. [2019-12-07 12:42:51,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:51,667 INFO L93 Difference]: Finished difference Result 2767 states and 4239 transitions. [2019-12-07 12:42:51,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:51,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 12:42:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:51,672 INFO L225 Difference]: With dead ends: 2767 [2019-12-07 12:42:51,672 INFO L226 Difference]: Without dead ends: 1411 [2019-12-07 12:42:51,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-12-07 12:42:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-12-07 12:42:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-12-07 12:42:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2065 transitions. [2019-12-07 12:42:51,700 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2065 transitions. Word has length 98 [2019-12-07 12:42:51,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:51,700 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2065 transitions. [2019-12-07 12:42:51,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2065 transitions. [2019-12-07 12:42:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 12:42:51,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:51,701 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-12-07 12:42:51,702 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:51,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:51,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1454055914, now seen corresponding path program 1 times [2019-12-07 12:42:51,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:51,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835235043] [2019-12-07 12:42:51,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:51,708 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 12:42:51,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [373005187] [2019-12-07 12:42:51,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/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-12-07 12:42:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:51,756 INFO L264 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:42:51,758 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 12:42:51,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835235043] [2019-12-07 12:42:51,771 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:42:51,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373005187] [2019-12-07 12:42:51,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:51,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:51,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188629126] [2019-12-07 12:42:51,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:51,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:51,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:51,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:51,773 INFO L87 Difference]: Start difference. First operand 1363 states and 2065 transitions. Second operand 3 states. [2019-12-07 12:42:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:51,913 INFO L93 Difference]: Finished difference Result 2755 states and 4163 transitions. [2019-12-07 12:42:51,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:51,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-12-07 12:42:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:51,919 INFO L225 Difference]: With dead ends: 2755 [2019-12-07 12:42:51,919 INFO L226 Difference]: Without dead ends: 1399 [2019-12-07 12:42:51,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 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-12-07 12:42:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-12-07 12:42:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1363. [2019-12-07 12:42:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-12-07 12:42:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1993 transitions. [2019-12-07 12:42:51,946 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1993 transitions. Word has length 116 [2019-12-07 12:42:51,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:51,946 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1993 transitions. [2019-12-07 12:42:51,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1993 transitions. [2019-12-07 12:42:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 12:42:51,947 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:51,947 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:52,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:52,148 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:52,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:52,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2083865546, now seen corresponding path program 1 times [2019-12-07 12:42:52,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:52,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119710307] [2019-12-07 12:42:52,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 12:42:52,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119710307] [2019-12-07 12:42:52,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:52,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:52,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578808763] [2019-12-07 12:42:52,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:52,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:52,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:52,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:52,178 INFO L87 Difference]: Start difference. First operand 1363 states and 1993 transitions. Second operand 3 states. [2019-12-07 12:42:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:52,278 INFO L93 Difference]: Finished difference Result 2827 states and 4135 transitions. [2019-12-07 12:42:52,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:52,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-12-07 12:42:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:52,284 INFO L225 Difference]: With dead ends: 2827 [2019-12-07 12:42:52,284 INFO L226 Difference]: Without dead ends: 1471 [2019-12-07 12:42:52,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-12-07 12:42:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-12-07 12:42:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-12-07 12:42:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2117 transitions. [2019-12-07 12:42:52,313 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2117 transitions. Word has length 117 [2019-12-07 12:42:52,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:52,313 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2117 transitions. [2019-12-07 12:42:52,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2117 transitions. [2019-12-07 12:42:52,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 12:42:52,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:52,315 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-12-07 12:42:52,315 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:52,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:52,315 INFO L82 PathProgramCache]: Analyzing trace with hash -63631274, now seen corresponding path program 1 times [2019-12-07 12:42:52,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:52,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585519873] [2019-12-07 12:42:52,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 12:42:52,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585519873] [2019-12-07 12:42:52,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:52,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:52,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389868845] [2019-12-07 12:42:52,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:52,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:52,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:52,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:52,341 INFO L87 Difference]: Start difference. First operand 1459 states and 2117 transitions. Second operand 3 states. [2019-12-07 12:42:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:52,450 INFO L93 Difference]: Finished difference Result 2923 states and 4239 transitions. [2019-12-07 12:42:52,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:52,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-12-07 12:42:52,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:52,456 INFO L225 Difference]: With dead ends: 2923 [2019-12-07 12:42:52,456 INFO L226 Difference]: Without dead ends: 1471 [2019-12-07 12:42:52,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:52,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-12-07 12:42:52,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-12-07 12:42:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-12-07 12:42:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2097 transitions. [2019-12-07 12:42:52,485 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2097 transitions. Word has length 118 [2019-12-07 12:42:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:52,485 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2097 transitions. [2019-12-07 12:42:52,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2097 transitions. [2019-12-07 12:42:52,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-07 12:42:52,487 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:52,487 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:52,487 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:52,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:52,487 INFO L82 PathProgramCache]: Analyzing trace with hash 365233416, now seen corresponding path program 1 times [2019-12-07 12:42:52,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:52,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125769250] [2019-12-07 12:42:52,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 12:42:52,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125769250] [2019-12-07 12:42:52,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:52,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:52,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893340076] [2019-12-07 12:42:52,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:52,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:52,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:52,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:52,515 INFO L87 Difference]: Start difference. First operand 1459 states and 2097 transitions. Second operand 3 states. [2019-12-07 12:42:52,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:52,643 INFO L93 Difference]: Finished difference Result 3091 states and 4445 transitions. [2019-12-07 12:42:52,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:52,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-12-07 12:42:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:52,649 INFO L225 Difference]: With dead ends: 3091 [2019-12-07 12:42:52,649 INFO L226 Difference]: Without dead ends: 1639 [2019-12-07 12:42:52,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:52,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-12-07 12:42:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1623. [2019-12-07 12:42:52,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-12-07 12:42:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2337 transitions. [2019-12-07 12:42:52,681 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2337 transitions. Word has length 126 [2019-12-07 12:42:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:52,681 INFO L462 AbstractCegarLoop]: Abstraction has 1623 states and 2337 transitions. [2019-12-07 12:42:52,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2337 transitions. [2019-12-07 12:42:52,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-07 12:42:52,683 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:52,683 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:52,683 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:52,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:52,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1493527041, now seen corresponding path program 1 times [2019-12-07 12:42:52,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:52,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588009621] [2019-12-07 12:42:52,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 12:42:52,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588009621] [2019-12-07 12:42:52,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:52,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:52,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405621199] [2019-12-07 12:42:52,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:52,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:52,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:52,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:52,713 INFO L87 Difference]: Start difference. First operand 1623 states and 2337 transitions. Second operand 3 states. [2019-12-07 12:42:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:52,826 INFO L93 Difference]: Finished difference Result 3255 states and 4681 transitions. [2019-12-07 12:42:52,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:52,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-12-07 12:42:52,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:52,831 INFO L225 Difference]: With dead ends: 3255 [2019-12-07 12:42:52,831 INFO L226 Difference]: Without dead ends: 1631 [2019-12-07 12:42:52,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:52,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-12-07 12:42:52,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1615. [2019-12-07 12:42:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-12-07 12:42:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2321 transitions. [2019-12-07 12:42:52,871 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2321 transitions. Word has length 127 [2019-12-07 12:42:52,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:52,872 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 2321 transitions. [2019-12-07 12:42:52,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:52,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2321 transitions. [2019-12-07 12:42:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-07 12:42:52,874 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:52,874 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:52,875 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:52,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash 704603328, now seen corresponding path program 1 times [2019-12-07 12:42:52,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:52,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363323078] [2019-12-07 12:42:52,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 12:42:52,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363323078] [2019-12-07 12:42:52,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:52,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:52,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267364104] [2019-12-07 12:42:52,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:52,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:52,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:52,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:52,914 INFO L87 Difference]: Start difference. First operand 1615 states and 2321 transitions. Second operand 3 states. [2019-12-07 12:42:53,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:53,022 INFO L93 Difference]: Finished difference Result 3323 states and 4778 transitions. [2019-12-07 12:42:53,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:53,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-12-07 12:42:53,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:53,029 INFO L225 Difference]: With dead ends: 3323 [2019-12-07 12:42:53,029 INFO L226 Difference]: Without dead ends: 1715 [2019-12-07 12:42:53,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:53,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-12-07 12:42:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-12-07 12:42:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-12-07 12:42:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2417 transitions. [2019-12-07 12:42:53,059 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2417 transitions. Word has length 138 [2019-12-07 12:42:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:53,059 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2417 transitions. [2019-12-07 12:42:53,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2417 transitions. [2019-12-07 12:42:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-07 12:42:53,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:53,061 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:53,061 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:53,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:53,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1658127444, now seen corresponding path program 1 times [2019-12-07 12:42:53,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:53,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056842217] [2019-12-07 12:42:53,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 12:42:53,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056842217] [2019-12-07 12:42:53,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:53,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:53,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141982890] [2019-12-07 12:42:53,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:53,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:53,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:53,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:53,088 INFO L87 Difference]: Start difference. First operand 1699 states and 2417 transitions. Second operand 3 states. [2019-12-07 12:42:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:53,191 INFO L93 Difference]: Finished difference Result 3407 states and 4846 transitions. [2019-12-07 12:42:53,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:53,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-12-07 12:42:53,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:53,197 INFO L225 Difference]: With dead ends: 3407 [2019-12-07 12:42:53,197 INFO L226 Difference]: Without dead ends: 1715 [2019-12-07 12:42:53,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-12-07 12:42:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-12-07 12:42:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-12-07 12:42:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2389 transitions. [2019-12-07 12:42:53,228 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2389 transitions. Word has length 139 [2019-12-07 12:42:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:53,228 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2389 transitions. [2019-12-07 12:42:53,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2389 transitions. [2019-12-07 12:42:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 12:42:53,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:53,229 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:53,230 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:53,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:53,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1163594683, now seen corresponding path program 1 times [2019-12-07 12:42:53,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:53,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313950364] [2019-12-07 12:42:53,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-12-07 12:42:53,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313950364] [2019-12-07 12:42:53,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:53,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:53,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503615176] [2019-12-07 12:42:53,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:53,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:53,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:53,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:53,255 INFO L87 Difference]: Start difference. First operand 1699 states and 2389 transitions. Second operand 3 states. [2019-12-07 12:42:53,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:53,291 INFO L93 Difference]: Finished difference Result 3373 states and 4735 transitions. [2019-12-07 12:42:53,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:53,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-12-07 12:42:53,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:53,297 INFO L225 Difference]: With dead ends: 3373 [2019-12-07 12:42:53,297 INFO L226 Difference]: Without dead ends: 1681 [2019-12-07 12:42:53,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:53,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2019-12-07 12:42:53,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1677. [2019-12-07 12:42:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2019-12-07 12:42:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2356 transitions. [2019-12-07 12:42:53,328 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2356 transitions. Word has length 154 [2019-12-07 12:42:53,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:53,328 INFO L462 AbstractCegarLoop]: Abstraction has 1677 states and 2356 transitions. [2019-12-07 12:42:53,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:53,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2356 transitions. [2019-12-07 12:42:53,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 12:42:53,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:53,329 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:53,330 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:53,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:53,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1358544773, now seen corresponding path program 1 times [2019-12-07 12:42:53,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:53,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954801163] [2019-12-07 12:42:53,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 12:42:53,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954801163] [2019-12-07 12:42:53,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647792919] [2019-12-07 12:42:53,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/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-12-07 12:42:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:53,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:42:53,416 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 12:42:53,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:42:53,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 12:42:53,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820663271] [2019-12-07 12:42:53,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:53,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:53,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:53,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:53,440 INFO L87 Difference]: Start difference. First operand 1677 states and 2356 transitions. Second operand 4 states. [2019-12-07 12:42:53,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:53,709 INFO L93 Difference]: Finished difference Result 5291 states and 7422 transitions. [2019-12-07 12:42:53,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:42:53,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-12-07 12:42:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:53,715 INFO L225 Difference]: With dead ends: 5291 [2019-12-07 12:42:53,715 INFO L226 Difference]: Without dead ends: 3521 [2019-12-07 12:42:53,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 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-12-07 12:42:53,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2019-12-07 12:42:53,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2065. [2019-12-07 12:42:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2019-12-07 12:42:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2916 transitions. [2019-12-07 12:42:53,756 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2916 transitions. Word has length 154 [2019-12-07 12:42:53,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:53,757 INFO L462 AbstractCegarLoop]: Abstraction has 2065 states and 2916 transitions. [2019-12-07 12:42:53,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2916 transitions. [2019-12-07 12:42:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 12:42:53,758 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:53,759 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:53,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:53,959 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:53,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:53,960 INFO L82 PathProgramCache]: Analyzing trace with hash 782353573, now seen corresponding path program 1 times [2019-12-07 12:42:53,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:53,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145262853] [2019-12-07 12:42:53,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:54,000 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 12:42:54,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145262853] [2019-12-07 12:42:54,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974688195] [2019-12-07 12:42:54,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/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-12-07 12:42:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:54,047 INFO L264 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:42:54,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 12:42:54,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:42:54,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 12:42:54,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104555164] [2019-12-07 12:42:54,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:54,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:54,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:54,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:54,065 INFO L87 Difference]: Start difference. First operand 2065 states and 2916 transitions. Second operand 4 states. [2019-12-07 12:42:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:54,284 INFO L93 Difference]: Finished difference Result 5632 states and 7889 transitions. [2019-12-07 12:42:54,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:42:54,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-12-07 12:42:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:54,290 INFO L225 Difference]: With dead ends: 5632 [2019-12-07 12:42:54,290 INFO L226 Difference]: Without dead ends: 3574 [2019-12-07 12:42:54,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 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-12-07 12:42:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-12-07 12:42:54,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 2575. [2019-12-07 12:42:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2575 states. [2019-12-07 12:42:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 3493 transitions. [2019-12-07 12:42:54,348 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 3493 transitions. Word has length 156 [2019-12-07 12:42:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:54,348 INFO L462 AbstractCegarLoop]: Abstraction has 2575 states and 3493 transitions. [2019-12-07 12:42:54,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 3493 transitions. [2019-12-07 12:42:54,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 12:42:54,350 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:54,350 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:54,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:54,551 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:54,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:54,551 INFO L82 PathProgramCache]: Analyzing trace with hash -571340489, now seen corresponding path program 1 times [2019-12-07 12:42:54,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:54,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643892494] [2019-12-07 12:42:54,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 12:42:54,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643892494] [2019-12-07 12:42:54,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421870778] [2019-12-07 12:42:54,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:54,640 INFO L264 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:42:54,641 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 12:42:54,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:42:54,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 12:42:54,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26138313] [2019-12-07 12:42:54,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:54,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:54,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:54,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:54,665 INFO L87 Difference]: Start difference. First operand 2575 states and 3493 transitions. Second operand 4 states. [2019-12-07 12:42:54,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:54,899 INFO L93 Difference]: Finished difference Result 5967 states and 8033 transitions. [2019-12-07 12:42:54,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:42:54,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-12-07 12:42:54,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:54,905 INFO L225 Difference]: With dead ends: 5967 [2019-12-07 12:42:54,905 INFO L226 Difference]: Without dead ends: 3371 [2019-12-07 12:42:54,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 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-12-07 12:42:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2019-12-07 12:42:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 2281. [2019-12-07 12:42:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-12-07 12:42:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3072 transitions. [2019-12-07 12:42:54,959 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3072 transitions. Word has length 163 [2019-12-07 12:42:54,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:54,959 INFO L462 AbstractCegarLoop]: Abstraction has 2281 states and 3072 transitions. [2019-12-07 12:42:54,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:54,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3072 transitions. [2019-12-07 12:42:54,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 12:42:54,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:54,961 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:55,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:55,162 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:55,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:55,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2030054557, now seen corresponding path program 1 times [2019-12-07 12:42:55,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:55,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867299308] [2019-12-07 12:42:55,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-12-07 12:42:55,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867299308] [2019-12-07 12:42:55,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:55,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:55,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531258794] [2019-12-07 12:42:55,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:55,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:55,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:55,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:55,211 INFO L87 Difference]: Start difference. First operand 2281 states and 3072 transitions. Second operand 3 states. [2019-12-07 12:42:55,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:55,287 INFO L93 Difference]: Finished difference Result 5499 states and 7335 transitions. [2019-12-07 12:42:55,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:55,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-12-07 12:42:55,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:55,293 INFO L225 Difference]: With dead ends: 5499 [2019-12-07 12:42:55,293 INFO L226 Difference]: Without dead ends: 3225 [2019-12-07 12:42:55,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2019-12-07 12:42:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3221. [2019-12-07 12:42:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3221 states. [2019-12-07 12:42:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 3221 states and 4261 transitions. [2019-12-07 12:42:55,366 INFO L78 Accepts]: Start accepts. Automaton has 3221 states and 4261 transitions. Word has length 165 [2019-12-07 12:42:55,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:55,366 INFO L462 AbstractCegarLoop]: Abstraction has 3221 states and 4261 transitions. [2019-12-07 12:42:55,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3221 states and 4261 transitions. [2019-12-07 12:42:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 12:42:55,368 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:55,369 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:55,369 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:55,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:55,369 INFO L82 PathProgramCache]: Analyzing trace with hash -36905074, now seen corresponding path program 1 times [2019-12-07 12:42:55,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:55,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518106644] [2019-12-07 12:42:55,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:55,375 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 12:42:55,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [623203441] [2019-12-07 12:42:55,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:55,422 INFO L264 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:42:55,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-12-07 12:42:55,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518106644] [2019-12-07 12:42:55,452 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:42:55,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623203441] [2019-12-07 12:42:55,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:55,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:55,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908353240] [2019-12-07 12:42:55,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:55,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:55,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:55,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:55,453 INFO L87 Difference]: Start difference. First operand 3221 states and 4261 transitions. Second operand 4 states. [2019-12-07 12:42:55,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:55,595 INFO L93 Difference]: Finished difference Result 4906 states and 6379 transitions. [2019-12-07 12:42:55,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:42:55,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-12-07 12:42:55,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:55,600 INFO L225 Difference]: With dead ends: 4906 [2019-12-07 12:42:55,600 INFO L226 Difference]: Without dead ends: 4096 [2019-12-07 12:42:55,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4096 states. [2019-12-07 12:42:55,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4096 to 3918. [2019-12-07 12:42:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3918 states. [2019-12-07 12:42:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5142 transitions. [2019-12-07 12:42:55,673 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 5142 transitions. Word has length 186 [2019-12-07 12:42:55,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:55,673 INFO L462 AbstractCegarLoop]: Abstraction has 3918 states and 5142 transitions. [2019-12-07 12:42:55,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 5142 transitions. [2019-12-07 12:42:55,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-12-07 12:42:55,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:55,676 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:55,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:55,877 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:55,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:55,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1106021424, now seen corresponding path program 1 times [2019-12-07 12:42:55,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:55,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932529982] [2019-12-07 12:42:55,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:55,890 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 12:42:55,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1933807492] [2019-12-07 12:42:55,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:55,963 INFO L264 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:42:55,965 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 12:42:56,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932529982] [2019-12-07 12:42:56,022 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:42:56,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933807492] [2019-12-07 12:42:56,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:56,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:42:56,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236793482] [2019-12-07 12:42:56,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:42:56,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:56,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:42:56,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:42:56,023 INFO L87 Difference]: Start difference. First operand 3918 states and 5142 transitions. Second operand 5 states. [2019-12-07 12:42:56,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:56,260 INFO L93 Difference]: Finished difference Result 5803 states and 7575 transitions. [2019-12-07 12:42:56,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:42:56,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2019-12-07 12:42:56,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:56,265 INFO L225 Difference]: With dead ends: 5803 [2019-12-07 12:42:56,265 INFO L226 Difference]: Without dead ends: 5802 [2019-12-07 12:42:56,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:42:56,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5802 states. [2019-12-07 12:42:56,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5802 to 5243. [2019-12-07 12:42:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5243 states. [2019-12-07 12:42:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 6898 transitions. [2019-12-07 12:42:56,366 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 6898 transitions. Word has length 188 [2019-12-07 12:42:56,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:56,367 INFO L462 AbstractCegarLoop]: Abstraction has 5243 states and 6898 transitions. [2019-12-07 12:42:56,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:42:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 6898 transitions. [2019-12-07 12:42:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-07 12:42:56,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:56,369 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:56,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:56,570 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:56,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:56,571 INFO L82 PathProgramCache]: Analyzing trace with hash 73074738, now seen corresponding path program 1 times [2019-12-07 12:42:56,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:56,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044545995] [2019-12-07 12:42:56,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:56,585 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 12:42:56,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [895259609] [2019-12-07 12:42:56,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:56,686 INFO L264 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:42:56,688 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:56,801 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-12-07 12:42:56,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044545995] [2019-12-07 12:42:56,801 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:42:56,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895259609] [2019-12-07 12:42:56,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:56,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:56,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077507844] [2019-12-07 12:42:56,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:56,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:56,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:56,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:56,802 INFO L87 Difference]: Start difference. First operand 5243 states and 6898 transitions. Second operand 4 states. [2019-12-07 12:42:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:57,025 INFO L93 Difference]: Finished difference Result 9754 states and 12848 transitions. [2019-12-07 12:42:57,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:42:57,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-12-07 12:42:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:57,029 INFO L225 Difference]: With dead ends: 9754 [2019-12-07 12:42:57,029 INFO L226 Difference]: Without dead ends: 5296 [2019-12-07 12:42:57,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5296 states. [2019-12-07 12:42:57,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5296 to 5242. [2019-12-07 12:42:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5242 states. [2019-12-07 12:42:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5242 states to 5242 states and 6881 transitions. [2019-12-07 12:42:57,171 INFO L78 Accepts]: Start accepts. Automaton has 5242 states and 6881 transitions. Word has length 189 [2019-12-07 12:42:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:57,171 INFO L462 AbstractCegarLoop]: Abstraction has 5242 states and 6881 transitions. [2019-12-07 12:42:57,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 5242 states and 6881 transitions. [2019-12-07 12:42:57,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-12-07 12:42:57,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:57,174 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:57,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:57,375 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:57,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:57,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1864895527, now seen corresponding path program 1 times [2019-12-07 12:42:57,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:57,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241675699] [2019-12-07 12:42:57,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:57,389 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 12:42:57,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [389129958] [2019-12-07 12:42:57,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:57,456 INFO L264 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:42:57,458 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-12-07 12:42:57,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241675699] [2019-12-07 12:42:57,478 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:42:57,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389129958] [2019-12-07 12:42:57,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:57,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:57,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320589640] [2019-12-07 12:42:57,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:57,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:57,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:57,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:57,479 INFO L87 Difference]: Start difference. First operand 5242 states and 6881 transitions. Second operand 3 states. [2019-12-07 12:42:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:57,625 INFO L93 Difference]: Finished difference Result 10421 states and 13665 transitions. [2019-12-07 12:42:57,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:57,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-12-07 12:42:57,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:57,628 INFO L225 Difference]: With dead ends: 10421 [2019-12-07 12:42:57,628 INFO L226 Difference]: Without dead ends: 3596 [2019-12-07 12:42:57,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 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-12-07 12:42:57,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3596 states. [2019-12-07 12:42:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3596 to 3587. [2019-12-07 12:42:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3587 states. [2019-12-07 12:42:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 4675 transitions. [2019-12-07 12:42:57,692 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 4675 transitions. Word has length 196 [2019-12-07 12:42:57,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:57,692 INFO L462 AbstractCegarLoop]: Abstraction has 3587 states and 4675 transitions. [2019-12-07 12:42:57,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 4675 transitions. [2019-12-07 12:42:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-12-07 12:42:57,693 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:57,693 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:57,894 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:57,894 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:57,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:57,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1327391442, now seen corresponding path program 1 times [2019-12-07 12:42:57,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:57,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817891547] [2019-12-07 12:42:57,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-07 12:42:57,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817891547] [2019-12-07 12:42:57,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:57,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:57,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390120886] [2019-12-07 12:42:57,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:57,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:57,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:57,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:57,937 INFO L87 Difference]: Start difference. First operand 3587 states and 4675 transitions. Second operand 3 states. [2019-12-07 12:42:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:58,058 INFO L93 Difference]: Finished difference Result 6826 states and 8875 transitions. [2019-12-07 12:42:58,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:58,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-12-07 12:42:58,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:58,061 INFO L225 Difference]: With dead ends: 6826 [2019-12-07 12:42:58,061 INFO L226 Difference]: Without dead ends: 3114 [2019-12-07 12:42:58,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:58,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2019-12-07 12:42:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3072. [2019-12-07 12:42:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3072 states. [2019-12-07 12:42:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 3966 transitions. [2019-12-07 12:42:58,116 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 3966 transitions. Word has length 197 [2019-12-07 12:42:58,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:58,116 INFO L462 AbstractCegarLoop]: Abstraction has 3072 states and 3966 transitions. [2019-12-07 12:42:58,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:58,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 3966 transitions. [2019-12-07 12:42:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-12-07 12:42:58,118 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:58,118 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 12:42:58,118 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:58,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1162887835, now seen corresponding path program 1 times [2019-12-07 12:42:58,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:58,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455531751] [2019-12-07 12:42:58,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-12-07 12:42:58,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455531751] [2019-12-07 12:42:58,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:58,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:58,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870705934] [2019-12-07 12:42:58,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:58,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:58,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:58,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:58,200 INFO L87 Difference]: Start difference. First operand 3072 states and 3966 transitions. Second operand 3 states. [2019-12-07 12:42:58,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:58,318 INFO L93 Difference]: Finished difference Result 6482 states and 8334 transitions. [2019-12-07 12:42:58,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:58,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-12-07 12:42:58,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:58,320 INFO L225 Difference]: With dead ends: 6482 [2019-12-07 12:42:58,320 INFO L226 Difference]: Without dead ends: 3432 [2019-12-07 12:42:58,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2019-12-07 12:42:58,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3412. [2019-12-07 12:42:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3412 states. [2019-12-07 12:42:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 4356 transitions. [2019-12-07 12:42:58,377 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 4356 transitions. Word has length 335 [2019-12-07 12:42:58,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:58,377 INFO L462 AbstractCegarLoop]: Abstraction has 3412 states and 4356 transitions. [2019-12-07 12:42:58,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:58,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 4356 transitions. [2019-12-07 12:42:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-12-07 12:42:58,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:58,379 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 12:42:58,379 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:58,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:58,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1926092110, now seen corresponding path program 1 times [2019-12-07 12:42:58,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:58,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684122996] [2019-12-07 12:42:58,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 823 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-12-07 12:42:58,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684122996] [2019-12-07 12:42:58,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:58,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:58,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885049786] [2019-12-07 12:42:58,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:58,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:58,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:58,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:58,467 INFO L87 Difference]: Start difference. First operand 3412 states and 4356 transitions. Second operand 3 states. [2019-12-07 12:42:58,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:58,598 INFO L93 Difference]: Finished difference Result 7182 states and 9154 transitions. [2019-12-07 12:42:58,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:58,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-12-07 12:42:58,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:58,601 INFO L225 Difference]: With dead ends: 7182 [2019-12-07 12:42:58,601 INFO L226 Difference]: Without dead ends: 3792 [2019-12-07 12:42:58,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:58,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2019-12-07 12:42:58,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 3772. [2019-12-07 12:42:58,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3772 states. [2019-12-07 12:42:58,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 4766 transitions. [2019-12-07 12:42:58,666 INFO L78 Accepts]: Start accepts. Automaton has 3772 states and 4766 transitions. Word has length 366 [2019-12-07 12:42:58,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:58,666 INFO L462 AbstractCegarLoop]: Abstraction has 3772 states and 4766 transitions. [2019-12-07 12:42:58,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3772 states and 4766 transitions. [2019-12-07 12:42:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-12-07 12:42:58,669 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:58,669 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 12:42:58,669 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:42:58,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:58,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1476749664, now seen corresponding path program 1 times [2019-12-07 12:42:58,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:58,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286484538] [2019-12-07 12:42:58,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-12-07 12:42:58,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286484538] [2019-12-07 12:42:58,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112928509] [2019-12-07 12:42:58,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:58,866 INFO L264 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:42:58,869 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-12-07 12:42:58,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:42:58,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 12:42:58,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277658879] [2019-12-07 12:42:58,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:58,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:58,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:58,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:58,940 INFO L87 Difference]: Start difference. First operand 3772 states and 4766 transitions. Second operand 4 states. [2019-12-07 12:42:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:59,046 INFO L93 Difference]: Finished difference Result 4931 states and 6242 transitions. [2019-12-07 12:42:59,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:42:59,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 399 [2019-12-07 12:42:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:59,046 INFO L225 Difference]: With dead ends: 4931 [2019-12-07 12:42:59,046 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:42:59,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 401 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-12-07 12:42:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:42:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:42:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:42:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:42:59,049 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 399 [2019-12-07 12:42:59,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:59,049 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:42:59,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:42:59,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:42:59,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:59,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:43:00,156 WARN L192 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 407 DAG size of output: 228 [2019-12-07 12:43:00,572 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 408 DAG size of output: 229 [2019-12-07 12:43:00,883 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-12-07 12:43:01,064 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-12-07 12:43:01,269 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 57 [2019-12-07 12:43:01,378 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-12-07 12:43:01,486 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-12-07 12:43:01,595 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-12-07 12:43:01,879 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 44 [2019-12-07 12:43:02,172 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 17 [2019-12-07 12:43:02,275 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-12-07 12:43:02,395 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 17 [2019-12-07 12:43:02,531 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-12-07 12:43:02,872 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 49 [2019-12-07 12:43:03,079 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 17 [2019-12-07 12:43:04,558 WARN L192 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 195 DAG size of output: 98 [2019-12-07 12:43:04,767 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 55 [2019-12-07 12:43:06,067 WARN L192 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 196 DAG size of output: 98 [2019-12-07 12:43:06,315 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2019-12-07 12:43:06,740 WARN L192 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 39 [2019-12-07 12:43:06,742 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-12-07 12:43:06,743 INFO L246 CegarLoopResult]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-12-07 12:43:06,743 INFO L246 CegarLoopResult]: For program point L201(lines 201 591) no Hoare annotation was computed. [2019-12-07 12:43:06,743 INFO L246 CegarLoopResult]: For program point L168(lines 168 602) no Hoare annotation was computed. [2019-12-07 12:43:06,743 INFO L246 CegarLoopResult]: For program point L135(lines 135 613) no Hoare annotation was computed. [2019-12-07 12:43:06,743 INFO L246 CegarLoopResult]: For program point L102(lines 102 624) no Hoare annotation was computed. [2019-12-07 12:43:06,743 INFO L246 CegarLoopResult]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-12-07 12:43:06,743 INFO L242 CegarLoopResult]: At program point L202(lines 198 592) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-12-07 12:43:06,743 INFO L242 CegarLoopResult]: At program point L103(lines 102 624) the Hoare annotation is: false [2019-12-07 12:43:06,743 INFO L246 CegarLoopResult]: For program point L500(lines 500 504) no Hoare annotation was computed. [2019-12-07 12:43:06,744 INFO L246 CegarLoopResult]: For program point L500-2(lines 209 586) no Hoare annotation was computed. [2019-12-07 12:43:06,744 INFO L246 CegarLoopResult]: For program point L501(line 501) no Hoare annotation was computed. [2019-12-07 12:43:06,744 INFO L246 CegarLoopResult]: For program point L501-1(line 501) no Hoare annotation was computed. [2019-12-07 12:43:06,744 INFO L246 CegarLoopResult]: For program point L501-2(line 501) no Hoare annotation was computed. [2019-12-07 12:43:06,744 INFO L246 CegarLoopResult]: For program point L501-3(line 501) no Hoare annotation was computed. [2019-12-07 12:43:06,744 INFO L246 CegarLoopResult]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-12-07 12:43:06,744 INFO L246 CegarLoopResult]: For program point L204(lines 204 590) no Hoare annotation was computed. [2019-12-07 12:43:06,744 INFO L246 CegarLoopResult]: For program point L171(lines 171 601) no Hoare annotation was computed. [2019-12-07 12:43:06,744 INFO L246 CegarLoopResult]: For program point L138(lines 138 612) no Hoare annotation was computed. [2019-12-07 12:43:06,744 INFO L246 CegarLoopResult]: For program point L105(lines 105 623) no Hoare annotation was computed. [2019-12-07 12:43:06,744 INFO L242 CegarLoopResult]: At program point L205(lines 204 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-12-07 12:43:06,744 INFO L242 CegarLoopResult]: At program point L172(lines 168 602) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-12-07 12:43:06,745 INFO L242 CegarLoopResult]: At program point L139(lines 135 613) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 12:43:06,745 INFO L246 CegarLoopResult]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-12-07 12:43:06,745 INFO L246 CegarLoopResult]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-12-07 12:43:06,745 INFO L246 CegarLoopResult]: For program point L570(lines 570 580) no Hoare annotation was computed. [2019-12-07 12:43:06,745 INFO L246 CegarLoopResult]: For program point L570-1(lines 570 580) no Hoare annotation was computed. [2019-12-07 12:43:06,745 INFO L246 CegarLoopResult]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-12-07 12:43:06,745 INFO L246 CegarLoopResult]: For program point L306-2(lines 209 586) no Hoare annotation was computed. [2019-12-07 12:43:06,745 INFO L246 CegarLoopResult]: For program point L174(lines 174 600) no Hoare annotation was computed. [2019-12-07 12:43:06,745 INFO L246 CegarLoopResult]: For program point L141(lines 141 611) no Hoare annotation was computed. [2019-12-07 12:43:06,745 INFO L246 CegarLoopResult]: For program point L108(lines 108 622) no Hoare annotation was computed. [2019-12-07 12:43:06,746 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-12-07 12:43:06,746 INFO L246 CegarLoopResult]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-12-07 12:43:06,746 INFO L242 CegarLoopResult]: At program point L208(lines 207 589) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-12-07 12:43:06,746 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-12-07 12:43:06,746 INFO L246 CegarLoopResult]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-12-07 12:43:06,746 INFO L249 CegarLoopResult]: At program point L671(lines 64 673) the Hoare annotation is: true [2019-12-07 12:43:06,746 INFO L246 CegarLoopResult]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-12-07 12:43:06,746 INFO L246 CegarLoopResult]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-12-07 12:43:06,746 INFO L242 CegarLoopResult]: At program point L407(lines 398 418) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 12:43:06,746 INFO L246 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-12-07 12:43:06,747 INFO L246 CegarLoopResult]: For program point L341-2(lines 209 586) no Hoare annotation was computed. [2019-12-07 12:43:06,747 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-12-07 12:43:06,747 INFO L249 CegarLoopResult]: At program point L672(lines 9 674) the Hoare annotation is: true [2019-12-07 12:43:06,747 INFO L246 CegarLoopResult]: For program point L573(lines 573 577) no Hoare annotation was computed. [2019-12-07 12:43:06,747 INFO L246 CegarLoopResult]: For program point L177(lines 177 599) no Hoare annotation was computed. [2019-12-07 12:43:06,747 INFO L246 CegarLoopResult]: For program point L144(lines 144 610) no Hoare annotation was computed. [2019-12-07 12:43:06,747 INFO L246 CegarLoopResult]: For program point L111(lines 111 621) no Hoare annotation was computed. [2019-12-07 12:43:06,747 INFO L246 CegarLoopResult]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-12-07 12:43:06,748 INFO L242 CegarLoopResult]: At program point L178(lines 174 600) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 12:43:06,748 INFO L242 CegarLoopResult]: At program point L145(lines 141 611) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 12:43:06,748 INFO L246 CegarLoopResult]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-12-07 12:43:06,748 INFO L242 CegarLoopResult]: At program point L212(lines 105 623) the Hoare annotation is: false [2019-12-07 12:43:06,748 INFO L246 CegarLoopResult]: For program point L510(lines 510 514) no Hoare annotation was computed. [2019-12-07 12:43:06,748 INFO L246 CegarLoopResult]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2019-12-07 12:43:06,748 INFO L246 CegarLoopResult]: For program point L180(lines 180 598) no Hoare annotation was computed. [2019-12-07 12:43:06,749 INFO L246 CegarLoopResult]: For program point L147(lines 147 609) no Hoare annotation was computed. [2019-12-07 12:43:06,749 INFO L246 CegarLoopResult]: For program point L114(lines 114 620) no Hoare annotation was computed. [2019-12-07 12:43:06,749 INFO L246 CegarLoopResult]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-12-07 12:43:06,749 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-12-07 12:43:06,749 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-12-07 12:43:06,749 INFO L246 CegarLoopResult]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-12-07 12:43:06,749 INFO L246 CegarLoopResult]: For program point L83-1(lines 64 673) no Hoare annotation was computed. [2019-12-07 12:43:06,749 INFO L246 CegarLoopResult]: For program point L183(lines 183 597) no Hoare annotation was computed. [2019-12-07 12:43:06,749 INFO L246 CegarLoopResult]: For program point L150(lines 150 608) no Hoare annotation was computed. [2019-12-07 12:43:06,750 INFO L246 CegarLoopResult]: For program point L117(lines 117 619) no Hoare annotation was computed. [2019-12-07 12:43:06,750 INFO L246 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-12-07 12:43:06,750 INFO L246 CegarLoopResult]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-12-07 12:43:06,750 INFO L246 CegarLoopResult]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-12-07 12:43:06,750 INFO L246 CegarLoopResult]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-12-07 12:43:06,750 INFO L246 CegarLoopResult]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-12-07 12:43:06,750 INFO L242 CegarLoopResult]: At program point L184(lines 180 598) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 12:43:06,751 INFO L242 CegarLoopResult]: At program point L151(lines 147 609) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 12:43:06,751 INFO L246 CegarLoopResult]: For program point L217-2(lines 209 586) no Hoare annotation was computed. [2019-12-07 12:43:06,751 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:43:06,751 INFO L246 CegarLoopResult]: For program point L549(lines 549 553) no Hoare annotation was computed. [2019-12-07 12:43:06,751 INFO L246 CegarLoopResult]: For program point L186(lines 186 596) no Hoare annotation was computed. [2019-12-07 12:43:06,751 INFO L246 CegarLoopResult]: For program point L153(lines 153 607) no Hoare annotation was computed. [2019-12-07 12:43:06,751 INFO L246 CegarLoopResult]: For program point L120(lines 120 618) no Hoare annotation was computed. [2019-12-07 12:43:06,751 INFO L242 CegarLoopResult]: At program point L550(lines 64 673) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-12-07 12:43:06,751 INFO L246 CegarLoopResult]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-12-07 12:43:06,752 INFO L246 CegarLoopResult]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-12-07 12:43:06,752 INFO L242 CegarLoopResult]: At program point L121(lines 117 619) the Hoare annotation is: false [2019-12-07 12:43:06,752 INFO L246 CegarLoopResult]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-12-07 12:43:06,752 INFO L246 CegarLoopResult]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-12-07 12:43:06,752 INFO L249 CegarLoopResult]: At program point L684(lines 675 686) the Hoare annotation is: true [2019-12-07 12:43:06,752 INFO L246 CegarLoopResult]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-12-07 12:43:06,752 INFO L246 CegarLoopResult]: For program point L189(lines 189 595) no Hoare annotation was computed. [2019-12-07 12:43:06,752 INFO L246 CegarLoopResult]: For program point L156(lines 156 606) no Hoare annotation was computed. [2019-12-07 12:43:06,753 INFO L246 CegarLoopResult]: For program point L123(lines 123 617) no Hoare annotation was computed. [2019-12-07 12:43:06,753 INFO L246 CegarLoopResult]: For program point L520(lines 520 525) no Hoare annotation was computed. [2019-12-07 12:43:06,753 INFO L246 CegarLoopResult]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-12-07 12:43:06,753 INFO L246 CegarLoopResult]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-12-07 12:43:06,753 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:43:06,753 INFO L246 CegarLoopResult]: For program point L289-2(lines 209 586) no Hoare annotation was computed. [2019-12-07 12:43:06,753 INFO L242 CegarLoopResult]: At program point L190(lines 186 596) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse6 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-12-07 12:43:06,754 INFO L242 CegarLoopResult]: At program point L157(lines 153 607) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 12:43:06,754 INFO L242 CegarLoopResult]: At program point L124(lines 123 617) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11 .cse12 .cse13 .cse14 .cse15) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-12-07 12:43:06,754 INFO L242 CegarLoopResult]: At program point L587(lines 99 655) the Hoare annotation is: (let ((.cse9 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse7 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1 .cse2 .cse3) (and .cse4 .cse5 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse10) (and .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse10) (and .cse4 .cse5 .cse1 .cse2 .cse7 .cse3) (and .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3) (and .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse0 .cse24 .cse25 .cse26 .cse1 .cse27 .cse3 .cse28) (and .cse4 .cse13 .cse17 .cse19 .cse21 .cse23 .cse0 .cse24 .cse26 .cse1 .cse6 .cse3 .cse28) (and .cse22 .cse8 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse25 .cse14 .cse18) (and .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse0 .cse25 .cse26 .cse1 .cse27 .cse3 .cse28 .cse10))) [2019-12-07 12:43:06,754 INFO L246 CegarLoopResult]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-12-07 12:43:06,755 INFO L246 CegarLoopResult]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-12-07 12:43:06,755 INFO L246 CegarLoopResult]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-12-07 12:43:06,755 INFO L246 CegarLoopResult]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-12-07 12:43:06,755 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-12-07 12:43:06,755 INFO L246 CegarLoopResult]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-12-07 12:43:06,755 INFO L246 CegarLoopResult]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-12-07 12:43:06,755 INFO L246 CegarLoopResult]: For program point L192(lines 192 594) no Hoare annotation was computed. [2019-12-07 12:43:06,755 INFO L246 CegarLoopResult]: For program point L159(lines 159 605) no Hoare annotation was computed. [2019-12-07 12:43:06,756 INFO L246 CegarLoopResult]: For program point L126(lines 126 616) no Hoare annotation was computed. [2019-12-07 12:43:06,756 INFO L246 CegarLoopResult]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-12-07 12:43:06,756 INFO L246 CegarLoopResult]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-12-07 12:43:06,756 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-12-07 12:43:06,756 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 12:43:06,756 INFO L249 CegarLoopResult]: At program point L656(lines 98 657) the Hoare annotation is: true [2019-12-07 12:43:06,756 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-12-07 12:43:06,756 INFO L246 CegarLoopResult]: For program point L195(lines 195 593) no Hoare annotation was computed. [2019-12-07 12:43:06,756 INFO L246 CegarLoopResult]: For program point L162(lines 162 604) no Hoare annotation was computed. [2019-12-07 12:43:06,757 INFO L246 CegarLoopResult]: For program point L129(lines 129 615) no Hoare annotation was computed. [2019-12-07 12:43:06,757 INFO L246 CegarLoopResult]: For program point L625(lines 625 653) no Hoare annotation was computed. [2019-12-07 12:43:06,757 INFO L246 CegarLoopResult]: For program point L262(line 262) no Hoare annotation was computed. [2019-12-07 12:43:06,757 INFO L246 CegarLoopResult]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-12-07 12:43:06,757 INFO L246 CegarLoopResult]: For program point L262-1(line 262) no Hoare annotation was computed. [2019-12-07 12:43:06,757 INFO L242 CegarLoopResult]: At program point L196(lines 192 594) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse4 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse7 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse4 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse5 .cse6 .cse7))) [2019-12-07 12:43:06,757 INFO L242 CegarLoopResult]: At program point L163(lines 159 605) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 12:43:06,757 INFO L246 CegarLoopResult]: For program point L229-2(lines 209 586) no Hoare annotation was computed. [2019-12-07 12:43:06,757 INFO L246 CegarLoopResult]: For program point L626(lines 626 650) no Hoare annotation was computed. [2019-12-07 12:43:06,757 INFO L246 CegarLoopResult]: For program point L560(lines 560 564) no Hoare annotation was computed. [2019-12-07 12:43:06,757 INFO L246 CegarLoopResult]: For program point L527(lines 527 531) no Hoare annotation was computed. [2019-12-07 12:43:06,758 INFO L246 CegarLoopResult]: For program point L560-2(lines 560 564) no Hoare annotation was computed. [2019-12-07 12:43:06,758 INFO L246 CegarLoopResult]: For program point L527-2(lines 209 586) no Hoare annotation was computed. [2019-12-07 12:43:06,758 INFO L246 CegarLoopResult]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-12-07 12:43:06,758 INFO L246 CegarLoopResult]: For program point L660(lines 660 664) no Hoare annotation was computed. [2019-12-07 12:43:06,758 INFO L246 CegarLoopResult]: For program point L627(lines 627 636) no Hoare annotation was computed. [2019-12-07 12:43:06,758 INFO L246 CegarLoopResult]: For program point L660-2(lines 660 664) no Hoare annotation was computed. [2019-12-07 12:43:06,758 INFO L246 CegarLoopResult]: For program point L627-2(lines 626 648) no Hoare annotation was computed. [2019-12-07 12:43:06,758 INFO L246 CegarLoopResult]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-12-07 12:43:06,758 INFO L246 CegarLoopResult]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-12-07 12:43:06,758 INFO L242 CegarLoopResult]: At program point L363(lines 346 381) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 12:43:06,758 INFO L246 CegarLoopResult]: For program point L264(line 264) no Hoare annotation was computed. [2019-12-07 12:43:06,758 INFO L246 CegarLoopResult]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-12-07 12:43:06,758 INFO L246 CegarLoopResult]: For program point L264-1(line 264) no Hoare annotation was computed. [2019-12-07 12:43:06,759 INFO L246 CegarLoopResult]: For program point L198(lines 198 592) no Hoare annotation was computed. [2019-12-07 12:43:06,759 INFO L246 CegarLoopResult]: For program point L165(lines 165 603) no Hoare annotation was computed. [2019-12-07 12:43:06,759 INFO L246 CegarLoopResult]: For program point L132(lines 132 614) no Hoare annotation was computed. [2019-12-07 12:43:06,759 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 655) the Hoare annotation is: (let ((.cse9 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse7 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1 .cse2 .cse3) (and .cse4 .cse5 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse10) (and .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse10) (and .cse4 .cse5 .cse1 .cse2 .cse7 .cse3) (and .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3) (and .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse0 .cse24 .cse25 .cse26 .cse1 .cse27 .cse3 .cse28) (and .cse4 .cse13 .cse17 .cse19 .cse21 .cse23 .cse0 .cse24 .cse26 .cse1 .cse6 .cse3 .cse28) (and .cse22 .cse8 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse25 .cse14 .cse18) (and .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse0 .cse25 .cse26 .cse1 .cse27 .cse3 .cse28 .cse10))) [2019-12-07 12:43:06,759 INFO L242 CegarLoopResult]: At program point L397(lines 388 419) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 12:43:06,759 INFO L242 CegarLoopResult]: At program point L166(lines 165 603) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)))) (or (and .cse0 .cse1 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse2 .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3))) [2019-12-07 12:43:06,760 INFO L242 CegarLoopResult]: At program point L133(lines 126 616) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 12:43:06,760 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 12:43:06,760 INFO L246 CegarLoopResult]: For program point L629(lines 629 633) no Hoare annotation was computed. [2019-12-07 12:43:06,760 INFO L246 CegarLoopResult]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-12-07 12:43:06,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:43:06 BoogieIcfgContainer [2019-12-07 12:43:06,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:43:06,794 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:43:06,794 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:43:06,794 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:43:06,795 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:42:47" (3/4) ... [2019-12-07 12:43:06,797 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:43:06,815 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 12:43:06,816 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 12:43:06,899 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e8f63674-ac2f-4d80-9305-79cd35162f30/bin/uautomizer/witness.graphml [2019-12-07 12:43:06,900 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:43:06,900 INFO L168 Benchmark]: Toolchain (without parser) took 19764.28 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 712.0 MB). Free memory was 946.2 MB in the beginning and 953.8 MB in the end (delta: -7.6 MB). Peak memory consumption was 704.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:43:06,901 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:43:06,901 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -145.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:43:06,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:43:06,901 INFO L168 Benchmark]: Boogie Preprocessor took 26.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:43:06,901 INFO L168 Benchmark]: RCFGBuilder took 415.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:43:06,902 INFO L168 Benchmark]: TraceAbstraction took 18915.94 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 609.2 MB). Free memory was 1.0 GB in the beginning and 977.6 MB in the end (delta: 53.8 MB). Peak memory consumption was 730.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:43:06,902 INFO L168 Benchmark]: Witness Printer took 105.68 ms. Allocated memory is still 1.7 GB. Free memory was 977.6 MB in the beginning and 953.8 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:43:06,903 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -145.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 415.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18915.94 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 609.2 MB). Free memory was 1.0 GB in the beginning and 977.6 MB in the end (delta: 53.8 MB). Peak memory consumption was 730.5 MB. Max. memory is 11.5 GB. * Witness Printer took 105.68 ms. Allocated memory is still 1.7 GB. Free memory was 977.6 MB in the beginning and 953.8 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && !(s__state == 8192)) && 8640 == s__s3__tmp__next_state___0) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit)) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8192)) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195))) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || (((((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && 8672 <= s__state) && !(s__state == 16384)) && !(s__state == 24576)) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8576)) && 8576 <= s__state) && s__state <= 8640) || (((blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 675]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8576)) && 8576 <= s__state) && s__state <= 8640) || (((blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8448) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((((blastFlag <= 3 && !(s__state == 8192)) && 8640 == s__s3__tmp__next_state___0) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8192)) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195))) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195))) || (((((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480))) || ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480))) || (((((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 16384)) && !(s__state == 24576)) && !(s__state == 12292))) || (((((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8448) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((((blastFlag <= 3 && !(s__state == 8192)) && 8640 == s__s3__tmp__next_state___0) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8192)) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195))) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195))) || (((((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480))) || ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480))) || (((((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 16384)) && !(s__state == 24576)) && !(s__state == 12292))) || (((((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) || (((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit))) || ((((((((!(s__state == 8673) && blastFlag <= 3) && !(s__state == 16384)) && 8576 <= s__state) && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 8 error locations. Result: SAFE, OverallTime: 11.3s, OverallIterations: 39, TraceHistogramMax: 14, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.4s, HoareTripleCheckerStatistics: 6988 SDtfs, 5871 SDslu, 3536 SDs, 0 SdLazy, 4214 SolverSat, 1138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1986 GetRequests, 1935 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5243occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 39 MinimizatonAttempts, 4793 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 275 NumberOfFragments, 1926 HoareAnnotationTreeSize, 29 FomulaSimplifications, 230792 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 29 FomulaSimplificationsInter, 46542 FormulaSimplificationTreeSizeReductionInter, 6.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 5670 NumberOfCodeBlocks, 5670 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 5627 ConstructedInterpolants, 0 QuantifiedInterpolants, 1668610 SizeOfPredicates, 13 NumberOfNonLiveVariables, 3550 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 43 InterpolantComputations, 35 PerfectInterpolantSequences, 10843/10891 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...