./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/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-678e011 [2019-11-20 01:07:33,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:07:33,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:07:33,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:07:33,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:07:33,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:07:33,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:07:33,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:07:33,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:07:33,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:07:33,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:07:33,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:07:33,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:07:33,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:07:33,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:07:33,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:07:33,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:07:33,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:07:33,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:07:33,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:07:33,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:07:33,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:07:33,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:07:33,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:07:33,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:07:33,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:07:33,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:07:33,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:07:33,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:07:33,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:07:33,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:07:33,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:07:33,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:07:33,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:07:33,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:07:33,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:07:33,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:07:33,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:07:33,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:07:33,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:07:33,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:07:33,880 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-20 01:07:33,895 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:07:33,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:07:33,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:07:33,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:07:33,897 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:07:33,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:07:33,898 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:07:33,898 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 01:07:33,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:07:33,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:07:33,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:07:33,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:07:33,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:07:33,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:07:33,900 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-20 01:07:33,900 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:07:33,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:07:33,901 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:07:33,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:07:33,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:07:33,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:07:33,902 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:07:33,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:07:33,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:07:33,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:07:33,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:07:33,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:07:33,904 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:07:33,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:07:33,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:07:33,905 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/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-11-20 01:07:34,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:07:34,127 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:07:34,131 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:07:34,133 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:07:34,133 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:07:34,134 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-11-20 01:07:34,192 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/data/f6170c0c0/4d9a153e7add4aea8e7605e803bbeebb/FLAG5f4330929 [2019-11-20 01:07:34,731 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:07:34,731 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-11-20 01:07:34,748 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/data/f6170c0c0/4d9a153e7add4aea8e7605e803bbeebb/FLAG5f4330929 [2019-11-20 01:07:35,003 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/data/f6170c0c0/4d9a153e7add4aea8e7605e803bbeebb [2019-11-20 01:07:35,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:07:35,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:07:35,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:07:35,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:07:35,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:07:35,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:07:35" (1/1) ... [2019-11-20 01:07:35,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a606d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:35, skipping insertion in model container [2019-11-20 01:07:35,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:07:35" (1/1) ... [2019-11-20 01:07:35,033 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:07:35,090 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:07:35,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:07:35,475 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:07:35,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:07:35,578 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:07:35,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:35 WrapperNode [2019-11-20 01:07:35,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:07:35,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:07:35,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:07:35,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:07:35,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:35" (1/1) ... [2019-11-20 01:07:35,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:35" (1/1) ... [2019-11-20 01:07:35,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:07:35,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:07:35,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:07:35,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:07:35,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:35" (1/1) ... [2019-11-20 01:07:35,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:35" (1/1) ... [2019-11-20 01:07:35,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:35" (1/1) ... [2019-11-20 01:07:35,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:35" (1/1) ... [2019-11-20 01:07:35,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:35" (1/1) ... [2019-11-20 01:07:35,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:35" (1/1) ... [2019-11-20 01:07:35,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:35" (1/1) ... [2019-11-20 01:07:35,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:07:35,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:07:35,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:07:35,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:07:35,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:07:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:07:35,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:07:36,083 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 01:07:36,898 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-20 01:07:36,899 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-20 01:07:36,901 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:07:36,901 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 01:07:36,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:07:36 BoogieIcfgContainer [2019-11-20 01:07:36,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:07:36,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:07:36,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:07:36,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:07:36,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:07:35" (1/3) ... [2019-11-20 01:07:36,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fb5fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:07:36, skipping insertion in model container [2019-11-20 01:07:36,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:35" (2/3) ... [2019-11-20 01:07:36,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fb5fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:07:36, skipping insertion in model container [2019-11-20 01:07:36,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:07:36" (3/3) ... [2019-11-20 01:07:36,912 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2019-11-20 01:07:36,924 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:07:36,932 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-20 01:07:36,945 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-20 01:07:36,975 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:07:36,976 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:07:36,976 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:07:36,976 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:07:36,976 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:07:36,977 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:07:36,977 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:07:36,977 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:07:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-20 01:07:37,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 01:07:37,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:37,010 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:37,011 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:37,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:37,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1287811732, now seen corresponding path program 1 times [2019-11-20 01:07:37,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:37,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637414237] [2019-11-20 01:07:37,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:37,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637414237] [2019-11-20 01:07:37,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:37,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:37,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739026075] [2019-11-20 01:07:37,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:37,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:37,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:37,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:37,275 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-11-20 01:07:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:37,620 INFO L93 Difference]: Finished difference Result 323 states and 532 transitions. [2019-11-20 01:07:37,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:37,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-20 01:07:37,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:37,643 INFO L225 Difference]: With dead ends: 323 [2019-11-20 01:07:37,644 INFO L226 Difference]: Without dead ends: 155 [2019-11-20 01:07:37,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-20 01:07:37,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-20 01:07:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-20 01:07:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 230 transitions. [2019-11-20 01:07:37,731 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 230 transitions. Word has length 16 [2019-11-20 01:07:37,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:37,731 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 230 transitions. [2019-11-20 01:07:37,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 230 transitions. [2019-11-20 01:07:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 01:07:37,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:37,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:37,734 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:37,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:37,735 INFO L82 PathProgramCache]: Analyzing trace with hash 664085130, now seen corresponding path program 1 times [2019-11-20 01:07:37,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:37,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421417048] [2019-11-20 01:07:37,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:37,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421417048] [2019-11-20 01:07:37,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:37,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:37,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525518157] [2019-11-20 01:07:37,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:37,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:37,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:37,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:37,806 INFO L87 Difference]: Start difference. First operand 155 states and 230 transitions. Second operand 3 states. [2019-11-20 01:07:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:38,034 INFO L93 Difference]: Finished difference Result 313 states and 462 transitions. [2019-11-20 01:07:38,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:38,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-20 01:07:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:38,037 INFO L225 Difference]: With dead ends: 313 [2019-11-20 01:07:38,037 INFO L226 Difference]: Without dead ends: 165 [2019-11-20 01:07:38,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-20 01:07:38,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 156. [2019-11-20 01:07:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-20 01:07:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 231 transitions. [2019-11-20 01:07:38,056 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 231 transitions. Word has length 17 [2019-11-20 01:07:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:38,057 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 231 transitions. [2019-11-20 01:07:38,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 231 transitions. [2019-11-20 01:07:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 01:07:38,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:38,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:38,059 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:38,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:38,060 INFO L82 PathProgramCache]: Analyzing trace with hash 37329238, now seen corresponding path program 1 times [2019-11-20 01:07:38,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:38,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603453323] [2019-11-20 01:07:38,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:38,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603453323] [2019-11-20 01:07:38,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:38,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:38,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042257432] [2019-11-20 01:07:38,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:38,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:38,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:38,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:38,113 INFO L87 Difference]: Start difference. First operand 156 states and 231 transitions. Second operand 3 states. [2019-11-20 01:07:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:38,314 INFO L93 Difference]: Finished difference Result 315 states and 464 transitions. [2019-11-20 01:07:38,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:38,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-20 01:07:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:38,317 INFO L225 Difference]: With dead ends: 315 [2019-11-20 01:07:38,317 INFO L226 Difference]: Without dead ends: 166 [2019-11-20 01:07:38,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-20 01:07:38,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2019-11-20 01:07:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-20 01:07:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2019-11-20 01:07:38,336 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 18 [2019-11-20 01:07:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:38,336 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2019-11-20 01:07:38,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2019-11-20 01:07:38,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 01:07:38,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:38,338 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:38,339 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:38,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:38,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1635395343, now seen corresponding path program 1 times [2019-11-20 01:07:38,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:38,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650068831] [2019-11-20 01:07:38,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:38,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650068831] [2019-11-20 01:07:38,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:38,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:38,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049451972] [2019-11-20 01:07:38,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:38,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:38,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:38,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:38,414 INFO L87 Difference]: Start difference. First operand 157 states and 232 transitions. Second operand 3 states. [2019-11-20 01:07:38,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:38,633 INFO L93 Difference]: Finished difference Result 317 states and 466 transitions. [2019-11-20 01:07:38,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:38,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 01:07:38,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:38,636 INFO L225 Difference]: With dead ends: 317 [2019-11-20 01:07:38,636 INFO L226 Difference]: Without dead ends: 167 [2019-11-20 01:07:38,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:38,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-20 01:07:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2019-11-20 01:07:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-20 01:07:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 233 transitions. [2019-11-20 01:07:38,667 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 233 transitions. Word has length 19 [2019-11-20 01:07:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:38,668 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 233 transitions. [2019-11-20 01:07:38,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 233 transitions. [2019-11-20 01:07:38,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 01:07:38,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:38,670 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:38,670 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:38,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:38,671 INFO L82 PathProgramCache]: Analyzing trace with hash -811500677, now seen corresponding path program 1 times [2019-11-20 01:07:38,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:38,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998204394] [2019-11-20 01:07:38,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:38,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998204394] [2019-11-20 01:07:38,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:38,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:38,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754279011] [2019-11-20 01:07:38,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:38,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:38,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:38,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:38,770 INFO L87 Difference]: Start difference. First operand 158 states and 233 transitions. Second operand 3 states. [2019-11-20 01:07:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:38,981 INFO L93 Difference]: Finished difference Result 319 states and 468 transitions. [2019-11-20 01:07:38,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:38,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-20 01:07:38,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:38,983 INFO L225 Difference]: With dead ends: 319 [2019-11-20 01:07:38,984 INFO L226 Difference]: Without dead ends: 168 [2019-11-20 01:07:38,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-20 01:07:38,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2019-11-20 01:07:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-20 01:07:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 234 transitions. [2019-11-20 01:07:38,997 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 234 transitions. Word has length 20 [2019-11-20 01:07:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:38,998 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 234 transitions. [2019-11-20 01:07:38,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 234 transitions. [2019-11-20 01:07:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 01:07:39,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:39,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:39,002 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:39,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1579118521, now seen corresponding path program 1 times [2019-11-20 01:07:39,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:39,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210460037] [2019-11-20 01:07:39,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:39,030 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 01:07:39,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1299383690] [2019-11-20 01:07:39,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:39,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:07:39,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:07:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:39,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210460037] [2019-11-20 01:07:39,178 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 01:07:39,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299383690] [2019-11-20 01:07:39,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:39,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:39,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295858969] [2019-11-20 01:07:39,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:39,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:39,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:39,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:39,181 INFO L87 Difference]: Start difference. First operand 159 states and 234 transitions. Second operand 3 states. [2019-11-20 01:07:39,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:39,238 INFO L93 Difference]: Finished difference Result 455 states and 672 transitions. [2019-11-20 01:07:39,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:39,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-20 01:07:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:39,242 INFO L225 Difference]: With dead ends: 455 [2019-11-20 01:07:39,242 INFO L226 Difference]: Without dead ends: 303 [2019-11-20 01:07:39,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:39,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-20 01:07:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2019-11-20 01:07:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-11-20 01:07:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 446 transitions. [2019-11-20 01:07:39,263 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 446 transitions. Word has length 39 [2019-11-20 01:07:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:39,263 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 446 transitions. [2019-11-20 01:07:39,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 446 transitions. [2019-11-20 01:07:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 01:07:39,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:39,267 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:39,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:39,471 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:39,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:39,472 INFO L82 PathProgramCache]: Analyzing trace with hash 643824433, now seen corresponding path program 1 times [2019-11-20 01:07:39,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:39,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803661274] [2019-11-20 01:07:39,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:39,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803661274] [2019-11-20 01:07:39,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:39,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:39,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131950764] [2019-11-20 01:07:39,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:39,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:39,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:39,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:39,561 INFO L87 Difference]: Start difference. First operand 299 states and 446 transitions. Second operand 3 states. [2019-11-20 01:07:39,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:39,809 INFO L93 Difference]: Finished difference Result 653 states and 987 transitions. [2019-11-20 01:07:39,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:39,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-20 01:07:39,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:39,815 INFO L225 Difference]: With dead ends: 653 [2019-11-20 01:07:39,815 INFO L226 Difference]: Without dead ends: 361 [2019-11-20 01:07:39,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-20 01:07:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2019-11-20 01:07:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-20 01:07:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 550 transitions. [2019-11-20 01:07:39,850 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 550 transitions. Word has length 44 [2019-11-20 01:07:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:39,851 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 550 transitions. [2019-11-20 01:07:39,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 550 transitions. [2019-11-20 01:07:39,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-20 01:07:39,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:39,855 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:39,856 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:39,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:39,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1369957728, now seen corresponding path program 1 times [2019-11-20 01:07:39,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:39,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386734875] [2019-11-20 01:07:39,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:39,873 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 01:07:39,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [260679882] [2019-11-20 01:07:39,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:39,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:07:39,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:07:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:39,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386734875] [2019-11-20 01:07:39,991 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 01:07:39,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260679882] [2019-11-20 01:07:39,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:39,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:07:39,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123680549] [2019-11-20 01:07:39,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:39,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:39,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:39,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:39,995 INFO L87 Difference]: Start difference. First operand 361 states and 550 transitions. Second operand 3 states. [2019-11-20 01:07:40,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:40,089 INFO L93 Difference]: Finished difference Result 719 states and 1092 transitions. [2019-11-20 01:07:40,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:40,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-20 01:07:40,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:40,095 INFO L225 Difference]: With dead ends: 719 [2019-11-20 01:07:40,095 INFO L226 Difference]: Without dead ends: 536 [2019-11-20 01:07:40,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:40,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-20 01:07:40,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 532. [2019-11-20 01:07:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-20 01:07:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 815 transitions. [2019-11-20 01:07:40,124 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 815 transitions. Word has length 55 [2019-11-20 01:07:40,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:40,125 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 815 transitions. [2019-11-20 01:07:40,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:40,126 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 815 transitions. [2019-11-20 01:07:40,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:07:40,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:40,128 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:40,332 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:40,333 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:40,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1405602907, now seen corresponding path program 1 times [2019-11-20 01:07:40,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:40,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14434344] [2019-11-20 01:07:40,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:07:40,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14434344] [2019-11-20 01:07:40,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:40,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:40,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061992013] [2019-11-20 01:07:40,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:40,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:40,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:40,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:40,380 INFO L87 Difference]: Start difference. First operand 532 states and 815 transitions. Second operand 3 states. [2019-11-20 01:07:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:40,574 INFO L93 Difference]: Finished difference Result 1111 states and 1694 transitions. [2019-11-20 01:07:40,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:40,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-20 01:07:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:40,580 INFO L225 Difference]: With dead ends: 1111 [2019-11-20 01:07:40,580 INFO L226 Difference]: Without dead ends: 586 [2019-11-20 01:07:40,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-20 01:07:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 580. [2019-11-20 01:07:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-11-20 01:07:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 878 transitions. [2019-11-20 01:07:40,609 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 878 transitions. Word has length 56 [2019-11-20 01:07:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:40,609 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 878 transitions. [2019-11-20 01:07:40,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 878 transitions. [2019-11-20 01:07:40,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 01:07:40,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:40,611 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:40,612 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:40,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:40,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2147424561, now seen corresponding path program 1 times [2019-11-20 01:07:40,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:40,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847799116] [2019-11-20 01:07:40,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:07:40,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847799116] [2019-11-20 01:07:40,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:40,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:40,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116800609] [2019-11-20 01:07:40,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:40,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:40,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:40,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:40,660 INFO L87 Difference]: Start difference. First operand 580 states and 878 transitions. Second operand 3 states. [2019-11-20 01:07:40,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:40,864 INFO L93 Difference]: Finished difference Result 1162 states and 1757 transitions. [2019-11-20 01:07:40,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:40,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-20 01:07:40,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:40,870 INFO L225 Difference]: With dead ends: 1162 [2019-11-20 01:07:40,870 INFO L226 Difference]: Without dead ends: 589 [2019-11-20 01:07:40,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-11-20 01:07:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 583. [2019-11-20 01:07:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-11-20 01:07:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 878 transitions. [2019-11-20 01:07:40,900 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 878 transitions. Word has length 57 [2019-11-20 01:07:40,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:40,900 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 878 transitions. [2019-11-20 01:07:40,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:40,901 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 878 transitions. [2019-11-20 01:07:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-20 01:07:40,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:40,903 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:40,904 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:40,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:40,904 INFO L82 PathProgramCache]: Analyzing trace with hash -216125576, now seen corresponding path program 1 times [2019-11-20 01:07:40,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:40,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295010505] [2019-11-20 01:07:40,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:07:40,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295010505] [2019-11-20 01:07:40,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:40,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:40,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749245323] [2019-11-20 01:07:40,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:40,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:40,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:40,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:40,975 INFO L87 Difference]: Start difference. First operand 583 states and 878 transitions. Second operand 3 states. [2019-11-20 01:07:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:41,213 INFO L93 Difference]: Finished difference Result 1291 states and 1970 transitions. [2019-11-20 01:07:41,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:41,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-20 01:07:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:41,220 INFO L225 Difference]: With dead ends: 1291 [2019-11-20 01:07:41,220 INFO L226 Difference]: Without dead ends: 715 [2019-11-20 01:07:41,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:41,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-11-20 01:07:41,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 709. [2019-11-20 01:07:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-11-20 01:07:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1091 transitions. [2019-11-20 01:07:41,258 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1091 transitions. Word has length 70 [2019-11-20 01:07:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:41,258 INFO L462 AbstractCegarLoop]: Abstraction has 709 states and 1091 transitions. [2019-11-20 01:07:41,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:41,259 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1091 transitions. [2019-11-20 01:07:41,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 01:07:41,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:41,261 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:41,261 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:41,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:41,262 INFO L82 PathProgramCache]: Analyzing trace with hash 380295080, now seen corresponding path program 1 times [2019-11-20 01:07:41,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:41,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627299728] [2019-11-20 01:07:41,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:07:41,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627299728] [2019-11-20 01:07:41,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:41,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:41,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156504869] [2019-11-20 01:07:41,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:41,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:41,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:41,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:41,338 INFO L87 Difference]: Start difference. First operand 709 states and 1091 transitions. Second operand 3 states. [2019-11-20 01:07:41,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:41,566 INFO L93 Difference]: Finished difference Result 1513 states and 2336 transitions. [2019-11-20 01:07:41,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:41,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-20 01:07:41,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:41,574 INFO L225 Difference]: With dead ends: 1513 [2019-11-20 01:07:41,574 INFO L226 Difference]: Without dead ends: 811 [2019-11-20 01:07:41,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:41,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-11-20 01:07:41,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 790. [2019-11-20 01:07:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-20 01:07:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1211 transitions. [2019-11-20 01:07:41,618 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1211 transitions. Word has length 71 [2019-11-20 01:07:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:41,618 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1211 transitions. [2019-11-20 01:07:41,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1211 transitions. [2019-11-20 01:07:41,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 01:07:41,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:41,621 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:41,621 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:41,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:41,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1769518732, now seen corresponding path program 1 times [2019-11-20 01:07:41,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:41,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830993222] [2019-11-20 01:07:41,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:07:41,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830993222] [2019-11-20 01:07:41,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:41,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:41,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596179640] [2019-11-20 01:07:41,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:41,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:41,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:41,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:41,667 INFO L87 Difference]: Start difference. First operand 790 states and 1211 transitions. Second operand 3 states. [2019-11-20 01:07:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:41,923 INFO L93 Difference]: Finished difference Result 1582 states and 2423 transitions. [2019-11-20 01:07:41,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:41,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-20 01:07:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:41,930 INFO L225 Difference]: With dead ends: 1582 [2019-11-20 01:07:41,930 INFO L226 Difference]: Without dead ends: 799 [2019-11-20 01:07:41,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-11-20 01:07:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 793. [2019-11-20 01:07:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-11-20 01:07:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1211 transitions. [2019-11-20 01:07:41,971 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1211 transitions. Word has length 71 [2019-11-20 01:07:41,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:41,973 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1211 transitions. [2019-11-20 01:07:41,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1211 transitions. [2019-11-20 01:07:41,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 01:07:41,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:41,975 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:41,976 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:41,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:41,976 INFO L82 PathProgramCache]: Analyzing trace with hash -953703820, now seen corresponding path program 1 times [2019-11-20 01:07:41,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:41,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083654623] [2019-11-20 01:07:41,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:07:42,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083654623] [2019-11-20 01:07:42,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:42,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:42,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799294483] [2019-11-20 01:07:42,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:42,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:42,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:42,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:42,021 INFO L87 Difference]: Start difference. First operand 793 states and 1211 transitions. Second operand 3 states. [2019-11-20 01:07:42,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:42,276 INFO L93 Difference]: Finished difference Result 1600 states and 2447 transitions. [2019-11-20 01:07:42,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:42,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-20 01:07:42,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:42,284 INFO L225 Difference]: With dead ends: 1600 [2019-11-20 01:07:42,284 INFO L226 Difference]: Without dead ends: 814 [2019-11-20 01:07:42,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:42,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-11-20 01:07:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 793. [2019-11-20 01:07:42,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-11-20 01:07:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1202 transitions. [2019-11-20 01:07:42,332 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1202 transitions. Word has length 72 [2019-11-20 01:07:42,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:42,332 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1202 transitions. [2019-11-20 01:07:42,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1202 transitions. [2019-11-20 01:07:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 01:07:42,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:42,339 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:42,340 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:42,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:42,340 INFO L82 PathProgramCache]: Analyzing trace with hash -816065300, now seen corresponding path program 1 times [2019-11-20 01:07:42,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:42,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453022924] [2019-11-20 01:07:42,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:42,354 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 01:07:42,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1501723555] [2019-11-20 01:07:42,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:42,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:07:42,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:07:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:07:42,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453022924] [2019-11-20 01:07:42,486 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 01:07:42,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501723555] [2019-11-20 01:07:42,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:42,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:07:42,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381289113] [2019-11-20 01:07:42,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:42,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:42,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:42,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:42,489 INFO L87 Difference]: Start difference. First operand 793 states and 1202 transitions. Second operand 3 states. [2019-11-20 01:07:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:42,580 INFO L93 Difference]: Finished difference Result 1583 states and 2396 transitions. [2019-11-20 01:07:42,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:42,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-11-20 01:07:42,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:42,589 INFO L225 Difference]: With dead ends: 1583 [2019-11-20 01:07:42,589 INFO L226 Difference]: Without dead ends: 1055 [2019-11-20 01:07:42,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:42,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-11-20 01:07:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1051. [2019-11-20 01:07:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-11-20 01:07:42,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1597 transitions. [2019-11-20 01:07:42,660 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1597 transitions. Word has length 76 [2019-11-20 01:07:42,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:42,661 INFO L462 AbstractCegarLoop]: Abstraction has 1051 states and 1597 transitions. [2019-11-20 01:07:42,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:42,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1597 transitions. [2019-11-20 01:07:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 01:07:42,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:42,664 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:42,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:42,870 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:42,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:42,870 INFO L82 PathProgramCache]: Analyzing trace with hash -174298828, now seen corresponding path program 1 times [2019-11-20 01:07:42,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:42,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036085746] [2019-11-20 01:07:42,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:42,951 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:07:42,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036085746] [2019-11-20 01:07:42,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:42,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:42,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305327283] [2019-11-20 01:07:42,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:42,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:42,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:42,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:42,957 INFO L87 Difference]: Start difference. First operand 1051 states and 1597 transitions. Second operand 3 states. [2019-11-20 01:07:43,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:43,252 INFO L93 Difference]: Finished difference Result 2279 states and 3475 transitions. [2019-11-20 01:07:43,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:43,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-20 01:07:43,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:43,263 INFO L225 Difference]: With dead ends: 2279 [2019-11-20 01:07:43,263 INFO L226 Difference]: Without dead ends: 1235 [2019-11-20 01:07:43,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:43,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-11-20 01:07:43,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1223. [2019-11-20 01:07:43,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-11-20 01:07:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1873 transitions. [2019-11-20 01:07:43,320 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1873 transitions. Word has length 86 [2019-11-20 01:07:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:43,320 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1873 transitions. [2019-11-20 01:07:43,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1873 transitions. [2019-11-20 01:07:43,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 01:07:43,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:43,323 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:43,324 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:43,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:43,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1676680243, now seen corresponding path program 1 times [2019-11-20 01:07:43,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:43,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761255044] [2019-11-20 01:07:43,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:07:43,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761255044] [2019-11-20 01:07:43,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:43,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:43,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211020794] [2019-11-20 01:07:43,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:43,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:43,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:43,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:43,372 INFO L87 Difference]: Start difference. First operand 1223 states and 1873 transitions. Second operand 3 states. [2019-11-20 01:07:43,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:43,643 INFO L93 Difference]: Finished difference Result 2499 states and 3839 transitions. [2019-11-20 01:07:43,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:43,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-11-20 01:07:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:43,653 INFO L225 Difference]: With dead ends: 2499 [2019-11-20 01:07:43,654 INFO L226 Difference]: Without dead ends: 1275 [2019-11-20 01:07:43,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-11-20 01:07:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1263. [2019-11-20 01:07:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-11-20 01:07:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1949 transitions. [2019-11-20 01:07:43,711 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1949 transitions. Word has length 87 [2019-11-20 01:07:43,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:43,711 INFO L462 AbstractCegarLoop]: Abstraction has 1263 states and 1949 transitions. [2019-11-20 01:07:43,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1949 transitions. [2019-11-20 01:07:43,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 01:07:43,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:43,714 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:43,715 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:43,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:43,715 INFO L82 PathProgramCache]: Analyzing trace with hash 538835484, now seen corresponding path program 1 times [2019-11-20 01:07:43,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:43,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687069702] [2019-11-20 01:07:43,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 01:07:43,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687069702] [2019-11-20 01:07:43,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:43,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:43,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320129908] [2019-11-20 01:07:43,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:43,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:43,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:43,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:43,758 INFO L87 Difference]: Start difference. First operand 1263 states and 1949 transitions. Second operand 3 states. [2019-11-20 01:07:43,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:43,985 INFO L93 Difference]: Finished difference Result 2667 states and 4123 transitions. [2019-11-20 01:07:43,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:43,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-20 01:07:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:43,996 INFO L225 Difference]: With dead ends: 2667 [2019-11-20 01:07:43,997 INFO L226 Difference]: Without dead ends: 1411 [2019-11-20 01:07:43,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:44,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-11-20 01:07:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-11-20 01:07:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-20 01:07:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2085 transitions. [2019-11-20 01:07:44,058 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2085 transitions. Word has length 97 [2019-11-20 01:07:44,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:44,058 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2085 transitions. [2019-11-20 01:07:44,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2085 transitions. [2019-11-20 01:07:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 01:07:44,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:44,062 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:44,062 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:44,063 INFO L82 PathProgramCache]: Analyzing trace with hash 704331080, now seen corresponding path program 1 times [2019-11-20 01:07:44,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:44,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085174050] [2019-11-20 01:07:44,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 01:07:44,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085174050] [2019-11-20 01:07:44,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:44,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:44,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721868903] [2019-11-20 01:07:44,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:44,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:44,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:44,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:44,100 INFO L87 Difference]: Start difference. First operand 1363 states and 2085 transitions. Second operand 3 states. [2019-11-20 01:07:44,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:44,346 INFO L93 Difference]: Finished difference Result 2767 states and 4239 transitions. [2019-11-20 01:07:44,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:44,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-20 01:07:44,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:44,357 INFO L225 Difference]: With dead ends: 2767 [2019-11-20 01:07:44,357 INFO L226 Difference]: Without dead ends: 1411 [2019-11-20 01:07:44,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:44,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-11-20 01:07:44,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-11-20 01:07:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-20 01:07:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2065 transitions. [2019-11-20 01:07:44,418 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2065 transitions. Word has length 98 [2019-11-20 01:07:44,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:44,418 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2065 transitions. [2019-11-20 01:07:44,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2065 transitions. [2019-11-20 01:07:44,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 01:07:44,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:44,422 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:44,422 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:44,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:44,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1454055914, now seen corresponding path program 1 times [2019-11-20 01:07:44,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:44,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876849776] [2019-11-20 01:07:44,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:44,436 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 01:07:44,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1191541045] [2019-11-20 01:07:44,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:44,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:07:44,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:07:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-20 01:07:44,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876849776] [2019-11-20 01:07:44,568 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 01:07:44,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191541045] [2019-11-20 01:07:44,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:44,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:07:44,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502357279] [2019-11-20 01:07:44,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:44,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:44,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:44,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:44,570 INFO L87 Difference]: Start difference. First operand 1363 states and 2065 transitions. Second operand 3 states. [2019-11-20 01:07:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:44,846 INFO L93 Difference]: Finished difference Result 2755 states and 4163 transitions. [2019-11-20 01:07:44,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:44,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-20 01:07:44,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:44,857 INFO L225 Difference]: With dead ends: 2755 [2019-11-20 01:07:44,858 INFO L226 Difference]: Without dead ends: 1399 [2019-11-20 01:07:44,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:44,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-11-20 01:07:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1363. [2019-11-20 01:07:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-20 01:07:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1993 transitions. [2019-11-20 01:07:44,919 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1993 transitions. Word has length 116 [2019-11-20 01:07:44,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:44,919 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1993 transitions. [2019-11-20 01:07:44,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1993 transitions. [2019-11-20 01:07:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 01:07:44,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:44,923 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:45,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:45,136 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:45,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:45,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2083865546, now seen corresponding path program 1 times [2019-11-20 01:07:45,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:45,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969244659] [2019-11-20 01:07:45,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-20 01:07:45,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969244659] [2019-11-20 01:07:45,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:45,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:45,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398476758] [2019-11-20 01:07:45,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:45,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:45,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:45,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:45,187 INFO L87 Difference]: Start difference. First operand 1363 states and 1993 transitions. Second operand 3 states. [2019-11-20 01:07:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:45,432 INFO L93 Difference]: Finished difference Result 2827 states and 4135 transitions. [2019-11-20 01:07:45,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:45,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-20 01:07:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:45,444 INFO L225 Difference]: With dead ends: 2827 [2019-11-20 01:07:45,444 INFO L226 Difference]: Without dead ends: 1471 [2019-11-20 01:07:45,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:45,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-11-20 01:07:45,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-11-20 01:07:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-11-20 01:07:45,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2117 transitions. [2019-11-20 01:07:45,529 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2117 transitions. Word has length 117 [2019-11-20 01:07:45,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:45,569 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2117 transitions. [2019-11-20 01:07:45,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2117 transitions. [2019-11-20 01:07:45,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 01:07:45,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:45,573 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:45,574 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:45,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:45,576 INFO L82 PathProgramCache]: Analyzing trace with hash -63631274, now seen corresponding path program 1 times [2019-11-20 01:07:45,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:45,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558771047] [2019-11-20 01:07:45,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-20 01:07:45,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558771047] [2019-11-20 01:07:45,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:45,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:45,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480101097] [2019-11-20 01:07:45,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:45,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:45,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:45,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:45,624 INFO L87 Difference]: Start difference. First operand 1459 states and 2117 transitions. Second operand 3 states. [2019-11-20 01:07:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:45,851 INFO L93 Difference]: Finished difference Result 2923 states and 4239 transitions. [2019-11-20 01:07:45,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:45,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-11-20 01:07:45,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:45,862 INFO L225 Difference]: With dead ends: 2923 [2019-11-20 01:07:45,862 INFO L226 Difference]: Without dead ends: 1471 [2019-11-20 01:07:45,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:45,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-11-20 01:07:45,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-11-20 01:07:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-11-20 01:07:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2097 transitions. [2019-11-20 01:07:45,930 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2097 transitions. Word has length 118 [2019-11-20 01:07:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:45,931 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2097 transitions. [2019-11-20 01:07:45,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2097 transitions. [2019-11-20 01:07:45,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 01:07:45,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:45,935 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:45,935 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:45,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:45,937 INFO L82 PathProgramCache]: Analyzing trace with hash 365233416, now seen corresponding path program 1 times [2019-11-20 01:07:45,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:45,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311452935] [2019-11-20 01:07:45,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 01:07:45,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311452935] [2019-11-20 01:07:45,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:45,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:45,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843153701] [2019-11-20 01:07:45,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:45,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:45,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:45,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:45,990 INFO L87 Difference]: Start difference. First operand 1459 states and 2097 transitions. Second operand 3 states. [2019-11-20 01:07:46,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:46,272 INFO L93 Difference]: Finished difference Result 3091 states and 4445 transitions. [2019-11-20 01:07:46,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:46,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-11-20 01:07:46,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:46,285 INFO L225 Difference]: With dead ends: 3091 [2019-11-20 01:07:46,286 INFO L226 Difference]: Without dead ends: 1639 [2019-11-20 01:07:46,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-11-20 01:07:46,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1623. [2019-11-20 01:07:46,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-11-20 01:07:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2337 transitions. [2019-11-20 01:07:46,361 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2337 transitions. Word has length 126 [2019-11-20 01:07:46,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:46,361 INFO L462 AbstractCegarLoop]: Abstraction has 1623 states and 2337 transitions. [2019-11-20 01:07:46,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:46,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2337 transitions. [2019-11-20 01:07:46,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 01:07:46,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:46,366 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:46,366 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:46,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:46,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1493527041, now seen corresponding path program 1 times [2019-11-20 01:07:46,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:46,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673938208] [2019-11-20 01:07:46,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 01:07:46,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673938208] [2019-11-20 01:07:46,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:46,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:46,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301861869] [2019-11-20 01:07:46,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:46,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:46,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:46,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:46,436 INFO L87 Difference]: Start difference. First operand 1623 states and 2337 transitions. Second operand 3 states. [2019-11-20 01:07:46,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:46,726 INFO L93 Difference]: Finished difference Result 3255 states and 4681 transitions. [2019-11-20 01:07:46,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:46,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-20 01:07:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:46,738 INFO L225 Difference]: With dead ends: 3255 [2019-11-20 01:07:46,739 INFO L226 Difference]: Without dead ends: 1631 [2019-11-20 01:07:46,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-11-20 01:07:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1615. [2019-11-20 01:07:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-11-20 01:07:46,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2321 transitions. [2019-11-20 01:07:46,814 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2321 transitions. Word has length 127 [2019-11-20 01:07:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:46,815 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 2321 transitions. [2019-11-20 01:07:46,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2321 transitions. [2019-11-20 01:07:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 01:07:46,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:46,819 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:46,820 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:46,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:46,820 INFO L82 PathProgramCache]: Analyzing trace with hash 704603328, now seen corresponding path program 1 times [2019-11-20 01:07:46,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:46,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371379339] [2019-11-20 01:07:46,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 01:07:46,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371379339] [2019-11-20 01:07:46,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:46,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:46,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983554273] [2019-11-20 01:07:46,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:46,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:46,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:46,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:46,867 INFO L87 Difference]: Start difference. First operand 1615 states and 2321 transitions. Second operand 3 states. [2019-11-20 01:07:47,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:47,120 INFO L93 Difference]: Finished difference Result 3323 states and 4778 transitions. [2019-11-20 01:07:47,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:47,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-20 01:07:47,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:47,133 INFO L225 Difference]: With dead ends: 3323 [2019-11-20 01:07:47,133 INFO L226 Difference]: Without dead ends: 1715 [2019-11-20 01:07:47,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-11-20 01:07:47,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-11-20 01:07:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-11-20 01:07:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2417 transitions. [2019-11-20 01:07:47,215 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2417 transitions. Word has length 138 [2019-11-20 01:07:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:47,215 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2417 transitions. [2019-11-20 01:07:47,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2417 transitions. [2019-11-20 01:07:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 01:07:47,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:47,220 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:47,221 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:47,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1658127444, now seen corresponding path program 1 times [2019-11-20 01:07:47,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:47,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834766006] [2019-11-20 01:07:47,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 01:07:47,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834766006] [2019-11-20 01:07:47,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:47,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:47,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943303805] [2019-11-20 01:07:47,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:47,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:47,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:47,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:47,270 INFO L87 Difference]: Start difference. First operand 1699 states and 2417 transitions. Second operand 3 states. [2019-11-20 01:07:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:47,523 INFO L93 Difference]: Finished difference Result 3407 states and 4846 transitions. [2019-11-20 01:07:47,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:47,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-20 01:07:47,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:47,536 INFO L225 Difference]: With dead ends: 3407 [2019-11-20 01:07:47,536 INFO L226 Difference]: Without dead ends: 1715 [2019-11-20 01:07:47,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:47,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-11-20 01:07:47,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-11-20 01:07:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-11-20 01:07:47,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2389 transitions. [2019-11-20 01:07:47,635 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2389 transitions. Word has length 139 [2019-11-20 01:07:47,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:47,635 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2389 transitions. [2019-11-20 01:07:47,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2389 transitions. [2019-11-20 01:07:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 01:07:47,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:47,641 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:47,641 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:47,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:47,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1163594683, now seen corresponding path program 1 times [2019-11-20 01:07:47,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:47,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115039467] [2019-11-20 01:07:47,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:47,690 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-11-20 01:07:47,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115039467] [2019-11-20 01:07:47,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:47,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:47,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371991407] [2019-11-20 01:07:47,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:47,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:47,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:47,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:47,693 INFO L87 Difference]: Start difference. First operand 1699 states and 2389 transitions. Second operand 3 states. [2019-11-20 01:07:47,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:47,770 INFO L93 Difference]: Finished difference Result 3373 states and 4735 transitions. [2019-11-20 01:07:47,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:47,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-20 01:07:47,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:47,799 INFO L225 Difference]: With dead ends: 3373 [2019-11-20 01:07:47,805 INFO L226 Difference]: Without dead ends: 1681 [2019-11-20 01:07:47,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:47,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2019-11-20 01:07:47,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1677. [2019-11-20 01:07:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2019-11-20 01:07:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2356 transitions. [2019-11-20 01:07:47,882 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2356 transitions. Word has length 154 [2019-11-20 01:07:47,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:47,883 INFO L462 AbstractCegarLoop]: Abstraction has 1677 states and 2356 transitions. [2019-11-20 01:07:47,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2356 transitions. [2019-11-20 01:07:47,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 01:07:47,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:47,887 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:47,888 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:47,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:47,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1358544773, now seen corresponding path program 1 times [2019-11-20 01:07:47,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:47,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239758045] [2019-11-20 01:07:47,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-20 01:07:47,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239758045] [2019-11-20 01:07:47,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628560032] [2019-11-20 01:07:47,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:48,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:07:48,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:07:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-20 01:07:48,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:07:48,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 01:07:48,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412383087] [2019-11-20 01:07:48,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:07:48,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:48,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:07:48,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:07:48,126 INFO L87 Difference]: Start difference. First operand 1677 states and 2356 transitions. Second operand 4 states. [2019-11-20 01:07:48,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:48,685 INFO L93 Difference]: Finished difference Result 5291 states and 7422 transitions. [2019-11-20 01:07:48,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:07:48,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-20 01:07:48,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:48,703 INFO L225 Difference]: With dead ends: 5291 [2019-11-20 01:07:48,703 INFO L226 Difference]: Without dead ends: 3521 [2019-11-20 01:07:48,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:07:48,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2019-11-20 01:07:48,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2065. [2019-11-20 01:07:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2019-11-20 01:07:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2916 transitions. [2019-11-20 01:07:48,794 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2916 transitions. Word has length 154 [2019-11-20 01:07:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:48,795 INFO L462 AbstractCegarLoop]: Abstraction has 2065 states and 2916 transitions. [2019-11-20 01:07:48,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:07:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2916 transitions. [2019-11-20 01:07:48,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 01:07:48,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:48,800 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:49,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:49,005 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:49,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:49,005 INFO L82 PathProgramCache]: Analyzing trace with hash 782353573, now seen corresponding path program 1 times [2019-11-20 01:07:49,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:49,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111196457] [2019-11-20 01:07:49,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-20 01:07:49,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111196457] [2019-11-20 01:07:49,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752283816] [2019-11-20 01:07:49,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:49,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:07:49,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:07:49,230 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-20 01:07:49,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:07:49,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 01:07:49,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185778525] [2019-11-20 01:07:49,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:07:49,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:49,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:07:49,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:07:49,233 INFO L87 Difference]: Start difference. First operand 2065 states and 2916 transitions. Second operand 4 states. [2019-11-20 01:07:49,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:49,776 INFO L93 Difference]: Finished difference Result 5632 states and 7889 transitions. [2019-11-20 01:07:49,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:07:49,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-20 01:07:49,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:49,787 INFO L225 Difference]: With dead ends: 5632 [2019-11-20 01:07:49,787 INFO L226 Difference]: Without dead ends: 3574 [2019-11-20 01:07:49,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:07:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-11-20 01:07:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 2573. [2019-11-20 01:07:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2573 states. [2019-11-20 01:07:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 3491 transitions. [2019-11-20 01:07:49,919 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 3491 transitions. Word has length 156 [2019-11-20 01:07:49,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:49,919 INFO L462 AbstractCegarLoop]: Abstraction has 2573 states and 3491 transitions. [2019-11-20 01:07:49,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:07:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3491 transitions. [2019-11-20 01:07:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-20 01:07:49,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:49,926 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:50,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:50,133 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:50,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:50,134 INFO L82 PathProgramCache]: Analyzing trace with hash -571340489, now seen corresponding path program 1 times [2019-11-20 01:07:50,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:50,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290692010] [2019-11-20 01:07:50,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 01:07:50,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290692010] [2019-11-20 01:07:50,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637651792] [2019-11-20 01:07:50,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/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-11-20 01:07:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:50,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:07:50,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:07:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 01:07:50,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:07:50,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 01:07:50,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388864846] [2019-11-20 01:07:50,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:07:50,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:50,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:07:50,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:07:50,410 INFO L87 Difference]: Start difference. First operand 2573 states and 3491 transitions. Second operand 4 states. [2019-11-20 01:07:50,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:50,952 INFO L93 Difference]: Finished difference Result 6269 states and 8443 transitions. [2019-11-20 01:07:50,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:07:50,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-20 01:07:50,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:50,962 INFO L225 Difference]: With dead ends: 6269 [2019-11-20 01:07:50,962 INFO L226 Difference]: Without dead ends: 3674 [2019-11-20 01:07:50,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:07:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2019-11-20 01:07:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 2279. [2019-11-20 01:07:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2019-11-20 01:07:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3070 transitions. [2019-11-20 01:07:51,058 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3070 transitions. Word has length 163 [2019-11-20 01:07:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:51,059 INFO L462 AbstractCegarLoop]: Abstraction has 2279 states and 3070 transitions. [2019-11-20 01:07:51,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:07:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3070 transitions. [2019-11-20 01:07:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 01:07:51,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:51,065 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:51,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:51,270 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:51,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:51,270 INFO L82 PathProgramCache]: Analyzing trace with hash -2030054557, now seen corresponding path program 1 times [2019-11-20 01:07:51,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:51,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967442959] [2019-11-20 01:07:51,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-20 01:07:51,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967442959] [2019-11-20 01:07:51,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:51,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:07:51,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728345960] [2019-11-20 01:07:51,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:51,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:51,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:51,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:51,354 INFO L87 Difference]: Start difference. First operand 2279 states and 3070 transitions. Second operand 3 states. [2019-11-20 01:07:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:51,463 INFO L93 Difference]: Finished difference Result 5493 states and 7329 transitions. [2019-11-20 01:07:51,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:51,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-20 01:07:51,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:51,470 INFO L225 Difference]: With dead ends: 5493 [2019-11-20 01:07:51,471 INFO L226 Difference]: Without dead ends: 3221 [2019-11-20 01:07:51,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:51,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2019-11-20 01:07:51,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 3217. [2019-11-20 01:07:51,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2019-11-20 01:07:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4257 transitions. [2019-11-20 01:07:51,588 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4257 transitions. Word has length 165 [2019-11-20 01:07:51,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:51,589 INFO L462 AbstractCegarLoop]: Abstraction has 3217 states and 4257 transitions. [2019-11-20 01:07:51,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4257 transitions. [2019-11-20 01:07:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-20 01:07:51,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:51,596 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:51,598 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:51,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:51,599 INFO L82 PathProgramCache]: Analyzing trace with hash -36905074, now seen corresponding path program 1 times [2019-11-20 01:07:51,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:51,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821437137] [2019-11-20 01:07:51,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:51,618 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 01:07:51,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [958199388] [2019-11-20 01:07:51,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/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-11-20 01:07:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:51,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 01:07:51,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:07:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-20 01:07:51,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821437137] [2019-11-20 01:07:51,786 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 01:07:51,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958199388] [2019-11-20 01:07:51,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:51,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:07:51,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401557564] [2019-11-20 01:07:51,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:07:51,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:51,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:07:51,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:07:51,790 INFO L87 Difference]: Start difference. First operand 3217 states and 4257 transitions. Second operand 4 states. [2019-11-20 01:07:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:52,256 INFO L93 Difference]: Finished difference Result 5057 states and 6580 transitions. [2019-11-20 01:07:52,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:07:52,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-20 01:07:52,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:52,266 INFO L225 Difference]: With dead ends: 5057 [2019-11-20 01:07:52,266 INFO L226 Difference]: Without dead ends: 4092 [2019-11-20 01:07:52,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:07:52,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2019-11-20 01:07:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 3522. [2019-11-20 01:07:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3522 states. [2019-11-20 01:07:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 4633 transitions. [2019-11-20 01:07:52,401 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 4633 transitions. Word has length 186 [2019-11-20 01:07:52,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:52,402 INFO L462 AbstractCegarLoop]: Abstraction has 3522 states and 4633 transitions. [2019-11-20 01:07:52,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:07:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 4633 transitions. [2019-11-20 01:07:52,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 01:07:52,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:52,454 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:52,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:52,655 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:52,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:52,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1106021424, now seen corresponding path program 1 times [2019-11-20 01:07:52,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:52,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413096076] [2019-11-20 01:07:52,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:52,665 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 01:07:52,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2098128677] [2019-11-20 01:07:52,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/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-11-20 01:07:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:52,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 01:07:52,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:07:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-20 01:07:52,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413096076] [2019-11-20 01:07:52,851 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 01:07:52,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098128677] [2019-11-20 01:07:52,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:52,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:07:52,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732202543] [2019-11-20 01:07:52,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:07:52,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:52,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:07:52,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:07:52,853 INFO L87 Difference]: Start difference. First operand 3522 states and 4633 transitions. Second operand 5 states. [2019-11-20 01:07:53,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:53,264 INFO L93 Difference]: Finished difference Result 5415 states and 7085 transitions. [2019-11-20 01:07:53,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:07:53,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2019-11-20 01:07:53,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:53,276 INFO L225 Difference]: With dead ends: 5415 [2019-11-20 01:07:53,276 INFO L226 Difference]: Without dead ends: 5414 [2019-11-20 01:07:53,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:07:53,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2019-11-20 01:07:53,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 4841. [2019-11-20 01:07:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4841 states. [2019-11-20 01:07:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 6383 transitions. [2019-11-20 01:07:53,453 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 6383 transitions. Word has length 188 [2019-11-20 01:07:53,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:53,454 INFO L462 AbstractCegarLoop]: Abstraction has 4841 states and 6383 transitions. [2019-11-20 01:07:53,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:07:53,454 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 6383 transitions. [2019-11-20 01:07:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 01:07:53,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:53,464 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:53,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:53,669 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:53,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:53,669 INFO L82 PathProgramCache]: Analyzing trace with hash 73074738, now seen corresponding path program 1 times [2019-11-20 01:07:53,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:53,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242542603] [2019-11-20 01:07:53,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:53,683 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 01:07:53,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2024870058] [2019-11-20 01:07:53,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/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-11-20 01:07:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:53,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 01:07:53,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:07:53,934 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 13 [2019-11-20 01:07:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:07:53,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242542603] [2019-11-20 01:07:53,977 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 01:07:53,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024870058] [2019-11-20 01:07:53,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:53,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:07:53,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352864658] [2019-11-20 01:07:53,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:07:53,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:53,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:07:53,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:07:53,979 INFO L87 Difference]: Start difference. First operand 4841 states and 6383 transitions. Second operand 5 states. [2019-11-20 01:07:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:54,563 INFO L93 Difference]: Finished difference Result 9086 states and 11995 transitions. [2019-11-20 01:07:54,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:07:54,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-11-20 01:07:54,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:54,574 INFO L225 Difference]: With dead ends: 9086 [2019-11-20 01:07:54,575 INFO L226 Difference]: Without dead ends: 4944 [2019-11-20 01:07:54,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:07:54,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2019-11-20 01:07:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4935. [2019-11-20 01:07:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4935 states. [2019-11-20 01:07:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4935 states to 4935 states and 6457 transitions. [2019-11-20 01:07:54,764 INFO L78 Accepts]: Start accepts. Automaton has 4935 states and 6457 transitions. Word has length 189 [2019-11-20 01:07:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:54,765 INFO L462 AbstractCegarLoop]: Abstraction has 4935 states and 6457 transitions. [2019-11-20 01:07:54,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:07:54,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4935 states and 6457 transitions. [2019-11-20 01:07:54,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-20 01:07:54,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:54,772 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:54,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:54,985 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:54,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:54,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1864895527, now seen corresponding path program 1 times [2019-11-20 01:07:54,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:54,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629965396] [2019-11-20 01:07:54,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:55,000 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 01:07:55,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [25362179] [2019-11-20 01:07:55,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/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-11-20 01:07:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:55,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:07:55,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:07:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-11-20 01:07:55,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629965396] [2019-11-20 01:07:55,166 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 01:07:55,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25362179] [2019-11-20 01:07:55,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:55,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:07:55,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305129849] [2019-11-20 01:07:55,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:55,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:55,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:55,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:55,170 INFO L87 Difference]: Start difference. First operand 4935 states and 6457 transitions. Second operand 3 states. [2019-11-20 01:07:55,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:55,485 INFO L93 Difference]: Finished difference Result 9835 states and 12868 transitions. [2019-11-20 01:07:55,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:55,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-11-20 01:07:55,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:55,495 INFO L225 Difference]: With dead ends: 9835 [2019-11-20 01:07:55,495 INFO L226 Difference]: Without dead ends: 3433 [2019-11-20 01:07:55,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2019-11-20 01:07:55,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3427. [2019-11-20 01:07:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3427 states. [2019-11-20 01:07:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 4448 transitions. [2019-11-20 01:07:55,685 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 4448 transitions. Word has length 196 [2019-11-20 01:07:55,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:55,686 INFO L462 AbstractCegarLoop]: Abstraction has 3427 states and 4448 transitions. [2019-11-20 01:07:55,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 4448 transitions. [2019-11-20 01:07:55,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-20 01:07:55,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:55,691 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:55,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:55,896 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:55,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:55,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1327391442, now seen corresponding path program 1 times [2019-11-20 01:07:55,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:55,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482319574] [2019-11-20 01:07:55,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:55,962 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 01:07:55,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482319574] [2019-11-20 01:07:55,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:55,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:07:55,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004841357] [2019-11-20 01:07:55,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:55,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:55,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:55,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:55,965 INFO L87 Difference]: Start difference. First operand 3427 states and 4448 transitions. Second operand 3 states. [2019-11-20 01:07:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:56,228 INFO L93 Difference]: Finished difference Result 6506 states and 8421 transitions. [2019-11-20 01:07:56,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:56,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-20 01:07:56,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:56,234 INFO L225 Difference]: With dead ends: 6506 [2019-11-20 01:07:56,234 INFO L226 Difference]: Without dead ends: 2978 [2019-11-20 01:07:56,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-11-20 01:07:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2936. [2019-11-20 01:07:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2936 states. [2019-11-20 01:07:56,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 3773 transitions. [2019-11-20 01:07:56,338 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 3773 transitions. Word has length 197 [2019-11-20 01:07:56,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:56,339 INFO L462 AbstractCegarLoop]: Abstraction has 2936 states and 3773 transitions. [2019-11-20 01:07:56,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 3773 transitions. [2019-11-20 01:07:56,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-20 01:07:56,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:56,345 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:56,346 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:56,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:56,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1162887835, now seen corresponding path program 1 times [2019-11-20 01:07:56,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:56,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069119952] [2019-11-20 01:07:56,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-11-20 01:07:56,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069119952] [2019-11-20 01:07:56,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:56,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:07:56,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739857134] [2019-11-20 01:07:56,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:56,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:56,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:56,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:56,496 INFO L87 Difference]: Start difference. First operand 2936 states and 3773 transitions. Second operand 3 states. [2019-11-20 01:07:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:56,758 INFO L93 Difference]: Finished difference Result 6138 states and 7862 transitions. [2019-11-20 01:07:56,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:56,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-20 01:07:56,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:56,764 INFO L225 Difference]: With dead ends: 6138 [2019-11-20 01:07:56,765 INFO L226 Difference]: Without dead ends: 3224 [2019-11-20 01:07:56,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:56,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2019-11-20 01:07:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 3208. [2019-11-20 01:07:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-11-20 01:07:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 4085 transitions. [2019-11-20 01:07:56,874 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 4085 transitions. Word has length 335 [2019-11-20 01:07:56,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:56,875 INFO L462 AbstractCegarLoop]: Abstraction has 3208 states and 4085 transitions. [2019-11-20 01:07:56,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 4085 transitions. [2019-11-20 01:07:56,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-11-20 01:07:56,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:56,883 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:56,883 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:56,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:56,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1926092110, now seen corresponding path program 1 times [2019-11-20 01:07:56,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:56,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107364104] [2019-11-20 01:07:56,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 823 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-11-20 01:07:57,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107364104] [2019-11-20 01:07:57,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:57,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:07:57,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519614840] [2019-11-20 01:07:57,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:07:57,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:57,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:07:57,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:57,046 INFO L87 Difference]: Start difference. First operand 3208 states and 4085 transitions. Second operand 3 states. [2019-11-20 01:07:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:57,304 INFO L93 Difference]: Finished difference Result 6443 states and 8197 transitions. [2019-11-20 01:07:57,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:07:57,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-11-20 01:07:57,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:57,310 INFO L225 Difference]: With dead ends: 6443 [2019-11-20 01:07:57,310 INFO L226 Difference]: Without dead ends: 3257 [2019-11-20 01:07:57,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:07:57,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2019-11-20 01:07:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 3030. [2019-11-20 01:07:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-11-20 01:07:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3851 transitions. [2019-11-20 01:07:57,419 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3851 transitions. Word has length 366 [2019-11-20 01:07:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:57,420 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3851 transitions. [2019-11-20 01:07:57,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:07:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3851 transitions. [2019-11-20 01:07:57,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-11-20 01:07:57,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:07:57,429 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:07:57,429 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 01:07:57,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:57,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1476749664, now seen corresponding path program 1 times [2019-11-20 01:07:57,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:57,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188795173] [2019-11-20 01:07:57,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-20 01:07:57,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188795173] [2019-11-20 01:07:57,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82218812] [2019-11-20 01:07:57,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/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-11-20 01:07:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:57,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:07:57,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:07:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-20 01:07:57,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:07:57,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 01:07:57,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624880574] [2019-11-20 01:07:57,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:07:57,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:57,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:07:57,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:07:57,992 INFO L87 Difference]: Start difference. First operand 3030 states and 3851 transitions. Second operand 4 states. [2019-11-20 01:07:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:58,198 INFO L93 Difference]: Finished difference Result 4189 states and 5327 transitions. [2019-11-20 01:07:58,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:07:58,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 399 [2019-11-20 01:07:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:07:58,201 INFO L225 Difference]: With dead ends: 4189 [2019-11-20 01:07:58,201 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 01:07:58,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:07:58,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 01:07:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 01:07:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 01:07:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 01:07:58,206 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 399 [2019-11-20 01:07:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:07:58,207 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 01:07:58,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:07:58,207 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 01:07:58,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 01:07:58,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:07:58,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 01:07:58,601 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 111 [2019-11-20 01:07:58,806 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 116 [2019-11-20 01:08:00,595 WARN L191 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 435 DAG size of output: 270 [2019-11-20 01:08:00,888 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 132 [2019-11-20 01:08:01,044 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 136 [2019-11-20 01:08:02,611 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 436 DAG size of output: 271 [2019-11-20 01:08:03,402 WARN L191 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2019-11-20 01:08:03,815 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-11-20 01:08:04,350 WARN L191 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 49 [2019-11-20 01:08:04,586 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-20 01:08:08,229 WARN L191 SmtUtils]: Spent 3.64 s on a formula simplification. DAG size of input: 233 DAG size of output: 83 [2019-11-20 01:08:08,454 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-20 01:08:08,700 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-20 01:08:09,239 WARN L191 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 44 [2019-11-20 01:08:09,719 WARN L191 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 17 [2019-11-20 01:08:09,882 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-20 01:08:10,091 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 17 [2019-11-20 01:08:10,245 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-20 01:08:10,528 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 49 [2019-11-20 01:08:10,741 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 17 [2019-11-20 01:08:11,205 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2019-11-20 01:08:13,832 WARN L191 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 234 DAG size of output: 83 [2019-11-20 01:08:13,995 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 9 [2019-11-20 01:08:14,240 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2019-11-20 01:08:14,703 WARN L191 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 38 [2019-11-20 01:08:14,705 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-11-20 01:08:14,705 INFO L444 ceAbstractionStarter]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-11-20 01:08:14,706 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-11-20 01:08:14,706 INFO L444 ceAbstractionStarter]: For program point L201(lines 201 592) no Hoare annotation was computed. [2019-11-20 01:08:14,706 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 603) no Hoare annotation was computed. [2019-11-20 01:08:14,706 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 614) no Hoare annotation was computed. [2019-11-20 01:08:14,706 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 625) no Hoare annotation was computed. [2019-11-20 01:08:14,706 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-11-20 01:08:14,707 INFO L440 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-11-20 01:08:14,707 INFO L440 ceAbstractionStarter]: At program point L103(lines 102 625) the Hoare annotation is: false [2019-11-20 01:08:14,707 INFO L444 ceAbstractionStarter]: For program point L501(lines 501 505) no Hoare annotation was computed. [2019-11-20 01:08:14,707 INFO L444 ceAbstractionStarter]: For program point L501-2(lines 209 587) no Hoare annotation was computed. [2019-11-20 01:08:14,707 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-11-20 01:08:14,707 INFO L444 ceAbstractionStarter]: For program point L204(lines 204 591) no Hoare annotation was computed. [2019-11-20 01:08:14,707 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 602) no Hoare annotation was computed. [2019-11-20 01:08:14,707 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 613) no Hoare annotation was computed. [2019-11-20 01:08:14,708 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 624) no Hoare annotation was computed. [2019-11-20 01:08:14,708 INFO L444 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-20 01:08:14,708 INFO L444 ceAbstractionStarter]: For program point L502-1(line 502) no Hoare annotation was computed. [2019-11-20 01:08:14,708 INFO L444 ceAbstractionStarter]: For program point L502-2(line 502) no Hoare annotation was computed. [2019-11-20 01:08:14,708 INFO L444 ceAbstractionStarter]: For program point L502-3(line 502) no Hoare annotation was computed. [2019-11-20 01:08:14,708 INFO L440 ceAbstractionStarter]: At program point L205(lines 204 591) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-20 01:08:14,708 INFO L440 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-11-20 01:08:14,709 INFO L440 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-11-20 01:08:14,709 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-20 01:08:14,709 INFO L444 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-20 01:08:14,709 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-20 01:08:14,709 INFO L444 ceAbstractionStarter]: For program point L306-2(lines 209 587) no Hoare annotation was computed. [2019-11-20 01:08:14,709 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 601) no Hoare annotation was computed. [2019-11-20 01:08:14,709 INFO L444 ceAbstractionStarter]: For program point L141(lines 141 612) no Hoare annotation was computed. [2019-11-20 01:08:14,709 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 623) no Hoare annotation was computed. [2019-11-20 01:08:14,710 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-11-20 01:08:14,710 INFO L444 ceAbstractionStarter]: For program point L571(lines 571 581) no Hoare annotation was computed. [2019-11-20 01:08:14,710 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 581) no Hoare annotation was computed. [2019-11-20 01:08:14,710 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-11-20 01:08:14,710 INFO L440 ceAbstractionStarter]: At program point L208(lines 207 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-20 01:08:14,710 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-20 01:08:14,710 INFO L444 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-20 01:08:14,711 INFO L440 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-11-20 01:08:14,711 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-20 01:08:14,711 INFO L444 ceAbstractionStarter]: For program point L341-2(lines 209 587) no Hoare annotation was computed. [2019-11-20 01:08:14,711 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-11-20 01:08:14,711 INFO L447 ceAbstractionStarter]: At program point L672(lines 64 674) the Hoare annotation is: true [2019-11-20 01:08:14,711 INFO L444 ceAbstractionStarter]: For program point L639(lines 639 645) no Hoare annotation was computed. [2019-11-20 01:08:14,711 INFO L444 ceAbstractionStarter]: For program point L540(lines 540 545) no Hoare annotation was computed. [2019-11-20 01:08:14,711 INFO L444 ceAbstractionStarter]: For program point L177(lines 177 600) no Hoare annotation was computed. [2019-11-20 01:08:14,711 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 611) no Hoare annotation was computed. [2019-11-20 01:08:14,712 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 622) no Hoare annotation was computed. [2019-11-20 01:08:14,712 INFO L447 ceAbstractionStarter]: At program point L673(lines 9 675) the Hoare annotation is: true [2019-11-20 01:08:14,712 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 578) no Hoare annotation was computed. [2019-11-20 01:08:14,712 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-11-20 01:08:14,712 INFO L440 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-11-20 01:08:14,712 INFO L440 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-11-20 01:08:14,712 INFO L444 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-20 01:08:14,713 INFO L440 ceAbstractionStarter]: At program point L212(lines 105 624) the Hoare annotation is: false [2019-11-20 01:08:14,713 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 599) no Hoare annotation was computed. [2019-11-20 01:08:14,713 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 610) no Hoare annotation was computed. [2019-11-20 01:08:14,713 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 621) no Hoare annotation was computed. [2019-11-20 01:08:14,713 INFO L444 ceAbstractionStarter]: For program point L511(lines 511 515) no Hoare annotation was computed. [2019-11-20 01:08:14,713 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-20 01:08:14,713 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-11-20 01:08:14,713 INFO L444 ceAbstractionStarter]: For program point L511-2(lines 511 515) no Hoare annotation was computed. [2019-11-20 01:08:14,714 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-11-20 01:08:14,714 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-20 01:08:14,714 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 64 674) no Hoare annotation was computed. [2019-11-20 01:08:14,714 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 598) no Hoare annotation was computed. [2019-11-20 01:08:14,714 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 609) no Hoare annotation was computed. [2019-11-20 01:08:14,714 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 620) no Hoare annotation was computed. [2019-11-20 01:08:14,714 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-20 01:08:14,714 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-11-20 01:08:14,714 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-11-20 01:08:14,715 INFO L444 ceAbstractionStarter]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-11-20 01:08:14,715 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-20 01:08:14,715 INFO L440 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-11-20 01:08:14,715 INFO L440 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-11-20 01:08:14,715 INFO L444 ceAbstractionStarter]: For program point L217-2(lines 209 587) no Hoare annotation was computed. [2019-11-20 01:08:14,715 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 01:08:14,715 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 597) no Hoare annotation was computed. [2019-11-20 01:08:14,716 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 608) no Hoare annotation was computed. [2019-11-20 01:08:14,716 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 619) no Hoare annotation was computed. [2019-11-20 01:08:14,716 INFO L444 ceAbstractionStarter]: For program point L550(lines 550 554) no Hoare annotation was computed. [2019-11-20 01:08:14,716 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-11-20 01:08:14,716 INFO L444 ceAbstractionStarter]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-11-20 01:08:14,716 INFO L440 ceAbstractionStarter]: At program point L121(lines 117 620) the Hoare annotation is: false [2019-11-20 01:08:14,716 INFO L440 ceAbstractionStarter]: At program point L551(lines 64 674) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-20 01:08:14,716 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-11-20 01:08:14,716 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-11-20 01:08:14,717 INFO L444 ceAbstractionStarter]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-11-20 01:08:14,717 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 596) no Hoare annotation was computed. [2019-11-20 01:08:14,717 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 607) no Hoare annotation was computed. [2019-11-20 01:08:14,717 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 618) no Hoare annotation was computed. [2019-11-20 01:08:14,720 INFO L447 ceAbstractionStarter]: At program point L685(lines 676 687) the Hoare annotation is: true [2019-11-20 01:08:14,720 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-11-20 01:08:14,720 INFO L444 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-11-20 01:08:14,720 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 01:08:14,720 INFO L444 ceAbstractionStarter]: For program point L289-2(lines 209 587) no Hoare annotation was computed. [2019-11-20 01:08:14,721 INFO L440 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-11-20 01:08:14,721 INFO L440 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-11-20 01:08:14,721 INFO L440 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-11-20 01:08:14,721 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 526) no Hoare annotation was computed. [2019-11-20 01:08:14,722 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-11-20 01:08:14,722 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-11-20 01:08:14,722 INFO L440 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-11-20 01:08:14,723 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 559) no Hoare annotation was computed. [2019-11-20 01:08:14,723 INFO L444 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-20 01:08:14,723 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-11-20 01:08:14,723 INFO L444 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-20 01:08:14,723 INFO L444 ceAbstractionStarter]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-11-20 01:08:14,724 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 595) no Hoare annotation was computed. [2019-11-20 01:08:14,724 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 606) no Hoare annotation was computed. [2019-11-20 01:08:14,724 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 617) no Hoare annotation was computed. [2019-11-20 01:08:14,724 INFO L444 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-20 01:08:14,724 INFO L444 ceAbstractionStarter]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-11-20 01:08:14,724 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-11-20 01:08:14,725 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 01:08:14,725 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-11-20 01:08:14,725 INFO L447 ceAbstractionStarter]: At program point L657(lines 98 658) the Hoare annotation is: true [2019-11-20 01:08:14,725 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 594) no Hoare annotation was computed. [2019-11-20 01:08:14,725 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 605) no Hoare annotation was computed. [2019-11-20 01:08:14,726 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 616) no Hoare annotation was computed. [2019-11-20 01:08:14,726 INFO L444 ceAbstractionStarter]: For program point L262(line 262) no Hoare annotation was computed. [2019-11-20 01:08:14,726 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-11-20 01:08:14,726 INFO L444 ceAbstractionStarter]: For program point L262-1(line 262) no Hoare annotation was computed. [2019-11-20 01:08:14,726 INFO L440 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-11-20 01:08:14,727 INFO L440 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-11-20 01:08:14,727 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 209 587) no Hoare annotation was computed. [2019-11-20 01:08:14,727 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 654) no Hoare annotation was computed. [2019-11-20 01:08:14,727 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-20 01:08:14,727 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 651) no Hoare annotation was computed. [2019-11-20 01:08:14,727 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 565) no Hoare annotation was computed. [2019-11-20 01:08:14,727 INFO L444 ceAbstractionStarter]: For program point L528(lines 528 532) no Hoare annotation was computed. [2019-11-20 01:08:14,727 INFO L444 ceAbstractionStarter]: For program point L561-2(lines 561 565) no Hoare annotation was computed. [2019-11-20 01:08:14,728 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-20 01:08:14,728 INFO L444 ceAbstractionStarter]: For program point L528-2(lines 209 587) no Hoare annotation was computed. [2019-11-20 01:08:14,728 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-20 01:08:14,728 INFO L440 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-11-20 01:08:14,728 INFO L444 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-11-20 01:08:14,728 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-20 01:08:14,728 INFO L444 ceAbstractionStarter]: For program point L264-1(line 264) no Hoare annotation was computed. [2019-11-20 01:08:14,728 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 593) no Hoare annotation was computed. [2019-11-20 01:08:14,728 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 604) no Hoare annotation was computed. [2019-11-20 01:08:14,728 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 615) no Hoare annotation was computed. [2019-11-20 01:08:14,729 INFO L440 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-11-20 01:08:14,729 INFO L444 ceAbstractionStarter]: For program point L661(lines 661 665) no Hoare annotation was computed. [2019-11-20 01:08:14,729 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 637) no Hoare annotation was computed. [2019-11-20 01:08:14,729 INFO L444 ceAbstractionStarter]: For program point L661-2(lines 661 665) no Hoare annotation was computed. [2019-11-20 01:08:14,729 INFO L444 ceAbstractionStarter]: For program point L628-2(lines 627 649) no Hoare annotation was computed. [2019-11-20 01:08:14,729 INFO L440 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-11-20 01:08:14,730 INFO L440 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-11-20 01:08:14,730 INFO L440 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-11-20 01:08:14,730 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 01:08:14,730 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-20 01:08:14,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:08:14 BoogieIcfgContainer [2019-11-20 01:08:14,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 01:08:14,776 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:08:14,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:08:14,777 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:08:14,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:07:36" (3/4) ... [2019-11-20 01:08:14,782 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 01:08:14,804 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 01:08:14,805 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 01:08:14,943 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f04d5711-dac5-4b87-afcb-626564b18e6c/bin/uautomizer/witness.graphml [2019-11-20 01:08:14,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:08:14,945 INFO L168 Benchmark]: Toolchain (without parser) took 39936.45 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 934.8 MB). Free memory was 944.7 MB in the beginning and 1.4 GB in the end (delta: -445.0 MB). Peak memory consumption was 489.8 MB. Max. memory is 11.5 GB. [2019-11-20 01:08:14,946 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:08:14,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 567.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -161.4 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:08:14,947 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-11-20 01:08:14,947 INFO L168 Benchmark]: Boogie Preprocessor took 80.74 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:08:14,947 INFO L168 Benchmark]: RCFGBuilder took 1145.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2019-11-20 01:08:14,948 INFO L168 Benchmark]: TraceAbstraction took 37871.81 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 818.9 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -380.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-20 01:08:14,949 INFO L168 Benchmark]: Witness Printer took 167.62 ms. Allocated memory is still 2.0 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:08:14,952 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 567.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -161.4 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.74 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1145.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37871.81 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 818.9 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -380.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 167.62 ms. Allocated memory is still 2.0 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 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: 37.7s, OverallIterations: 39, TraceHistogramMax: 14, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.2s, HoareTripleCheckerStatistics: 6928 SDtfs, 5885 SDslu, 3640 SDs, 0 SdLazy, 4372 SolverSat, 1144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1986 GetRequests, 1934 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s 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: 2.7s AutomataMinimizationTime, 39 MinimizatonAttempts, 5661 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 264 NumberOfFragments, 1652 HoareAnnotationTreeSize, 29 FomulaSimplifications, 333708 FormulaSimplificationTreeSizeReduction, 4.4s HoareSimplificationTime, 29 FomulaSimplificationsInter, 71654 FormulaSimplificationTreeSizeReductionInter, 11.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.9s 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...