./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/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 96aededabe895f84f71d6d614ed1af512bf7353b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:44,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:44,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:44,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:44,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:44,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:44,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:44,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:44,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:44,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:44,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:44,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:44,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:44,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:44,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:44,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:44,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:44,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:44,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:44,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:44,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:44,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:44,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:44,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:44,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:44,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:44,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:44,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:44,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:44,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:44,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:44,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:44,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:44,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:44,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:44,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:44,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:44,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:44,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:44,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:44,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:44,916 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-10-22 09:02:44,927 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:44,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:44,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:44,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:44,928 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:44,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:44,929 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:44,929 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:44,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:44,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:44,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:44,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:02:44,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:02:44,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:02:44,930 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-10-22 09:02:44,930 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:44,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:44,931 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:44,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:02:44,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:44,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:44,931 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:02:44,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:02:44,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:02:44,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:44,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:02:44,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:02:44,932 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:44,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:02:44,933 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:02:44,933 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/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/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 -> 96aededabe895f84f71d6d614ed1af512bf7353b [2019-10-22 09:02:44,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:44,966 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:44,968 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:44,970 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:44,970 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:44,971 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-10-22 09:02:45,013 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/bin/uautomizer/data/3384e8631/20c3498445264279b7d0741c79ae8e16/FLAG5f7f04681 [2019-10-22 09:02:45,432 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:45,433 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-10-22 09:02:45,442 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/bin/uautomizer/data/3384e8631/20c3498445264279b7d0741c79ae8e16/FLAG5f7f04681 [2019-10-22 09:02:45,800 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/bin/uautomizer/data/3384e8631/20c3498445264279b7d0741c79ae8e16 [2019-10-22 09:02:45,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:45,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:45,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:45,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:45,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:45,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:45" (1/1) ... [2019-10-22 09:02:45,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355481d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:45, skipping insertion in model container [2019-10-22 09:02:45,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:45" (1/1) ... [2019-10-22 09:02:45,815 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:45,859 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:46,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:46,152 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:46,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:46,218 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:46,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:46 WrapperNode [2019-10-22 09:02:46,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:46,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:46,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:46,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:46,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:46" (1/1) ... [2019-10-22 09:02:46,233 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:46" (1/1) ... [2019-10-22 09:02:46,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:46,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:46,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:46,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:46,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:46" (1/1) ... [2019-10-22 09:02:46,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:46" (1/1) ... [2019-10-22 09:02:46,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:46" (1/1) ... [2019-10-22 09:02:46,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:46" (1/1) ... [2019-10-22 09:02:46,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:46" (1/1) ... [2019-10-22 09:02:46,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:46" (1/1) ... [2019-10-22 09:02:46,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:46" (1/1) ... [2019-10-22 09:02:46,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:46,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:46,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:46,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:46,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/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-10-22 09:02:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:46,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:46,452 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:02:46,938 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 09:02:46,938 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 09:02:46,939 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:46,940 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:02:46,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:46 BoogieIcfgContainer [2019-10-22 09:02:46,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:46,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:02:46,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:02:46,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:02:46,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:02:45" (1/3) ... [2019-10-22 09:02:46,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d91c5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:46, skipping insertion in model container [2019-10-22 09:02:46,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:46" (2/3) ... [2019-10-22 09:02:46,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d91c5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:46, skipping insertion in model container [2019-10-22 09:02:46,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:46" (3/3) ... [2019-10-22 09:02:46,948 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2019-10-22 09:02:46,956 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:02:46,964 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-10-22 09:02:46,973 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-10-22 09:02:46,995 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:02:46,995 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:02:46,996 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:02:46,996 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:46,996 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:46,996 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:02:46,996 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:46,996 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:02:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-10-22 09:02:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 09:02:47,018 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:47,019 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:47,021 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:47,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:47,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1287811732, now seen corresponding path program 1 times [2019-10-22 09:02:47,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:47,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667022978] [2019-10-22 09:02:47,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:47,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667022978] [2019-10-22 09:02:47,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:47,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:47,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81910368] [2019-10-22 09:02:47,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:47,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:47,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:47,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:47,216 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-10-22 09:02:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:47,402 INFO L93 Difference]: Finished difference Result 323 states and 532 transitions. [2019-10-22 09:02:47,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:47,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-22 09:02:47,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:47,416 INFO L225 Difference]: With dead ends: 323 [2019-10-22 09:02:47,416 INFO L226 Difference]: Without dead ends: 155 [2019-10-22 09:02:47,419 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-22 09:02:47,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-10-22 09:02:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-22 09:02:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 230 transitions. [2019-10-22 09:02:47,464 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 230 transitions. Word has length 16 [2019-10-22 09:02:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:47,465 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 230 transitions. [2019-10-22 09:02:47,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 230 transitions. [2019-10-22 09:02:47,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 09:02:47,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:47,466 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:47,466 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:47,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:47,467 INFO L82 PathProgramCache]: Analyzing trace with hash 664085130, now seen corresponding path program 1 times [2019-10-22 09:02:47,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:47,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750023352] [2019-10-22 09:02:47,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:47,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750023352] [2019-10-22 09:02:47,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:47,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:47,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962794486] [2019-10-22 09:02:47,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:47,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:47,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:47,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:47,520 INFO L87 Difference]: Start difference. First operand 155 states and 230 transitions. Second operand 3 states. [2019-10-22 09:02:47,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:47,704 INFO L93 Difference]: Finished difference Result 313 states and 462 transitions. [2019-10-22 09:02:47,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:47,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 09:02:47,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:47,706 INFO L225 Difference]: With dead ends: 313 [2019-10-22 09:02:47,706 INFO L226 Difference]: Without dead ends: 165 [2019-10-22 09:02:47,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:47,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-22 09:02:47,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 156. [2019-10-22 09:02:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-22 09:02:47,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 231 transitions. [2019-10-22 09:02:47,721 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 231 transitions. Word has length 17 [2019-10-22 09:02:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:47,722 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 231 transitions. [2019-10-22 09:02:47,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:47,722 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 231 transitions. [2019-10-22 09:02:47,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 09:02:47,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:47,723 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:47,724 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:47,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:47,725 INFO L82 PathProgramCache]: Analyzing trace with hash 37329238, now seen corresponding path program 1 times [2019-10-22 09:02:47,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:47,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574168348] [2019-10-22 09:02:47,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:47,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574168348] [2019-10-22 09:02:47,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:47,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:47,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397798008] [2019-10-22 09:02:47,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:47,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:47,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:47,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:47,793 INFO L87 Difference]: Start difference. First operand 156 states and 231 transitions. Second operand 3 states. [2019-10-22 09:02:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:47,951 INFO L93 Difference]: Finished difference Result 315 states and 464 transitions. [2019-10-22 09:02:47,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:47,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 09:02:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:47,954 INFO L225 Difference]: With dead ends: 315 [2019-10-22 09:02:47,954 INFO L226 Difference]: Without dead ends: 166 [2019-10-22 09:02:47,955 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-22 09:02:47,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2019-10-22 09:02:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-22 09:02:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2019-10-22 09:02:47,982 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 18 [2019-10-22 09:02:47,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:47,982 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2019-10-22 09:02:47,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2019-10-22 09:02:47,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 09:02:47,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:47,983 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:47,983 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:47,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:47,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1635395343, now seen corresponding path program 1 times [2019-10-22 09:02:47,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:47,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474647874] [2019-10-22 09:02:47,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:48,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:48,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474647874] [2019-10-22 09:02:48,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:48,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:48,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665030832] [2019-10-22 09:02:48,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:48,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:48,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:48,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:48,044 INFO L87 Difference]: Start difference. First operand 157 states and 232 transitions. Second operand 3 states. [2019-10-22 09:02:48,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:48,186 INFO L93 Difference]: Finished difference Result 317 states and 466 transitions. [2019-10-22 09:02:48,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:48,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 09:02:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:48,190 INFO L225 Difference]: With dead ends: 317 [2019-10-22 09:02:48,190 INFO L226 Difference]: Without dead ends: 167 [2019-10-22 09:02:48,191 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:48,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-22 09:02:48,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2019-10-22 09:02:48,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-22 09:02:48,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 233 transitions. [2019-10-22 09:02:48,216 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 233 transitions. Word has length 19 [2019-10-22 09:02:48,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:48,217 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 233 transitions. [2019-10-22 09:02:48,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:48,217 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 233 transitions. [2019-10-22 09:02:48,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 09:02:48,218 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:48,218 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:48,218 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:48,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:48,219 INFO L82 PathProgramCache]: Analyzing trace with hash -811500677, now seen corresponding path program 1 times [2019-10-22 09:02:48,219 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:48,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122083568] [2019-10-22 09:02:48,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:48,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122083568] [2019-10-22 09:02:48,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:48,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:48,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180002891] [2019-10-22 09:02:48,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:48,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:48,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:48,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:48,291 INFO L87 Difference]: Start difference. First operand 158 states and 233 transitions. Second operand 3 states. [2019-10-22 09:02:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:48,422 INFO L93 Difference]: Finished difference Result 319 states and 468 transitions. [2019-10-22 09:02:48,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:48,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 09:02:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:48,424 INFO L225 Difference]: With dead ends: 319 [2019-10-22 09:02:48,424 INFO L226 Difference]: Without dead ends: 168 [2019-10-22 09:02:48,425 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:48,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-22 09:02:48,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2019-10-22 09:02:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-22 09:02:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 234 transitions. [2019-10-22 09:02:48,447 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 234 transitions. Word has length 20 [2019-10-22 09:02:48,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:48,448 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 234 transitions. [2019-10-22 09:02:48,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:48,448 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 234 transitions. [2019-10-22 09:02:48,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 09:02:48,449 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:48,449 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:48,449 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:48,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:48,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1579118521, now seen corresponding path program 1 times [2019-10-22 09:02:48,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:48,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552042490] [2019-10-22 09:02:48,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:48,484 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:02:48,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1150260066] [2019-10-22 09:02:48,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/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-10-22 09:02:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:48,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:48,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:48,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552042490] [2019-10-22 09:02:48,564 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 09:02:48,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150260066] [2019-10-22 09:02:48,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:48,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:48,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33317424] [2019-10-22 09:02:48,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:48,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:48,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:48,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:48,569 INFO L87 Difference]: Start difference. First operand 159 states and 234 transitions. Second operand 3 states. [2019-10-22 09:02:48,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:48,613 INFO L93 Difference]: Finished difference Result 455 states and 672 transitions. [2019-10-22 09:02:48,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:48,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 09:02:48,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:48,615 INFO L225 Difference]: With dead ends: 455 [2019-10-22 09:02:48,615 INFO L226 Difference]: Without dead ends: 303 [2019-10-22 09:02:48,616 INFO L600 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-10-22 09:02:48,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-10-22 09:02:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2019-10-22 09:02:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-10-22 09:02:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 446 transitions. [2019-10-22 09:02:48,632 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 446 transitions. Word has length 39 [2019-10-22 09:02:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:48,632 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 446 transitions. [2019-10-22 09:02:48,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 446 transitions. [2019-10-22 09:02:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 09:02:48,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:48,634 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:48,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:48,835 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:48,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:48,835 INFO L82 PathProgramCache]: Analyzing trace with hash 643824433, now seen corresponding path program 1 times [2019-10-22 09:02:48,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:48,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595242207] [2019-10-22 09:02:48,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:48,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595242207] [2019-10-22 09:02:48,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:48,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:48,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629522015] [2019-10-22 09:02:48,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:48,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:48,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:48,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:48,872 INFO L87 Difference]: Start difference. First operand 299 states and 446 transitions. Second operand 3 states. [2019-10-22 09:02:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:49,037 INFO L93 Difference]: Finished difference Result 653 states and 987 transitions. [2019-10-22 09:02:49,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:49,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 09:02:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:49,040 INFO L225 Difference]: With dead ends: 653 [2019-10-22 09:02:49,040 INFO L226 Difference]: Without dead ends: 361 [2019-10-22 09:02:49,041 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-10-22 09:02:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2019-10-22 09:02:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-10-22 09:02:49,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 550 transitions. [2019-10-22 09:02:49,065 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 550 transitions. Word has length 44 [2019-10-22 09:02:49,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:49,067 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 550 transitions. [2019-10-22 09:02:49,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 550 transitions. [2019-10-22 09:02:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-22 09:02:49,069 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:49,069 INFO L380 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-10-22 09:02:49,069 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:49,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:49,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1369957728, now seen corresponding path program 1 times [2019-10-22 09:02:49,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:49,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668878490] [2019-10-22 09:02:49,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:49,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:49,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:49,088 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:02:49,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2044965475] [2019-10-22 09:02:49,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/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-10-22 09:02:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:49,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:49,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:49,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668878490] [2019-10-22 09:02:49,196 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 09:02:49,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044965475] [2019-10-22 09:02:49,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:49,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:49,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356891633] [2019-10-22 09:02:49,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:49,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:49,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:49,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:49,199 INFO L87 Difference]: Start difference. First operand 361 states and 550 transitions. Second operand 3 states. [2019-10-22 09:02:49,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:49,239 INFO L93 Difference]: Finished difference Result 719 states and 1092 transitions. [2019-10-22 09:02:49,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:49,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-22 09:02:49,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:49,241 INFO L225 Difference]: With dead ends: 719 [2019-10-22 09:02:49,241 INFO L226 Difference]: Without dead ends: 536 [2019-10-22 09:02:49,242 INFO L600 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-10-22 09:02:49,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-10-22 09:02:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 532. [2019-10-22 09:02:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-10-22 09:02:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 815 transitions. [2019-10-22 09:02:49,261 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 815 transitions. Word has length 55 [2019-10-22 09:02:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:49,262 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 815 transitions. [2019-10-22 09:02:49,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 815 transitions. [2019-10-22 09:02:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 09:02:49,265 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:49,265 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:49,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:49,468 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:49,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:49,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1405602907, now seen corresponding path program 1 times [2019-10-22 09:02:49,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:49,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91131446] [2019-10-22 09:02:49,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:49,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:49,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 09:02:49,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91131446] [2019-10-22 09:02:49,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:49,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:49,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138758141] [2019-10-22 09:02:49,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:49,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:49,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:49,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:49,516 INFO L87 Difference]: Start difference. First operand 532 states and 815 transitions. Second operand 3 states. [2019-10-22 09:02:49,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:49,643 INFO L93 Difference]: Finished difference Result 1111 states and 1694 transitions. [2019-10-22 09:02:49,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:49,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-22 09:02:49,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:49,646 INFO L225 Difference]: With dead ends: 1111 [2019-10-22 09:02:49,646 INFO L226 Difference]: Without dead ends: 586 [2019-10-22 09:02:49,647 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:49,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-22 09:02:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 580. [2019-10-22 09:02:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-22 09:02:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 878 transitions. [2019-10-22 09:02:49,670 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 878 transitions. Word has length 56 [2019-10-22 09:02:49,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:49,671 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 878 transitions. [2019-10-22 09:02:49,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:49,671 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 878 transitions. [2019-10-22 09:02:49,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-22 09:02:49,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:49,672 INFO L380 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-10-22 09:02:49,672 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:49,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:49,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2147424561, now seen corresponding path program 1 times [2019-10-22 09:02:49,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:49,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152411026] [2019-10-22 09:02:49,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:49,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:49,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 09:02:49,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152411026] [2019-10-22 09:02:49,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:49,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:49,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961984472] [2019-10-22 09:02:49,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:49,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:49,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:49,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:49,715 INFO L87 Difference]: Start difference. First operand 580 states and 878 transitions. Second operand 3 states. [2019-10-22 09:02:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:49,839 INFO L93 Difference]: Finished difference Result 1162 states and 1757 transitions. [2019-10-22 09:02:49,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:49,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-22 09:02:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:49,842 INFO L225 Difference]: With dead ends: 1162 [2019-10-22 09:02:49,842 INFO L226 Difference]: Without dead ends: 589 [2019-10-22 09:02:49,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-22 09:02:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 583. [2019-10-22 09:02:49,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-22 09:02:49,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 878 transitions. [2019-10-22 09:02:49,862 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 878 transitions. Word has length 57 [2019-10-22 09:02:49,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:49,862 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 878 transitions. [2019-10-22 09:02:49,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:49,863 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 878 transitions. [2019-10-22 09:02:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-22 09:02:49,863 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:49,864 INFO L380 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-10-22 09:02:49,864 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:49,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:49,864 INFO L82 PathProgramCache]: Analyzing trace with hash -216125576, now seen corresponding path program 1 times [2019-10-22 09:02:49,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:49,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406228894] [2019-10-22 09:02:49,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:49,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:49,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:49,889 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 09:02:49,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406228894] [2019-10-22 09:02:49,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:49,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:49,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225241304] [2019-10-22 09:02:49,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:49,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:49,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:49,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:49,891 INFO L87 Difference]: Start difference. First operand 583 states and 878 transitions. Second operand 3 states. [2019-10-22 09:02:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:50,029 INFO L93 Difference]: Finished difference Result 1291 states and 1970 transitions. [2019-10-22 09:02:50,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:50,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-22 09:02:50,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:50,032 INFO L225 Difference]: With dead ends: 1291 [2019-10-22 09:02:50,032 INFO L226 Difference]: Without dead ends: 715 [2019-10-22 09:02:50,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-10-22 09:02:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 709. [2019-10-22 09:02:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-10-22 09:02:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1091 transitions. [2019-10-22 09:02:50,054 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1091 transitions. Word has length 70 [2019-10-22 09:02:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:50,055 INFO L462 AbstractCegarLoop]: Abstraction has 709 states and 1091 transitions. [2019-10-22 09:02:50,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:50,055 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1091 transitions. [2019-10-22 09:02:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-22 09:02:50,056 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:50,056 INFO L380 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-10-22 09:02:50,056 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:50,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:50,057 INFO L82 PathProgramCache]: Analyzing trace with hash 380295080, now seen corresponding path program 1 times [2019-10-22 09:02:50,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:50,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314471481] [2019-10-22 09:02:50,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:50,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:50,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 09:02:50,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314471481] [2019-10-22 09:02:50,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:50,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:50,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239727837] [2019-10-22 09:02:50,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:50,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:50,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:50,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:50,088 INFO L87 Difference]: Start difference. First operand 709 states and 1091 transitions. Second operand 3 states. [2019-10-22 09:02:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:50,227 INFO L93 Difference]: Finished difference Result 1513 states and 2336 transitions. [2019-10-22 09:02:50,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:50,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-22 09:02:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:50,230 INFO L225 Difference]: With dead ends: 1513 [2019-10-22 09:02:50,230 INFO L226 Difference]: Without dead ends: 811 [2019-10-22 09:02:50,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:50,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-10-22 09:02:50,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 790. [2019-10-22 09:02:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-10-22 09:02:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1211 transitions. [2019-10-22 09:02:50,256 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1211 transitions. Word has length 71 [2019-10-22 09:02:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:50,257 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1211 transitions. [2019-10-22 09:02:50,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1211 transitions. [2019-10-22 09:02:50,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-22 09:02:50,258 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:50,258 INFO L380 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-10-22 09:02:50,258 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:50,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:50,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1769518732, now seen corresponding path program 1 times [2019-10-22 09:02:50,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:50,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083152656] [2019-10-22 09:02:50,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:50,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:50,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 09:02:50,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083152656] [2019-10-22 09:02:50,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:50,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:50,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331103970] [2019-10-22 09:02:50,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:50,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:50,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:50,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:50,295 INFO L87 Difference]: Start difference. First operand 790 states and 1211 transitions. Second operand 3 states. [2019-10-22 09:02:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:50,430 INFO L93 Difference]: Finished difference Result 1582 states and 2423 transitions. [2019-10-22 09:02:50,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:50,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-22 09:02:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:50,433 INFO L225 Difference]: With dead ends: 1582 [2019-10-22 09:02:50,433 INFO L226 Difference]: Without dead ends: 799 [2019-10-22 09:02:50,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:50,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-10-22 09:02:50,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 793. [2019-10-22 09:02:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-10-22 09:02:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1211 transitions. [2019-10-22 09:02:50,459 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1211 transitions. Word has length 71 [2019-10-22 09:02:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:50,460 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1211 transitions. [2019-10-22 09:02:50,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:50,461 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1211 transitions. [2019-10-22 09:02:50,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-22 09:02:50,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:50,464 INFO L380 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-10-22 09:02:50,465 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:50,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:50,465 INFO L82 PathProgramCache]: Analyzing trace with hash -953703820, now seen corresponding path program 1 times [2019-10-22 09:02:50,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:50,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569626743] [2019-10-22 09:02:50,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:50,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:50,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 09:02:50,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569626743] [2019-10-22 09:02:50,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:50,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:50,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146456427] [2019-10-22 09:02:50,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:50,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:50,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:50,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:50,505 INFO L87 Difference]: Start difference. First operand 793 states and 1211 transitions. Second operand 3 states. [2019-10-22 09:02:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:50,660 INFO L93 Difference]: Finished difference Result 1600 states and 2447 transitions. [2019-10-22 09:02:50,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:50,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-22 09:02:50,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:50,663 INFO L225 Difference]: With dead ends: 1600 [2019-10-22 09:02:50,663 INFO L226 Difference]: Without dead ends: 814 [2019-10-22 09:02:50,665 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-10-22 09:02:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 793. [2019-10-22 09:02:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-10-22 09:02:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1202 transitions. [2019-10-22 09:02:50,696 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1202 transitions. Word has length 72 [2019-10-22 09:02:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:50,696 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1202 transitions. [2019-10-22 09:02:50,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1202 transitions. [2019-10-22 09:02:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 09:02:50,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:50,698 INFO L380 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-10-22 09:02:50,698 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:50,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:50,698 INFO L82 PathProgramCache]: Analyzing trace with hash -816065300, now seen corresponding path program 1 times [2019-10-22 09:02:50,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:50,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505382458] [2019-10-22 09:02:50,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:50,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:50,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:50,710 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:02:50,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [138385126] [2019-10-22 09:02:50,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/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-10-22 09:02:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:50,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:50,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:02:50,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505382458] [2019-10-22 09:02:50,782 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 09:02:50,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138385126] [2019-10-22 09:02:50,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:50,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:50,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118751521] [2019-10-22 09:02:50,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:50,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:50,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:50,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:50,783 INFO L87 Difference]: Start difference. First operand 793 states and 1202 transitions. Second operand 3 states. [2019-10-22 09:02:50,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:50,837 INFO L93 Difference]: Finished difference Result 1583 states and 2396 transitions. [2019-10-22 09:02:50,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:50,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-22 09:02:50,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:50,841 INFO L225 Difference]: With dead ends: 1583 [2019-10-22 09:02:50,841 INFO L226 Difference]: Without dead ends: 1055 [2019-10-22 09:02:50,842 INFO L600 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-10-22 09:02:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-10-22 09:02:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1051. [2019-10-22 09:02:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-10-22 09:02:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1597 transitions. [2019-10-22 09:02:50,881 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1597 transitions. Word has length 76 [2019-10-22 09:02:50,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:50,881 INFO L462 AbstractCegarLoop]: Abstraction has 1051 states and 1597 transitions. [2019-10-22 09:02:50,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1597 transitions. [2019-10-22 09:02:50,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-22 09:02:50,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:50,883 INFO L380 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-10-22 09:02:51,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:51,084 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:51,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:51,085 INFO L82 PathProgramCache]: Analyzing trace with hash -174298828, now seen corresponding path program 1 times [2019-10-22 09:02:51,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:51,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592956249] [2019-10-22 09:02:51,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:51,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:51,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 09:02:51,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592956249] [2019-10-22 09:02:51,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:51,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:51,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434189809] [2019-10-22 09:02:51,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:51,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:51,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:51,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:51,147 INFO L87 Difference]: Start difference. First operand 1051 states and 1597 transitions. Second operand 3 states. [2019-10-22 09:02:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:51,320 INFO L93 Difference]: Finished difference Result 2279 states and 3475 transitions. [2019-10-22 09:02:51,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:51,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-22 09:02:51,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:51,324 INFO L225 Difference]: With dead ends: 2279 [2019-10-22 09:02:51,325 INFO L226 Difference]: Without dead ends: 1235 [2019-10-22 09:02:51,326 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:51,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-10-22 09:02:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1223. [2019-10-22 09:02:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-10-22 09:02:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1873 transitions. [2019-10-22 09:02:51,364 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1873 transitions. Word has length 86 [2019-10-22 09:02:51,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:51,364 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1873 transitions. [2019-10-22 09:02:51,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1873 transitions. [2019-10-22 09:02:51,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-22 09:02:51,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:51,366 INFO L380 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-10-22 09:02:51,367 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:51,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:51,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1676680243, now seen corresponding path program 1 times [2019-10-22 09:02:51,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:51,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120803248] [2019-10-22 09:02:51,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:51,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:51,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 09:02:51,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120803248] [2019-10-22 09:02:51,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:51,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:51,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78017847] [2019-10-22 09:02:51,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:51,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:51,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:51,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:51,397 INFO L87 Difference]: Start difference. First operand 1223 states and 1873 transitions. Second operand 3 states. [2019-10-22 09:02:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:51,571 INFO L93 Difference]: Finished difference Result 2499 states and 3839 transitions. [2019-10-22 09:02:51,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:51,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-10-22 09:02:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:51,575 INFO L225 Difference]: With dead ends: 2499 [2019-10-22 09:02:51,575 INFO L226 Difference]: Without dead ends: 1275 [2019-10-22 09:02:51,577 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:51,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-10-22 09:02:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1263. [2019-10-22 09:02:51,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-10-22 09:02:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1949 transitions. [2019-10-22 09:02:51,615 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1949 transitions. Word has length 87 [2019-10-22 09:02:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:51,615 INFO L462 AbstractCegarLoop]: Abstraction has 1263 states and 1949 transitions. [2019-10-22 09:02:51,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1949 transitions. [2019-10-22 09:02:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 09:02:51,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:51,617 INFO L380 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-10-22 09:02:51,617 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:51,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:51,618 INFO L82 PathProgramCache]: Analyzing trace with hash 538835484, now seen corresponding path program 1 times [2019-10-22 09:02:51,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:51,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526359890] [2019-10-22 09:02:51,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:51,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:51,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-22 09:02:51,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526359890] [2019-10-22 09:02:51,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:51,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:51,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571081422] [2019-10-22 09:02:51,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:51,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:51,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:51,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:51,645 INFO L87 Difference]: Start difference. First operand 1263 states and 1949 transitions. Second operand 3 states. [2019-10-22 09:02:51,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:51,789 INFO L93 Difference]: Finished difference Result 2667 states and 4123 transitions. [2019-10-22 09:02:51,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:51,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-22 09:02:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:51,794 INFO L225 Difference]: With dead ends: 2667 [2019-10-22 09:02:51,794 INFO L226 Difference]: Without dead ends: 1411 [2019-10-22 09:02:51,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-10-22 09:02:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-10-22 09:02:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-10-22 09:02:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2085 transitions. [2019-10-22 09:02:51,836 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2085 transitions. Word has length 97 [2019-10-22 09:02:51,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:51,836 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2085 transitions. [2019-10-22 09:02:51,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2085 transitions. [2019-10-22 09:02:51,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 09:02:51,838 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:51,838 INFO L380 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-10-22 09:02:51,838 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:51,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:51,839 INFO L82 PathProgramCache]: Analyzing trace with hash 704331080, now seen corresponding path program 1 times [2019-10-22 09:02:51,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:51,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579895476] [2019-10-22 09:02:51,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:51,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:51,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:51,863 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-22 09:02:51,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579895476] [2019-10-22 09:02:51,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:51,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:51,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795776791] [2019-10-22 09:02:51,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:51,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:51,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:51,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:51,864 INFO L87 Difference]: Start difference. First operand 1363 states and 2085 transitions. Second operand 3 states. [2019-10-22 09:02:52,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:52,017 INFO L93 Difference]: Finished difference Result 2767 states and 4239 transitions. [2019-10-22 09:02:52,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:52,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-22 09:02:52,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:52,022 INFO L225 Difference]: With dead ends: 2767 [2019-10-22 09:02:52,022 INFO L226 Difference]: Without dead ends: 1411 [2019-10-22 09:02:52,024 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-10-22 09:02:52,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-10-22 09:02:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-10-22 09:02:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2065 transitions. [2019-10-22 09:02:52,061 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2065 transitions. Word has length 98 [2019-10-22 09:02:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:52,061 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2065 transitions. [2019-10-22 09:02:52,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2065 transitions. [2019-10-22 09:02:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-22 09:02:52,064 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:52,064 INFO L380 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-10-22 09:02:52,064 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:52,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:52,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1454055914, now seen corresponding path program 1 times [2019-10-22 09:02:52,064 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:52,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813658695] [2019-10-22 09:02:52,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:52,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:52,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:52,073 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:02:52,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1427857347] [2019-10-22 09:02:52,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/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-10-22 09:02:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:52,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:52,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 09:02:52,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813658695] [2019-10-22 09:02:52,141 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 09:02:52,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427857347] [2019-10-22 09:02:52,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:52,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:52,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571914956] [2019-10-22 09:02:52,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:52,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:52,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:52,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:52,142 INFO L87 Difference]: Start difference. First operand 1363 states and 2065 transitions. Second operand 3 states. [2019-10-22 09:02:52,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:52,323 INFO L93 Difference]: Finished difference Result 2755 states and 4163 transitions. [2019-10-22 09:02:52,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:52,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-10-22 09:02:52,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:52,328 INFO L225 Difference]: With dead ends: 2755 [2019-10-22 09:02:52,328 INFO L226 Difference]: Without dead ends: 1399 [2019-10-22 09:02:52,330 INFO L600 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-10-22 09:02:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-10-22 09:02:52,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1363. [2019-10-22 09:02:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-10-22 09:02:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1993 transitions. [2019-10-22 09:02:52,368 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1993 transitions. Word has length 116 [2019-10-22 09:02:52,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:52,368 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1993 transitions. [2019-10-22 09:02:52,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:52,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1993 transitions. [2019-10-22 09:02:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-22 09:02:52,370 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:52,371 INFO L380 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-10-22 09:02:52,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:52,573 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:52,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:52,573 INFO L82 PathProgramCache]: Analyzing trace with hash 2083865546, now seen corresponding path program 1 times [2019-10-22 09:02:52,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:52,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327004578] [2019-10-22 09:02:52,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:52,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:52,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-22 09:02:52,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327004578] [2019-10-22 09:02:52,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:52,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:52,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341077236] [2019-10-22 09:02:52,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:52,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:52,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:52,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:52,607 INFO L87 Difference]: Start difference. First operand 1363 states and 1993 transitions. Second operand 3 states. [2019-10-22 09:02:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:52,765 INFO L93 Difference]: Finished difference Result 2827 states and 4135 transitions. [2019-10-22 09:02:52,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:52,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-10-22 09:02:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:52,771 INFO L225 Difference]: With dead ends: 2827 [2019-10-22 09:02:52,771 INFO L226 Difference]: Without dead ends: 1471 [2019-10-22 09:02:52,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:52,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-10-22 09:02:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-10-22 09:02:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-10-22 09:02:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2117 transitions. [2019-10-22 09:02:52,851 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2117 transitions. Word has length 117 [2019-10-22 09:02:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:52,851 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2117 transitions. [2019-10-22 09:02:52,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2117 transitions. [2019-10-22 09:02:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-22 09:02:52,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:52,853 INFO L380 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-10-22 09:02:52,853 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:52,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:52,854 INFO L82 PathProgramCache]: Analyzing trace with hash -63631274, now seen corresponding path program 1 times [2019-10-22 09:02:52,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:52,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011438402] [2019-10-22 09:02:52,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:52,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:52,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:52,879 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-22 09:02:52,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011438402] [2019-10-22 09:02:52,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:52,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:52,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953263081] [2019-10-22 09:02:52,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:52,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:52,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:52,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:52,881 INFO L87 Difference]: Start difference. First operand 1459 states and 2117 transitions. Second operand 3 states. [2019-10-22 09:02:53,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:53,020 INFO L93 Difference]: Finished difference Result 2923 states and 4239 transitions. [2019-10-22 09:02:53,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:53,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-10-22 09:02:53,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:53,026 INFO L225 Difference]: With dead ends: 2923 [2019-10-22 09:02:53,026 INFO L226 Difference]: Without dead ends: 1471 [2019-10-22 09:02:53,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:53,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-10-22 09:02:53,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-10-22 09:02:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-10-22 09:02:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2097 transitions. [2019-10-22 09:02:53,070 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2097 transitions. Word has length 118 [2019-10-22 09:02:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:53,070 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2097 transitions. [2019-10-22 09:02:53,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2097 transitions. [2019-10-22 09:02:53,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-22 09:02:53,072 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:53,072 INFO L380 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-10-22 09:02:53,073 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:53,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash 365233416, now seen corresponding path program 1 times [2019-10-22 09:02:53,074 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:53,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395771109] [2019-10-22 09:02:53,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:53,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:53,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-22 09:02:53,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395771109] [2019-10-22 09:02:53,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:53,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:53,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874498991] [2019-10-22 09:02:53,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:53,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:53,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:53,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:53,109 INFO L87 Difference]: Start difference. First operand 1459 states and 2097 transitions. Second operand 3 states. [2019-10-22 09:02:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:53,267 INFO L93 Difference]: Finished difference Result 3091 states and 4445 transitions. [2019-10-22 09:02:53,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:53,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-22 09:02:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:53,272 INFO L225 Difference]: With dead ends: 3091 [2019-10-22 09:02:53,272 INFO L226 Difference]: Without dead ends: 1639 [2019-10-22 09:02:53,274 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:53,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-10-22 09:02:53,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1623. [2019-10-22 09:02:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-10-22 09:02:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2337 transitions. [2019-10-22 09:02:53,322 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2337 transitions. Word has length 126 [2019-10-22 09:02:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:53,322 INFO L462 AbstractCegarLoop]: Abstraction has 1623 states and 2337 transitions. [2019-10-22 09:02:53,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2337 transitions. [2019-10-22 09:02:53,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-22 09:02:53,325 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:53,325 INFO L380 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-10-22 09:02:53,325 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:53,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:53,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1493527041, now seen corresponding path program 1 times [2019-10-22 09:02:53,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:53,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175708381] [2019-10-22 09:02:53,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:53,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:53,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-22 09:02:53,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175708381] [2019-10-22 09:02:53,364 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:53,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:53,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825767884] [2019-10-22 09:02:53,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:53,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:53,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:53,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:53,365 INFO L87 Difference]: Start difference. First operand 1623 states and 2337 transitions. Second operand 3 states. [2019-10-22 09:02:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:53,535 INFO L93 Difference]: Finished difference Result 3255 states and 4681 transitions. [2019-10-22 09:02:53,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:53,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-22 09:02:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:53,540 INFO L225 Difference]: With dead ends: 3255 [2019-10-22 09:02:53,540 INFO L226 Difference]: Without dead ends: 1631 [2019-10-22 09:02:53,542 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-10-22 09:02:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1615. [2019-10-22 09:02:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-10-22 09:02:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2321 transitions. [2019-10-22 09:02:53,594 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2321 transitions. Word has length 127 [2019-10-22 09:02:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:53,595 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 2321 transitions. [2019-10-22 09:02:53,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2321 transitions. [2019-10-22 09:02:53,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-22 09:02:53,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:53,597 INFO L380 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-10-22 09:02:53,597 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:53,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:53,598 INFO L82 PathProgramCache]: Analyzing trace with hash 704603328, now seen corresponding path program 1 times [2019-10-22 09:02:53,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:53,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569325026] [2019-10-22 09:02:53,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:53,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:53,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-22 09:02:53,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569325026] [2019-10-22 09:02:53,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:53,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:53,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856833775] [2019-10-22 09:02:53,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:53,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:53,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:53,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:53,631 INFO L87 Difference]: Start difference. First operand 1615 states and 2321 transitions. Second operand 3 states. [2019-10-22 09:02:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:53,777 INFO L93 Difference]: Finished difference Result 3323 states and 4778 transitions. [2019-10-22 09:02:53,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:53,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-10-22 09:02:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:53,783 INFO L225 Difference]: With dead ends: 3323 [2019-10-22 09:02:53,783 INFO L226 Difference]: Without dead ends: 1715 [2019-10-22 09:02:53,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:53,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-10-22 09:02:53,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-10-22 09:02:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-10-22 09:02:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2417 transitions. [2019-10-22 09:02:53,835 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2417 transitions. Word has length 138 [2019-10-22 09:02:53,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:53,835 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2417 transitions. [2019-10-22 09:02:53,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:53,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2417 transitions. [2019-10-22 09:02:53,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-22 09:02:53,838 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:53,838 INFO L380 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-10-22 09:02:53,838 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:53,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:53,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1658127444, now seen corresponding path program 1 times [2019-10-22 09:02:53,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:53,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921144767] [2019-10-22 09:02:53,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:53,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:53,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:53,870 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-22 09:02:53,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921144767] [2019-10-22 09:02:53,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:53,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:53,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946761068] [2019-10-22 09:02:53,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:53,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:53,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:53,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:53,873 INFO L87 Difference]: Start difference. First operand 1699 states and 2417 transitions. Second operand 3 states. [2019-10-22 09:02:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:54,041 INFO L93 Difference]: Finished difference Result 3407 states and 4846 transitions. [2019-10-22 09:02:54,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:54,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-22 09:02:54,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:54,046 INFO L225 Difference]: With dead ends: 3407 [2019-10-22 09:02:54,046 INFO L226 Difference]: Without dead ends: 1715 [2019-10-22 09:02:54,048 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:54,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-10-22 09:02:54,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-10-22 09:02:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-10-22 09:02:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2389 transitions. [2019-10-22 09:02:54,098 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2389 transitions. Word has length 139 [2019-10-22 09:02:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:54,099 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2389 transitions. [2019-10-22 09:02:54,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:54,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2389 transitions. [2019-10-22 09:02:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-22 09:02:54,101 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:54,101 INFO L380 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-10-22 09:02:54,102 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:54,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:54,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1163594683, now seen corresponding path program 1 times [2019-10-22 09:02:54,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:54,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532619990] [2019-10-22 09:02:54,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:54,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:54,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-10-22 09:02:54,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532619990] [2019-10-22 09:02:54,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:54,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:54,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196313802] [2019-10-22 09:02:54,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:54,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:54,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:54,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:54,136 INFO L87 Difference]: Start difference. First operand 1699 states and 2389 transitions. Second operand 3 states. [2019-10-22 09:02:54,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:54,196 INFO L93 Difference]: Finished difference Result 3373 states and 4735 transitions. [2019-10-22 09:02:54,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:54,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-22 09:02:54,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:54,201 INFO L225 Difference]: With dead ends: 3373 [2019-10-22 09:02:54,206 INFO L226 Difference]: Without dead ends: 1681 [2019-10-22 09:02:54,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:54,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2019-10-22 09:02:54,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1677. [2019-10-22 09:02:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2019-10-22 09:02:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2356 transitions. [2019-10-22 09:02:54,265 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2356 transitions. Word has length 154 [2019-10-22 09:02:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:54,266 INFO L462 AbstractCegarLoop]: Abstraction has 1677 states and 2356 transitions. [2019-10-22 09:02:54,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2356 transitions. [2019-10-22 09:02:54,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-22 09:02:54,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:54,269 INFO L380 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-10-22 09:02:54,269 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:54,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:54,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1358544773, now seen corresponding path program 1 times [2019-10-22 09:02:54,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:54,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126674551] [2019-10-22 09:02:54,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:54,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:54,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-22 09:02:54,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126674551] [2019-10-22 09:02:54,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413564336] [2019-10-22 09:02:54,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/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-10-22 09:02:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:54,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:02:54,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-22 09:02:54,417 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:54,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 09:02:54,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265070564] [2019-10-22 09:02:54,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:54,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:54,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:54,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:54,418 INFO L87 Difference]: Start difference. First operand 1677 states and 2356 transitions. Second operand 4 states. [2019-10-22 09:02:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:54,802 INFO L93 Difference]: Finished difference Result 5291 states and 7422 transitions. [2019-10-22 09:02:54,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:54,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-22 09:02:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:54,812 INFO L225 Difference]: With dead ends: 5291 [2019-10-22 09:02:54,812 INFO L226 Difference]: Without dead ends: 3521 [2019-10-22 09:02:54,814 INFO L600 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-10-22 09:02:54,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2019-10-22 09:02:54,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2065. [2019-10-22 09:02:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2019-10-22 09:02:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2916 transitions. [2019-10-22 09:02:54,884 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2916 transitions. Word has length 154 [2019-10-22 09:02:54,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:54,884 INFO L462 AbstractCegarLoop]: Abstraction has 2065 states and 2916 transitions. [2019-10-22 09:02:54,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2916 transitions. [2019-10-22 09:02:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-22 09:02:54,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:54,887 INFO L380 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-10-22 09:02:55,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:55,089 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:55,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:55,089 INFO L82 PathProgramCache]: Analyzing trace with hash 782353573, now seen corresponding path program 1 times [2019-10-22 09:02:55,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:55,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126832267] [2019-10-22 09:02:55,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:55,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:55,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-22 09:02:55,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126832267] [2019-10-22 09:02:55,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42755365] [2019-10-22 09:02:55,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/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-10-22 09:02:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:55,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:02:55,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-22 09:02:55,213 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:55,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 09:02:55,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877336181] [2019-10-22 09:02:55,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:55,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:55,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:55,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:55,214 INFO L87 Difference]: Start difference. First operand 2065 states and 2916 transitions. Second operand 4 states. [2019-10-22 09:02:55,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:55,569 INFO L93 Difference]: Finished difference Result 5632 states and 7889 transitions. [2019-10-22 09:02:55,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:55,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-22 09:02:55,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:55,577 INFO L225 Difference]: With dead ends: 5632 [2019-10-22 09:02:55,577 INFO L226 Difference]: Without dead ends: 3574 [2019-10-22 09:02:55,583 INFO L600 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-10-22 09:02:55,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-10-22 09:02:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 2573. [2019-10-22 09:02:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2573 states. [2019-10-22 09:02:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 3491 transitions. [2019-10-22 09:02:55,687 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 3491 transitions. Word has length 156 [2019-10-22 09:02:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:55,688 INFO L462 AbstractCegarLoop]: Abstraction has 2573 states and 3491 transitions. [2019-10-22 09:02:55,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:55,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3491 transitions. [2019-10-22 09:02:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-22 09:02:55,692 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:55,692 INFO L380 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-10-22 09:02:55,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:55,894 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:55,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:55,894 INFO L82 PathProgramCache]: Analyzing trace with hash -571340489, now seen corresponding path program 1 times [2019-10-22 09:02:55,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:55,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651156309] [2019-10-22 09:02:55,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:55,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:55,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-22 09:02:55,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651156309] [2019-10-22 09:02:55,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682739966] [2019-10-22 09:02:55,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/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-10-22 09:02:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:56,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:02:56,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-22 09:02:56,074 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:56,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 09:02:56,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873902207] [2019-10-22 09:02:56,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:56,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:56,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:56,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:56,076 INFO L87 Difference]: Start difference. First operand 2573 states and 3491 transitions. Second operand 4 states. [2019-10-22 09:02:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:56,426 INFO L93 Difference]: Finished difference Result 6269 states and 8443 transitions. [2019-10-22 09:02:56,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:56,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-10-22 09:02:56,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:56,433 INFO L225 Difference]: With dead ends: 6269 [2019-10-22 09:02:56,433 INFO L226 Difference]: Without dead ends: 3674 [2019-10-22 09:02:56,436 INFO L600 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-10-22 09:02:56,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2019-10-22 09:02:56,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 2279. [2019-10-22 09:02:56,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2019-10-22 09:02:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3070 transitions. [2019-10-22 09:02:56,509 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3070 transitions. Word has length 163 [2019-10-22 09:02:56,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:56,509 INFO L462 AbstractCegarLoop]: Abstraction has 2279 states and 3070 transitions. [2019-10-22 09:02:56,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3070 transitions. [2019-10-22 09:02:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-22 09:02:56,513 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:56,513 INFO L380 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-10-22 09:02:56,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:56,714 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:56,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:56,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2030054557, now seen corresponding path program 1 times [2019-10-22 09:02:56,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:56,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790306073] [2019-10-22 09:02:56,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:56,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:56,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-22 09:02:56,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790306073] [2019-10-22 09:02:56,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:56,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:56,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50477753] [2019-10-22 09:02:56,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:56,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:56,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:56,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:56,772 INFO L87 Difference]: Start difference. First operand 2279 states and 3070 transitions. Second operand 3 states. [2019-10-22 09:02:56,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:56,845 INFO L93 Difference]: Finished difference Result 5493 states and 7329 transitions. [2019-10-22 09:02:56,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:56,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-22 09:02:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:56,851 INFO L225 Difference]: With dead ends: 5493 [2019-10-22 09:02:56,851 INFO L226 Difference]: Without dead ends: 3221 [2019-10-22 09:02:56,854 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:56,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2019-10-22 09:02:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 3217. [2019-10-22 09:02:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2019-10-22 09:02:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4257 transitions. [2019-10-22 09:02:56,940 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4257 transitions. Word has length 165 [2019-10-22 09:02:56,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:56,940 INFO L462 AbstractCegarLoop]: Abstraction has 3217 states and 4257 transitions. [2019-10-22 09:02:56,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4257 transitions. [2019-10-22 09:02:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-22 09:02:56,944 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:56,945 INFO L380 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-10-22 09:02:56,945 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:56,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:56,946 INFO L82 PathProgramCache]: Analyzing trace with hash -36905074, now seen corresponding path program 1 times [2019-10-22 09:02:56,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:56,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011170820] [2019-10-22 09:02:56,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:56,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:56,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:56,958 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:02:56,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [471931275] [2019-10-22 09:02:56,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/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-10-22 09:02:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:57,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:02:57,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:57,056 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-22 09:02:57,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011170820] [2019-10-22 09:02:57,056 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 09:02:57,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471931275] [2019-10-22 09:02:57,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:57,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:57,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030756996] [2019-10-22 09:02:57,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:57,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:57,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:57,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:57,059 INFO L87 Difference]: Start difference. First operand 3217 states and 4257 transitions. Second operand 4 states. [2019-10-22 09:02:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:57,337 INFO L93 Difference]: Finished difference Result 5057 states and 6580 transitions. [2019-10-22 09:02:57,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:57,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-10-22 09:02:57,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:57,344 INFO L225 Difference]: With dead ends: 5057 [2019-10-22 09:02:57,344 INFO L226 Difference]: Without dead ends: 4092 [2019-10-22 09:02:57,346 INFO L600 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-10-22 09:02:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2019-10-22 09:02:57,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 3522. [2019-10-22 09:02:57,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3522 states. [2019-10-22 09:02:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 4633 transitions. [2019-10-22 09:02:57,443 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 4633 transitions. Word has length 186 [2019-10-22 09:02:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:57,443 INFO L462 AbstractCegarLoop]: Abstraction has 3522 states and 4633 transitions. [2019-10-22 09:02:57,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 4633 transitions. [2019-10-22 09:02:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-22 09:02:57,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:57,448 INFO L380 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-10-22 09:02:57,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:57,649 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:57,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:57,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1106021424, now seen corresponding path program 1 times [2019-10-22 09:02:57,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:57,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201794605] [2019-10-22 09:02:57,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:57,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:57,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:57,693 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:02:57,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [632070150] [2019-10-22 09:02:57,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/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-10-22 09:02:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:57,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:02:57,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-22 09:02:57,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201794605] [2019-10-22 09:02:57,827 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 09:02:57,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632070150] [2019-10-22 09:02:57,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:57,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:57,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090500611] [2019-10-22 09:02:57,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:57,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:57,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:57,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:57,830 INFO L87 Difference]: Start difference. First operand 3522 states and 4633 transitions. Second operand 5 states. [2019-10-22 09:02:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:58,102 INFO L93 Difference]: Finished difference Result 5415 states and 7085 transitions. [2019-10-22 09:02:58,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:58,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2019-10-22 09:02:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:58,111 INFO L225 Difference]: With dead ends: 5415 [2019-10-22 09:02:58,111 INFO L226 Difference]: Without dead ends: 5414 [2019-10-22 09:02:58,113 INFO L600 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-10-22 09:02:58,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2019-10-22 09:02:58,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 4841. [2019-10-22 09:02:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4841 states. [2019-10-22 09:02:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 6383 transitions. [2019-10-22 09:02:58,242 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 6383 transitions. Word has length 188 [2019-10-22 09:02:58,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:58,243 INFO L462 AbstractCegarLoop]: Abstraction has 4841 states and 6383 transitions. [2019-10-22 09:02:58,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:02:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 6383 transitions. [2019-10-22 09:02:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-22 09:02:58,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:58,247 INFO L380 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-10-22 09:02:58,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:58,449 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:58,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:58,449 INFO L82 PathProgramCache]: Analyzing trace with hash 73074738, now seen corresponding path program 1 times [2019-10-22 09:02:58,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:58,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123723644] [2019-10-22 09:02:58,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:58,467 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:02:58,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [190661853] [2019-10-22 09:02:58,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/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-10-22 09:02:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:58,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:58,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-22 09:02:58,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123723644] [2019-10-22 09:02:58,648 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 09:02:58,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190661853] [2019-10-22 09:02:58,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:58,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:58,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472269252] [2019-10-22 09:02:58,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:58,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:58,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:58,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:58,650 INFO L87 Difference]: Start difference. First operand 4841 states and 6383 transitions. Second operand 5 states. [2019-10-22 09:02:59,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:59,026 INFO L93 Difference]: Finished difference Result 9086 states and 11995 transitions. [2019-10-22 09:02:59,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:59,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-10-22 09:02:59,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:59,034 INFO L225 Difference]: With dead ends: 9086 [2019-10-22 09:02:59,034 INFO L226 Difference]: Without dead ends: 4944 [2019-10-22 09:02:59,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 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-10-22 09:02:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2019-10-22 09:02:59,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4935. [2019-10-22 09:02:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4935 states. [2019-10-22 09:02:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4935 states to 4935 states and 6457 transitions. [2019-10-22 09:02:59,159 INFO L78 Accepts]: Start accepts. Automaton has 4935 states and 6457 transitions. Word has length 189 [2019-10-22 09:02:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:59,159 INFO L462 AbstractCegarLoop]: Abstraction has 4935 states and 6457 transitions. [2019-10-22 09:02:59,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:02:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 4935 states and 6457 transitions. [2019-10-22 09:02:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-22 09:02:59,163 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:59,164 INFO L380 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-10-22 09:02:59,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:59,365 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:02:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:59,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1864895527, now seen corresponding path program 1 times [2019-10-22 09:02:59,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:59,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390032249] [2019-10-22 09:02:59,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:59,375 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:02:59,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [972088879] [2019-10-22 09:02:59,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/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-10-22 09:02:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:59,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:59,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:59,476 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-10-22 09:02:59,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390032249] [2019-10-22 09:02:59,476 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 09:02:59,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972088879] [2019-10-22 09:02:59,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:59,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:59,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600118491] [2019-10-22 09:02:59,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:59,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:59,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:59,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:59,478 INFO L87 Difference]: Start difference. First operand 4935 states and 6457 transitions. Second operand 3 states. [2019-10-22 09:02:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:59,724 INFO L93 Difference]: Finished difference Result 9835 states and 12868 transitions. [2019-10-22 09:02:59,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:59,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-22 09:02:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:59,731 INFO L225 Difference]: With dead ends: 9835 [2019-10-22 09:02:59,731 INFO L226 Difference]: Without dead ends: 3433 [2019-10-22 09:02:59,736 INFO L600 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-10-22 09:02:59,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2019-10-22 09:02:59,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3427. [2019-10-22 09:02:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3427 states. [2019-10-22 09:02:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 4448 transitions. [2019-10-22 09:02:59,875 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 4448 transitions. Word has length 196 [2019-10-22 09:02:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:59,875 INFO L462 AbstractCegarLoop]: Abstraction has 3427 states and 4448 transitions. [2019-10-22 09:02:59,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 4448 transitions. [2019-10-22 09:02:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-22 09:02:59,878 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:59,878 INFO L380 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-10-22 09:03:00,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:03:00,079 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:03:00,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:00,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1327391442, now seen corresponding path program 1 times [2019-10-22 09:03:00,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:00,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487277554] [2019-10-22 09:03:00,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:00,116 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-10-22 09:03:00,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487277554] [2019-10-22 09:03:00,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:00,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:03:00,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80345809] [2019-10-22 09:03:00,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:03:00,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:00,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:03:00,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:03:00,118 INFO L87 Difference]: Start difference. First operand 3427 states and 4448 transitions. Second operand 3 states. [2019-10-22 09:03:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:00,283 INFO L93 Difference]: Finished difference Result 6506 states and 8421 transitions. [2019-10-22 09:03:00,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:03:00,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-10-22 09:03:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:00,288 INFO L225 Difference]: With dead ends: 6506 [2019-10-22 09:03:00,288 INFO L226 Difference]: Without dead ends: 2978 [2019-10-22 09:03:00,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:03:00,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-10-22 09:03:00,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2936. [2019-10-22 09:03:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2936 states. [2019-10-22 09:03:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 3773 transitions. [2019-10-22 09:03:00,356 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 3773 transitions. Word has length 197 [2019-10-22 09:03:00,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:00,357 INFO L462 AbstractCegarLoop]: Abstraction has 2936 states and 3773 transitions. [2019-10-22 09:03:00,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:03:00,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 3773 transitions. [2019-10-22 09:03:00,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-10-22 09:03:00,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:00,359 INFO L380 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-10-22 09:03:00,359 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:03:00,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:00,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1162887835, now seen corresponding path program 1 times [2019-10-22 09:03:00,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:00,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337361476] [2019-10-22 09:03:00,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-10-22 09:03:00,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337361476] [2019-10-22 09:03:00,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:00,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:03:00,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138253998] [2019-10-22 09:03:00,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:03:00,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:00,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:03:00,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:03:00,451 INFO L87 Difference]: Start difference. First operand 2936 states and 3773 transitions. Second operand 3 states. [2019-10-22 09:03:00,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:00,613 INFO L93 Difference]: Finished difference Result 6138 states and 7862 transitions. [2019-10-22 09:03:00,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:03:00,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-10-22 09:03:00,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:00,619 INFO L225 Difference]: With dead ends: 6138 [2019-10-22 09:03:00,624 INFO L226 Difference]: Without dead ends: 3224 [2019-10-22 09:03:00,626 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:03:00,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2019-10-22 09:03:00,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 3208. [2019-10-22 09:03:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-10-22 09:03:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 4085 transitions. [2019-10-22 09:03:00,693 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 4085 transitions. Word has length 335 [2019-10-22 09:03:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:00,693 INFO L462 AbstractCegarLoop]: Abstraction has 3208 states and 4085 transitions. [2019-10-22 09:03:00,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:03:00,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 4085 transitions. [2019-10-22 09:03:00,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-10-22 09:03:00,695 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:00,696 INFO L380 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-10-22 09:03:00,696 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:03:00,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:00,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1926092110, now seen corresponding path program 1 times [2019-10-22 09:03:00,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:00,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46954678] [2019-10-22 09:03:00,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 823 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-10-22 09:03:00,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46954678] [2019-10-22 09:03:00,801 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:00,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:03:00,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969224766] [2019-10-22 09:03:00,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:03:00,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:00,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:03:00,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:03:00,802 INFO L87 Difference]: Start difference. First operand 3208 states and 4085 transitions. Second operand 3 states. [2019-10-22 09:03:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:00,974 INFO L93 Difference]: Finished difference Result 6443 states and 8197 transitions. [2019-10-22 09:03:00,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:03:00,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-10-22 09:03:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:00,979 INFO L225 Difference]: With dead ends: 6443 [2019-10-22 09:03:00,980 INFO L226 Difference]: Without dead ends: 3257 [2019-10-22 09:03:00,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:03:00,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2019-10-22 09:03:01,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 3030. [2019-10-22 09:03:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-10-22 09:03:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3851 transitions. [2019-10-22 09:03:01,052 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3851 transitions. Word has length 366 [2019-10-22 09:03:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:01,052 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3851 transitions. [2019-10-22 09:03:01,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:03:01,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3851 transitions. [2019-10-22 09:03:01,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-10-22 09:03:01,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:01,055 INFO L380 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-10-22 09:03:01,055 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 09:03:01,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1476749664, now seen corresponding path program 1 times [2019-10-22 09:03:01,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:01,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312838761] [2019-10-22 09:03:01,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-22 09:03:01,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312838761] [2019-10-22 09:03:01,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421203640] [2019-10-22 09:03:01,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/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-10-22 09:03:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:01,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:03:01,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-22 09:03:01,375 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:03:01,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 09:03:01,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105689590] [2019-10-22 09:03:01,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:01,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:01,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:01,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:01,377 INFO L87 Difference]: Start difference. First operand 3030 states and 3851 transitions. Second operand 4 states. [2019-10-22 09:03:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:01,523 INFO L93 Difference]: Finished difference Result 4189 states and 5327 transitions. [2019-10-22 09:03:01,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:01,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 399 [2019-10-22 09:03:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:01,524 INFO L225 Difference]: With dead ends: 4189 [2019-10-22 09:03:01,524 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 09:03:01,527 INFO L600 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-10-22 09:03:01,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 09:03:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 09:03:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 09:03:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:03:01,527 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 399 [2019-10-22 09:03:01,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:01,527 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:01,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:01,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:03:01,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 09:03:01,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:03:01,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 09:03:02,998 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 435 DAG size of output: 270 [2019-10-22 09:03:04,064 WARN L191 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 436 DAG size of output: 271 [2019-10-22 09:03:04,522 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2019-10-22 09:03:04,731 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-10-22 09:03:04,983 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 49 [2019-10-22 09:03:05,086 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-10-22 09:03:06,577 WARN L191 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 233 DAG size of output: 83 [2019-10-22 09:03:06,695 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-10-22 09:03:07,012 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 44 [2019-10-22 09:03:07,264 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 17 [2019-10-22 09:03:07,467 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 17 [2019-10-22 09:03:07,716 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 49 [2019-10-22 09:03:07,867 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 17 [2019-10-22 09:03:08,150 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2019-10-22 09:03:09,645 WARN L191 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 234 DAG size of output: 83 [2019-10-22 09:03:09,879 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2019-10-22 09:03:10,137 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 38 [2019-10-22 09:03:10,139 INFO L443 ceAbstractionStarter]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-10-22 09:03:10,139 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-10-22 09:03:10,139 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 592) no Hoare annotation was computed. [2019-10-22 09:03:10,139 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 603) no Hoare annotation was computed. [2019-10-22 09:03:10,139 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 614) no Hoare annotation was computed. [2019-10-22 09:03:10,139 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 625) no Hoare annotation was computed. [2019-10-22 09:03:10,139 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-10-22 09:03:10,139 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 593) 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-10-22 09:03:10,139 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 625) the Hoare annotation is: false [2019-10-22 09:03:10,139 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 505) no Hoare annotation was computed. [2019-10-22 09:03:10,139 INFO L443 ceAbstractionStarter]: For program point L501-2(lines 209 587) no Hoare annotation was computed. [2019-10-22 09:03:10,139 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-10-22 09:03:10,140 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 591) no Hoare annotation was computed. [2019-10-22 09:03:10,140 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 602) no Hoare annotation was computed. [2019-10-22 09:03:10,140 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 613) no Hoare annotation was computed. [2019-10-22 09:03:10,140 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 624) no Hoare annotation was computed. [2019-10-22 09:03:10,140 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-10-22 09:03:10,140 INFO L443 ceAbstractionStarter]: For program point L502-1(line 502) no Hoare annotation was computed. [2019-10-22 09:03:10,140 INFO L443 ceAbstractionStarter]: For program point L502-2(line 502) no Hoare annotation was computed. [2019-10-22 09:03:10,140 INFO L443 ceAbstractionStarter]: For program point L502-3(line 502) no Hoare annotation was computed. [2019-10-22 09:03:10,140 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 591) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-10-22 09:03:10,140 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 603) 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-10-22 09:03:10,140 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 614) the Hoare annotation is: (let ((.cse0 (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 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 8192)) (<= 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))))) (or (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))))) [2019-10-22 09:03:10,140 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-10-22 09:03:10,140 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-10-22 09:03:10,140 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-10-22 09:03:10,141 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-10-22 09:03:10,141 INFO L443 ceAbstractionStarter]: For program point L306-2(lines 209 587) no Hoare annotation was computed. [2019-10-22 09:03:10,141 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 601) no Hoare annotation was computed. [2019-10-22 09:03:10,141 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 612) no Hoare annotation was computed. [2019-10-22 09:03:10,141 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 623) no Hoare annotation was computed. [2019-10-22 09:03:10,141 INFO L443 ceAbstractionStarter]: For program point L571(lines 571 581) no Hoare annotation was computed. [2019-10-22 09:03:10,141 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 581) no Hoare annotation was computed. [2019-10-22 09:03:10,141 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-10-22 09:03:10,141 INFO L439 ceAbstractionStarter]: At program point L208(lines 207 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-10-22 09:03:10,141 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-10-22 09:03:10,141 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-10-22 09:03:10,141 INFO L439 ceAbstractionStarter]: 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-10-22 09:03:10,141 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-10-22 09:03:10,141 INFO L443 ceAbstractionStarter]: For program point L341-2(lines 209 587) no Hoare annotation was computed. [2019-10-22 09:03:10,141 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-10-22 09:03:10,142 INFO L446 ceAbstractionStarter]: At program point L672(lines 64 674) the Hoare annotation is: true [2019-10-22 09:03:10,142 INFO L443 ceAbstractionStarter]: For program point L639(lines 639 645) no Hoare annotation was computed. [2019-10-22 09:03:10,142 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 545) no Hoare annotation was computed. [2019-10-22 09:03:10,142 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 600) no Hoare annotation was computed. [2019-10-22 09:03:10,142 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 611) no Hoare annotation was computed. [2019-10-22 09:03:10,142 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 622) no Hoare annotation was computed. [2019-10-22 09:03:10,142 INFO L446 ceAbstractionStarter]: At program point L673(lines 9 675) the Hoare annotation is: true [2019-10-22 09:03:10,142 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 578) no Hoare annotation was computed. [2019-10-22 09:03:10,142 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-10-22 09:03:10,142 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 601) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (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-10-22 09:03:10,142 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 612) 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-10-22 09:03:10,142 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-10-22 09:03:10,142 INFO L439 ceAbstractionStarter]: At program point L212(lines 105 624) the Hoare annotation is: false [2019-10-22 09:03:10,143 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-10-22 09:03:10,143 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 599) no Hoare annotation was computed. [2019-10-22 09:03:10,143 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 610) no Hoare annotation was computed. [2019-10-22 09:03:10,143 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 621) no Hoare annotation was computed. [2019-10-22 09:03:10,143 INFO L443 ceAbstractionStarter]: For program point L511(lines 511 515) no Hoare annotation was computed. [2019-10-22 09:03:10,143 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-10-22 09:03:10,143 INFO L443 ceAbstractionStarter]: For program point L511-2(lines 511 515) no Hoare annotation was computed. [2019-10-22 09:03:10,143 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-10-22 09:03:10,143 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 64 674) no Hoare annotation was computed. [2019-10-22 09:03:10,143 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-10-22 09:03:10,143 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 598) no Hoare annotation was computed. [2019-10-22 09:03:10,143 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 609) no Hoare annotation was computed. [2019-10-22 09:03:10,143 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 620) no Hoare annotation was computed. [2019-10-22 09:03:10,144 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-10-22 09:03:10,144 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-10-22 09:03:10,144 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-10-22 09:03:10,144 INFO L443 ceAbstractionStarter]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-10-22 09:03:10,144 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-10-22 09:03:10,144 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 599) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (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-10-22 09:03:10,144 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 610) 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-10-22 09:03:10,144 INFO L443 ceAbstractionStarter]: For program point L217-2(lines 209 587) no Hoare annotation was computed. [2019-10-22 09:03:10,144 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 09:03:10,145 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-10-22 09:03:10,145 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 597) no Hoare annotation was computed. [2019-10-22 09:03:10,145 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 608) no Hoare annotation was computed. [2019-10-22 09:03:10,145 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 619) no Hoare annotation was computed. [2019-10-22 09:03:10,145 INFO L443 ceAbstractionStarter]: For program point L550(lines 550 554) no Hoare annotation was computed. [2019-10-22 09:03:10,145 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-10-22 09:03:10,145 INFO L443 ceAbstractionStarter]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-10-22 09:03:10,145 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 620) the Hoare annotation is: false [2019-10-22 09:03:10,145 INFO L439 ceAbstractionStarter]: At program point L551(lines 64 674) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-10-22 09:03:10,145 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-10-22 09:03:10,145 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-10-22 09:03:10,145 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-10-22 09:03:10,146 INFO L443 ceAbstractionStarter]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-10-22 09:03:10,146 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 596) no Hoare annotation was computed. [2019-10-22 09:03:10,146 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 607) no Hoare annotation was computed. [2019-10-22 09:03:10,146 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 618) no Hoare annotation was computed. [2019-10-22 09:03:10,146 INFO L446 ceAbstractionStarter]: At program point L685(lines 676 687) the Hoare annotation is: true [2019-10-22 09:03:10,147 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-10-22 09:03:10,147 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-10-22 09:03:10,147 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 09:03:10,147 INFO L443 ceAbstractionStarter]: For program point L289-2(lines 209 587) no Hoare annotation was computed. [2019-10-22 09:03:10,147 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 597) the Hoare annotation is: (let ((.cse1 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)))) (.cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (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) .cse0) (and .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (and .cse1 .cse0))) [2019-10-22 09:03:10,147 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 608) 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-10-22 09:03:10,147 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 618) the Hoare annotation is: (and (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 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 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-10-22 09:03:10,147 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 526) no Hoare annotation was computed. [2019-10-22 09:03:10,147 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-10-22 09:03:10,148 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-10-22 09:03:10,148 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-10-22 09:03:10,148 INFO L439 ceAbstractionStarter]: At program point L588(lines 99 656) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse7 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse4 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse5) (and .cse6 .cse7 .cse1 .cse2 .cse5 .cse8) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse1 .cse5 .cse20)) (and .cse2 (and .cse17 .cse1 .cse5)) (and .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse8) (and .cse0 .cse9 .cse13 .cse14 .cse16 .cse1 .cse11 .cse17 .cse19 .cse21 .cse5 .cse20 .cse8) (and (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse10 .cse12 .cse15 .cse18) .cse6) (and .cse0 .cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse21 .cse4))) [2019-10-22 09:03:10,148 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 559) no Hoare annotation was computed. [2019-10-22 09:03:10,148 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-10-22 09:03:10,148 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-10-22 09:03:10,148 INFO L443 ceAbstractionStarter]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-10-22 09:03:10,148 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 595) no Hoare annotation was computed. [2019-10-22 09:03:10,149 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 606) no Hoare annotation was computed. [2019-10-22 09:03:10,149 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 617) no Hoare annotation was computed. [2019-10-22 09:03:10,149 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-10-22 09:03:10,149 INFO L443 ceAbstractionStarter]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-10-22 09:03:10,149 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 09:03:10,149 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-10-22 09:03:10,149 INFO L446 ceAbstractionStarter]: At program point L657(lines 98 658) the Hoare annotation is: true [2019-10-22 09:03:10,149 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 594) no Hoare annotation was computed. [2019-10-22 09:03:10,149 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 605) no Hoare annotation was computed. [2019-10-22 09:03:10,149 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 616) no Hoare annotation was computed. [2019-10-22 09:03:10,149 INFO L443 ceAbstractionStarter]: For program point L262(line 262) no Hoare annotation was computed. [2019-10-22 09:03:10,149 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-10-22 09:03:10,149 INFO L443 ceAbstractionStarter]: For program point L262-1(line 262) no Hoare annotation was computed. [2019-10-22 09:03:10,150 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 595) the Hoare annotation is: (let ((.cse5 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse7 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (and (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5)) (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse6 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse4))) [2019-10-22 09:03:10,150 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 606) 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-10-22 09:03:10,150 INFO L443 ceAbstractionStarter]: For program point L229-2(lines 209 587) no Hoare annotation was computed. [2019-10-22 09:03:10,150 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 654) no Hoare annotation was computed. [2019-10-22 09:03:10,150 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-10-22 09:03:10,150 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 651) no Hoare annotation was computed. [2019-10-22 09:03:10,150 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 565) no Hoare annotation was computed. [2019-10-22 09:03:10,150 INFO L443 ceAbstractionStarter]: For program point L528(lines 528 532) no Hoare annotation was computed. [2019-10-22 09:03:10,150 INFO L443 ceAbstractionStarter]: For program point L561-2(lines 561 565) no Hoare annotation was computed. [2019-10-22 09:03:10,151 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-10-22 09:03:10,151 INFO L443 ceAbstractionStarter]: For program point L528-2(lines 209 587) no Hoare annotation was computed. [2019-10-22 09:03:10,151 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-10-22 09:03:10,151 INFO L439 ceAbstractionStarter]: 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-10-22 09:03:10,151 INFO L443 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-10-22 09:03:10,151 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-10-22 09:03:10,151 INFO L443 ceAbstractionStarter]: For program point L264-1(line 264) no Hoare annotation was computed. [2019-10-22 09:03:10,151 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 593) no Hoare annotation was computed. [2019-10-22 09:03:10,151 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 604) no Hoare annotation was computed. [2019-10-22 09:03:10,151 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 615) no Hoare annotation was computed. [2019-10-22 09:03:10,152 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 656) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse7 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse4 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse5) (and .cse6 .cse7 .cse1 .cse2 .cse5 .cse8) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse1 .cse5 .cse20)) (and .cse2 (and .cse17 .cse1 .cse5)) (and .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse8) (and .cse0 .cse9 .cse13 .cse14 .cse16 .cse1 .cse11 .cse17 .cse19 .cse21 .cse5 .cse20 .cse8) (and (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse10 .cse12 .cse15 .cse18) .cse6) (and .cse0 .cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse21 .cse4))) [2019-10-22 09:03:10,152 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 665) no Hoare annotation was computed. [2019-10-22 09:03:10,152 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 637) no Hoare annotation was computed. [2019-10-22 09:03:10,152 INFO L443 ceAbstractionStarter]: For program point L661-2(lines 661 665) no Hoare annotation was computed. [2019-10-22 09:03:10,152 INFO L443 ceAbstractionStarter]: For program point L628-2(lines 627 649) no Hoare annotation was computed. [2019-10-22 09:03:10,152 INFO L439 ceAbstractionStarter]: 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-10-22 09:03:10,152 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 604) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse2) (and .cse3 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse3 .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2))) [2019-10-22 09:03:10,153 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 617) 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 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 8192))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.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 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2019-10-22 09:03:10,153 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-22 09:03:10,153 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-10-22 09:03:10,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:03:10 BoogieIcfgContainer [2019-10-22 09:03:10,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:03:10,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:03:10,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:03:10,179 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:03:10,179 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:46" (3/4) ... [2019-10-22 09:03:10,182 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 09:03:10,195 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 09:03:10,196 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 09:03:10,278 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_85b87521-cef5-465a-a654-0a42eeec463f/bin/uautomizer/witness.graphml [2019-10-22 09:03:10,278 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:03:10,280 INFO L168 Benchmark]: Toolchain (without parser) took 24476.55 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 969.4 MB). Free memory was 940.6 MB in the beginning and 1.6 GB in the end (delta: -642.2 MB). Peak memory consumption was 327.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:10,280 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:10,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:10,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:10,281 INFO L168 Benchmark]: Boogie Preprocessor took 33.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:10,281 INFO L168 Benchmark]: RCFGBuilder took 641.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:10,281 INFO L168 Benchmark]: TraceAbstraction took 23236.35 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 843.1 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -569.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-10-22 09:03:10,281 INFO L168 Benchmark]: Witness Printer took 99.94 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:10,283 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 415.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 641.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23236.35 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 843.1 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -569.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 99.94 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 502]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 502]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 502]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 502]: 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 - 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 == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195)) || (((((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || ((((blastFlag <= 3 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 3) && !(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__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: 99]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195)) || ((((blastFlag <= 3 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8195))) || (((((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || (!(s__state == 8576) && ((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8195)) && !(s__state == 8480))) || (s__state <= 8448 && (!(s__state == 8448) && !(s__state == 8192)) && !(s__state == 8195))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((8672 <= s__state && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && blastFlag <= 3)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0) - 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: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit)) || (((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 16384)) && !(s__state == 8576))) || (((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 16384)) && !(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: 180]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8576)) && s__state <= 8640) && 8576 <= s__state) || (((blastFlag <= 2 && s__state <= 8640) && 8576 <= s__state) && !(0 == s__hit)) - 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: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8576)) && s__state <= 8640) && 8576 <= s__state) || (((blastFlag <= 2 && s__state <= 8640) && 8576 <= s__state) && !(0 == s__hit)) - 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 == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((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)) && !(s__state == 8576)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195)) || ((((blastFlag <= 3 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8195))) || (((((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || (!(s__state == 8576) && ((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8195)) && !(s__state == 8480))) || (s__state <= 8448 && (!(s__state == 8448) && !(s__state == 8192)) && !(s__state == 8195))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((8672 <= s__state && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && blastFlag <= 3)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - 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 <= 3 && ((((!(s__state == 8672) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && !(0 == s__hit)) && 8640 <= s__state) || (((((((blastFlag <= 2 && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && !(0 == s__hit))) || (((((((blastFlag <= 2 && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 16384)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 8 error locations. Result: SAFE, OverallTime: 23.1s, OverallIterations: 39, TraceHistogramMax: 14, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.4s, HoareTripleCheckerStatistics: 6928 SDtfs, 5885 SDslu, 3640 SDs, 0 SdLazy, 4372 SolverSat, 1144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1986 GetRequests, 1934 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4935occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 39 MinimizatonAttempts, 5661 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 264 NumberOfFragments, 1652 HoareAnnotationTreeSize, 29 FomulaSimplifications, 333708 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 29 FomulaSimplificationsInter, 71654 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 5670 NumberOfCodeBlocks, 5670 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 5627 ConstructedInterpolants, 0 QuantifiedInterpolants, 1665978 SizeOfPredicates, 13 NumberOfNonLiveVariables, 3554 ConjunctsInSsa, 37 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...