./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_2-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/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 758587bcbf021ce28de3aa106c09f74804dbda1d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:10:31,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:10:31,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:10:31,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:10:31,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:10:31,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:10:31,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:10:31,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:10:31,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:10:31,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:10:31,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:10:31,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:10:31,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:10:31,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:10:31,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:10:31,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:10:31,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:10:31,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:10:31,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:10:31,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:10:31,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:10:31,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:10:31,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:10:31,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:10:31,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:10:31,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:10:31,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:10:31,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:10:31,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:10:31,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:10:31,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:10:31,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:10:31,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:10:31,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:10:31,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:10:31,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:10:31,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:10:31,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:10:31,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:10:31,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:10:31,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:10:31,727 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-15 20:10:31,750 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:10:31,760 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:10:31,761 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:10:31,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:10:31,762 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:10:31,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:10:31,763 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:10:31,763 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:10:31,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:10:31,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:10:31,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:10:31,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:10:31,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:10:31,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:10:31,765 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-15 20:10:31,766 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:10:31,766 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:10:31,766 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:10:31,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:10:31,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:10:31,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:10:31,767 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:10:31,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:10:31,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:10:31,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:10:31,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:10:31,769 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:10:31,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:10:31,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:10:31,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:10:31,770 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_1d94da55-6e88-4029-865b-c8f84f9ceb9f/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 -> 758587bcbf021ce28de3aa106c09f74804dbda1d [2019-11-15 20:10:31,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:10:31,804 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:10:31,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:10:31,808 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:10:31,809 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:10:31,809 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_2-1.i [2019-11-15 20:10:31,857 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/data/9d642303b/8b48892a6065464cac07554126536d94/FLAG56de9a3a3 [2019-11-15 20:10:32,235 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:10:32,236 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/sv-benchmarks/c/bitvector/byte_add_2-1.i [2019-11-15 20:10:32,242 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/data/9d642303b/8b48892a6065464cac07554126536d94/FLAG56de9a3a3 [2019-11-15 20:10:32,252 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/data/9d642303b/8b48892a6065464cac07554126536d94 [2019-11-15 20:10:32,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:10:32,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:10:32,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:10:32,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:10:32,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:10:32,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:10:32" (1/1) ... [2019-11-15 20:10:32,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377ddfcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:32, skipping insertion in model container [2019-11-15 20:10:32,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:10:32" (1/1) ... [2019-11-15 20:10:32,268 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:10:32,286 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:10:32,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:10:32,576 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:10:32,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:10:32,626 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:10:32,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:32 WrapperNode [2019-11-15 20:10:32,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:10:32,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:10:32,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:10:32,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:10:32,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:32" (1/1) ... [2019-11-15 20:10:32,658 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:32" (1/1) ... [2019-11-15 20:10:32,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:10:32,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:10:32,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:10:32,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:10:32,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:32" (1/1) ... [2019-11-15 20:10:32,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:32" (1/1) ... [2019-11-15 20:10:32,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:32" (1/1) ... [2019-11-15 20:10:32,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:32" (1/1) ... [2019-11-15 20:10:32,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:32" (1/1) ... [2019-11-15 20:10:32,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:32" (1/1) ... [2019-11-15 20:10:32,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:32" (1/1) ... [2019-11-15 20:10:32,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:10:32,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:10:32,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:10:32,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:10:32,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:10:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:10:32,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:10:33,215 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:10:33,215 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-15 20:10:33,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:10:33 BoogieIcfgContainer [2019-11-15 20:10:33,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:10:33,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:10:33,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:10:33,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:10:33,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:10:32" (1/3) ... [2019-11-15 20:10:33,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9b7816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:10:33, skipping insertion in model container [2019-11-15 20:10:33,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:32" (2/3) ... [2019-11-15 20:10:33,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9b7816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:10:33, skipping insertion in model container [2019-11-15 20:10:33,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:10:33" (3/3) ... [2019-11-15 20:10:33,223 INFO L109 eAbstractionObserver]: Analyzing ICFG byte_add_2-1.i [2019-11-15 20:10:33,231 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:10:33,238 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-11-15 20:10:33,247 INFO L249 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2019-11-15 20:10:33,284 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:10:33,284 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:10:33,284 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:10:33,284 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:10:33,285 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:10:33,285 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:10:33,285 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:10:33,285 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:10:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-15 20:10:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-15 20:10:33,316 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:33,317 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-15 20:10:33,320 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:33,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:33,325 INFO L82 PathProgramCache]: Analyzing trace with hash 30881, now seen corresponding path program 1 times [2019-11-15 20:10:33,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:33,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819707856] [2019-11-15 20:10:33,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:33,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:33,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:33,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819707856] [2019-11-15 20:10:33,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:10:33,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-15 20:10:33,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864477235] [2019-11-15 20:10:33,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 20:10:33,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:33,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 20:10:33,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:10:33,457 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-11-15 20:10:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:33,476 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2019-11-15 20:10:33,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:10:33,478 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-11-15 20:10:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:33,488 INFO L225 Difference]: With dead ends: 134 [2019-11-15 20:10:33,488 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 20:10:33,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:10:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 20:10:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-15 20:10:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 20:10:33,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2019-11-15 20:10:33,528 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 3 [2019-11-15 20:10:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:33,529 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2019-11-15 20:10:33,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 20:10:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2019-11-15 20:10:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 20:10:33,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:33,530 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:33,531 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:33,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:33,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1126401592, now seen corresponding path program 1 times [2019-11-15 20:10:33,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:33,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39002809] [2019-11-15 20:10:33,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:33,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:33,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:33,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39002809] [2019-11-15 20:10:33,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:10:33,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:10:33,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767511570] [2019-11-15 20:10:33,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:10:33,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:33,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:10:33,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:10:33,648 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand 3 states. [2019-11-15 20:10:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:33,848 INFO L93 Difference]: Finished difference Result 144 states and 211 transitions. [2019-11-15 20:10:33,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:10:33,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-15 20:10:33,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:33,851 INFO L225 Difference]: With dead ends: 144 [2019-11-15 20:10:33,851 INFO L226 Difference]: Without dead ends: 97 [2019-11-15 20:10:33,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:10:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-15 20:10:33,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-11-15 20:10:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 20:10:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2019-11-15 20:10:33,873 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 12 [2019-11-15 20:10:33,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:33,873 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2019-11-15 20:10:33,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:10:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2019-11-15 20:10:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 20:10:33,874 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:33,874 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:33,875 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:33,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:33,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1247347973, now seen corresponding path program 1 times [2019-11-15 20:10:33,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:33,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549636133] [2019-11-15 20:10:33,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:33,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:33,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:34,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549636133] [2019-11-15 20:10:34,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:10:34,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:10:34,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074901330] [2019-11-15 20:10:34,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:10:34,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:34,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:10:34,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:10:34,020 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 5 states. [2019-11-15 20:10:34,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:34,362 INFO L93 Difference]: Finished difference Result 237 states and 316 transitions. [2019-11-15 20:10:34,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:10:34,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-15 20:10:34,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:34,365 INFO L225 Difference]: With dead ends: 237 [2019-11-15 20:10:34,365 INFO L226 Difference]: Without dead ends: 173 [2019-11-15 20:10:34,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:10:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-15 20:10:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 106. [2019-11-15 20:10:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-15 20:10:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2019-11-15 20:10:34,386 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 19 [2019-11-15 20:10:34,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:34,387 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2019-11-15 20:10:34,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:10:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2019-11-15 20:10:34,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:10:34,389 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:34,389 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:34,392 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:34,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:34,392 INFO L82 PathProgramCache]: Analyzing trace with hash 630219950, now seen corresponding path program 1 times [2019-11-15 20:10:34,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:34,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478586190] [2019-11-15 20:10:34,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:34,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:34,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:34,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478586190] [2019-11-15 20:10:34,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:10:34,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:10:34,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480397368] [2019-11-15 20:10:34,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:10:34,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:34,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:10:34,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:10:34,542 INFO L87 Difference]: Start difference. First operand 106 states and 139 transitions. Second operand 5 states. [2019-11-15 20:10:34,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:34,890 INFO L93 Difference]: Finished difference Result 236 states and 314 transitions. [2019-11-15 20:10:34,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:10:34,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-15 20:10:34,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:34,893 INFO L225 Difference]: With dead ends: 236 [2019-11-15 20:10:34,893 INFO L226 Difference]: Without dead ends: 179 [2019-11-15 20:10:34,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:10:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-15 20:10:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 119. [2019-11-15 20:10:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-15 20:10:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 153 transitions. [2019-11-15 20:10:34,916 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 153 transitions. Word has length 22 [2019-11-15 20:10:34,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:34,917 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 153 transitions. [2019-11-15 20:10:34,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:10:34,917 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 153 transitions. [2019-11-15 20:10:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 20:10:34,921 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:34,921 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:34,922 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:34,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:34,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1393084960, now seen corresponding path program 1 times [2019-11-15 20:10:34,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:34,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340018535] [2019-11-15 20:10:34,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:34,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:34,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:35,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:10:35,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340018535] [2019-11-15 20:10:35,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:10:35,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:10:35,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785072296] [2019-11-15 20:10:35,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:10:35,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:35,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:10:35,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:10:35,029 INFO L87 Difference]: Start difference. First operand 119 states and 153 transitions. Second operand 3 states. [2019-11-15 20:10:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:35,040 INFO L93 Difference]: Finished difference Result 177 states and 232 transitions. [2019-11-15 20:10:35,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:10:35,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 20:10:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:35,041 INFO L225 Difference]: With dead ends: 177 [2019-11-15 20:10:35,042 INFO L226 Difference]: Without dead ends: 85 [2019-11-15 20:10:35,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:10:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-15 20:10:35,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-15 20:10:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-15 20:10:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2019-11-15 20:10:35,049 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 25 [2019-11-15 20:10:35,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:35,049 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2019-11-15 20:10:35,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:10:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2019-11-15 20:10:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 20:10:35,056 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:35,056 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:35,058 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:35,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:35,058 INFO L82 PathProgramCache]: Analyzing trace with hash 77584428, now seen corresponding path program 1 times [2019-11-15 20:10:35,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:35,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157655715] [2019-11-15 20:10:35,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:35,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:35,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:35,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:35,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157655715] [2019-11-15 20:10:35,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:10:35,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:10:35,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898283054] [2019-11-15 20:10:35,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:10:35,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:35,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:10:35,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:10:35,154 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand 3 states. [2019-11-15 20:10:35,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:35,171 INFO L93 Difference]: Finished difference Result 109 states and 143 transitions. [2019-11-15 20:10:35,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:10:35,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-15 20:10:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:35,172 INFO L225 Difference]: With dead ends: 109 [2019-11-15 20:10:35,172 INFO L226 Difference]: Without dead ends: 96 [2019-11-15 20:10:35,173 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:10:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-15 20:10:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-11-15 20:10:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-15 20:10:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2019-11-15 20:10:35,180 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 31 [2019-11-15 20:10:35,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:35,181 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2019-11-15 20:10:35,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:10:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2019-11-15 20:10:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 20:10:35,182 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:35,182 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:35,184 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:35,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:35,184 INFO L82 PathProgramCache]: Analyzing trace with hash -933532822, now seen corresponding path program 1 times [2019-11-15 20:10:35,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:35,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003860037] [2019-11-15 20:10:35,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:35,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:35,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:35,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003860037] [2019-11-15 20:10:35,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237049281] [2019-11-15 20:10:35,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:35,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:10:35,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:10:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:35,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:10:35,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-11-15 20:10:35,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916353022] [2019-11-15 20:10:35,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:10:35,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:35,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:10:35,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:10:35,424 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand 4 states. [2019-11-15 20:10:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:35,674 INFO L93 Difference]: Finished difference Result 212 states and 310 transitions. [2019-11-15 20:10:35,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:10:35,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-15 20:10:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:35,676 INFO L225 Difference]: With dead ends: 212 [2019-11-15 20:10:35,676 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 20:10:35,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:10:35,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 20:10:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 137. [2019-11-15 20:10:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 20:10:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 171 transitions. [2019-11-15 20:10:35,699 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 171 transitions. Word has length 31 [2019-11-15 20:10:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:35,700 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 171 transitions. [2019-11-15 20:10:35,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:10:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 171 transitions. [2019-11-15 20:10:35,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 20:10:35,701 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:35,702 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:35,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:35,907 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:35,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:35,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1838072225, now seen corresponding path program 1 times [2019-11-15 20:10:35,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:35,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934785298] [2019-11-15 20:10:35,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:35,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:35,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:36,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934785298] [2019-11-15 20:10:36,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78746346] [2019-11-15 20:10:36,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:36,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 20:10:36,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:10:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:10:36,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:10:36,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-15 20:10:36,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129367073] [2019-11-15 20:10:36,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:10:36,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:36,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:10:36,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:10:36,204 INFO L87 Difference]: Start difference. First operand 137 states and 171 transitions. Second operand 4 states. [2019-11-15 20:10:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:36,454 INFO L93 Difference]: Finished difference Result 315 states and 424 transitions. [2019-11-15 20:10:36,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:10:36,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-15 20:10:36,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:36,456 INFO L225 Difference]: With dead ends: 315 [2019-11-15 20:10:36,457 INFO L226 Difference]: Without dead ends: 205 [2019-11-15 20:10:36,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:10:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-15 20:10:36,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 169. [2019-11-15 20:10:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 20:10:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 207 transitions. [2019-11-15 20:10:36,467 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 207 transitions. Word has length 38 [2019-11-15 20:10:36,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:36,468 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 207 transitions. [2019-11-15 20:10:36,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:10:36,468 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions. [2019-11-15 20:10:36,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 20:10:36,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:36,470 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:36,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:36,679 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:36,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:36,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1723752178, now seen corresponding path program 1 times [2019-11-15 20:10:36,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:36,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5046323] [2019-11-15 20:10:36,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:36,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:36,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 20:10:36,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5046323] [2019-11-15 20:10:36,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973739925] [2019-11-15 20:10:36,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:36,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 20:10:36,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:10:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 20:10:36,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:10:36,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-15 20:10:36,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364928195] [2019-11-15 20:10:36,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:10:36,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:36,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:10:36,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:10:36,990 INFO L87 Difference]: Start difference. First operand 169 states and 207 transitions. Second operand 4 states. [2019-11-15 20:10:37,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:37,207 INFO L93 Difference]: Finished difference Result 380 states and 495 transitions. [2019-11-15 20:10:37,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:10:37,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-15 20:10:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:37,210 INFO L225 Difference]: With dead ends: 380 [2019-11-15 20:10:37,210 INFO L226 Difference]: Without dead ends: 238 [2019-11-15 20:10:37,210 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:10:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-11-15 20:10:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 201. [2019-11-15 20:10:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-15 20:10:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 243 transitions. [2019-11-15 20:10:37,220 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 243 transitions. Word has length 45 [2019-11-15 20:10:37,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:37,220 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 243 transitions. [2019-11-15 20:10:37,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:10:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 243 transitions. [2019-11-15 20:10:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:10:37,222 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:37,222 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-15 20:10:37,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:37,434 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:37,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:37,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1050062779, now seen corresponding path program 1 times [2019-11-15 20:10:37,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:37,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104512126] [2019-11-15 20:10:37,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:37,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:37,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 20:10:37,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104512126] [2019-11-15 20:10:37,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:10:37,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:10:37,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236946807] [2019-11-15 20:10:37,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:10:37,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:37,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:10:37,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:10:37,489 INFO L87 Difference]: Start difference. First operand 201 states and 243 transitions. Second operand 3 states. [2019-11-15 20:10:37,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:37,499 INFO L93 Difference]: Finished difference Result 238 states and 284 transitions. [2019-11-15 20:10:37,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:10:37,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-15 20:10:37,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:37,501 INFO L225 Difference]: With dead ends: 238 [2019-11-15 20:10:37,501 INFO L226 Difference]: Without dead ends: 177 [2019-11-15 20:10:37,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:10:37,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-15 20:10:37,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 156. [2019-11-15 20:10:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-15 20:10:37,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 191 transitions. [2019-11-15 20:10:37,508 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 191 transitions. Word has length 52 [2019-11-15 20:10:37,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:37,508 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 191 transitions. [2019-11-15 20:10:37,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:10:37,508 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 191 transitions. [2019-11-15 20:10:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 20:10:37,518 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:37,518 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:37,519 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:37,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:37,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1007574895, now seen corresponding path program 1 times [2019-11-15 20:10:37,519 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:37,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660950408] [2019-11-15 20:10:37,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:37,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:37,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 20:10:37,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660950408] [2019-11-15 20:10:37,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:10:37,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:10:37,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877680053] [2019-11-15 20:10:37,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:10:37,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:37,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:10:37,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:10:37,623 INFO L87 Difference]: Start difference. First operand 156 states and 191 transitions. Second operand 4 states. [2019-11-15 20:10:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:37,721 INFO L93 Difference]: Finished difference Result 408 states and 499 transitions. [2019-11-15 20:10:37,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:10:37,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 20:10:37,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:37,723 INFO L225 Difference]: With dead ends: 408 [2019-11-15 20:10:37,724 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 20:10:37,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:10:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 20:10:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 197. [2019-11-15 20:10:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-15 20:10:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 248 transitions. [2019-11-15 20:10:37,733 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 248 transitions. Word has length 61 [2019-11-15 20:10:37,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:37,734 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 248 transitions. [2019-11-15 20:10:37,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:10:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 248 transitions. [2019-11-15 20:10:37,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 20:10:37,742 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:37,742 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2019-11-15 20:10:37,743 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:37,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:37,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1236408403, now seen corresponding path program 2 times [2019-11-15 20:10:37,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:37,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637719887] [2019-11-15 20:10:37,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:37,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:37,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 20:10:37,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637719887] [2019-11-15 20:10:37,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136115148] [2019-11-15 20:10:37,831 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:37,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:10:37,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:10:37,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:10:37,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:10:37,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:10:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 20:10:37,944 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:10:37,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-15 20:10:37,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663533106] [2019-11-15 20:10:37,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:10:37,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:37,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:10:37,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:10:37,945 INFO L87 Difference]: Start difference. First operand 197 states and 248 transitions. Second operand 6 states. [2019-11-15 20:10:38,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:38,164 INFO L93 Difference]: Finished difference Result 463 states and 583 transitions. [2019-11-15 20:10:38,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:10:38,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-15 20:10:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:38,166 INFO L225 Difference]: With dead ends: 463 [2019-11-15 20:10:38,167 INFO L226 Difference]: Without dead ends: 293 [2019-11-15 20:10:38,167 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:10:38,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-15 20:10:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 201. [2019-11-15 20:10:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-15 20:10:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 252 transitions. [2019-11-15 20:10:38,176 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 252 transitions. Word has length 61 [2019-11-15 20:10:38,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:38,180 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 252 transitions. [2019-11-15 20:10:38,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:10:38,180 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 252 transitions. [2019-11-15 20:10:38,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 20:10:38,181 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:38,181 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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-15 20:10:38,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:38,385 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:38,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:38,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1454389477, now seen corresponding path program 1 times [2019-11-15 20:10:38,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:38,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592283758] [2019-11-15 20:10:38,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:38,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:38,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:38,539 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:10:38,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592283758] [2019-11-15 20:10:38,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:10:38,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:10:38,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330205880] [2019-11-15 20:10:38,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:10:38,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:38,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:10:38,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:10:38,541 INFO L87 Difference]: Start difference. First operand 201 states and 252 transitions. Second operand 8 states. [2019-11-15 20:10:39,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:39,053 INFO L93 Difference]: Finished difference Result 650 states and 829 transitions. [2019-11-15 20:10:39,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:10:39,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-11-15 20:10:39,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:39,056 INFO L225 Difference]: With dead ends: 650 [2019-11-15 20:10:39,056 INFO L226 Difference]: Without dead ends: 468 [2019-11-15 20:10:39,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:10:39,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-15 20:10:39,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 408. [2019-11-15 20:10:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:10:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 515 transitions. [2019-11-15 20:10:39,072 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 515 transitions. Word has length 67 [2019-11-15 20:10:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:39,073 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 515 transitions. [2019-11-15 20:10:39,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:10:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 515 transitions. [2019-11-15 20:10:39,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 20:10:39,075 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:39,075 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-15 20:10:39,079 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:39,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:39,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2083812095, now seen corresponding path program 1 times [2019-11-15 20:10:39,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:39,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533610473] [2019-11-15 20:10:39,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:39,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:39,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 20:10:39,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533610473] [2019-11-15 20:10:39,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100692414] [2019-11-15 20:10:39,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:39,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:10:39,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:10:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 20:10:39,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:10:39,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 9 [2019-11-15 20:10:39,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137272998] [2019-11-15 20:10:39,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:10:39,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:39,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:10:39,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:10:39,338 INFO L87 Difference]: Start difference. First operand 408 states and 515 transitions. Second operand 4 states. [2019-11-15 20:10:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:39,492 INFO L93 Difference]: Finished difference Result 1120 states and 1405 transitions. [2019-11-15 20:10:39,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:10:39,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-15 20:10:39,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:39,497 INFO L225 Difference]: With dead ends: 1120 [2019-11-15 20:10:39,497 INFO L226 Difference]: Without dead ends: 698 [2019-11-15 20:10:39,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:10:39,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-11-15 20:10:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 548. [2019-11-15 20:10:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-11-15 20:10:39,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 695 transitions. [2019-11-15 20:10:39,520 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 695 transitions. Word has length 67 [2019-11-15 20:10:39,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:39,521 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 695 transitions. [2019-11-15 20:10:39,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:10:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 695 transitions. [2019-11-15 20:10:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 20:10:39,522 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:39,523 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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-15 20:10:39,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:39,726 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:39,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1316380646, now seen corresponding path program 1 times [2019-11-15 20:10:39,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:39,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814948321] [2019-11-15 20:10:39,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:39,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:39,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:10:39,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814948321] [2019-11-15 20:10:39,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:10:39,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:10:39,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221803501] [2019-11-15 20:10:39,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:10:39,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:39,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:10:39,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:10:39,888 INFO L87 Difference]: Start difference. First operand 548 states and 695 transitions. Second operand 8 states. [2019-11-15 20:10:40,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:40,448 INFO L93 Difference]: Finished difference Result 1429 states and 1804 transitions. [2019-11-15 20:10:40,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:10:40,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-11-15 20:10:40,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:40,453 INFO L225 Difference]: With dead ends: 1429 [2019-11-15 20:10:40,453 INFO L226 Difference]: Without dead ends: 811 [2019-11-15 20:10:40,454 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:10:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-11-15 20:10:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 705. [2019-11-15 20:10:40,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-11-15 20:10:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 892 transitions. [2019-11-15 20:10:40,480 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 892 transitions. Word has length 70 [2019-11-15 20:10:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:40,480 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 892 transitions. [2019-11-15 20:10:40,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:10:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 892 transitions. [2019-11-15 20:10:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 20:10:40,481 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:40,482 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-15 20:10:40,482 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:40,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:40,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1201027011, now seen corresponding path program 1 times [2019-11-15 20:10:40,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:40,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505489193] [2019-11-15 20:10:40,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:40,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:40,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 20:10:40,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505489193] [2019-11-15 20:10:40,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097065199] [2019-11-15 20:10:40,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:40,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:10:40,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:10:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-15 20:10:40,650 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:10:40,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-15 20:10:40,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834927909] [2019-11-15 20:10:40,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:10:40,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:40,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:10:40,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:10:40,651 INFO L87 Difference]: Start difference. First operand 705 states and 892 transitions. Second operand 7 states. [2019-11-15 20:10:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:41,303 INFO L93 Difference]: Finished difference Result 2231 states and 2794 transitions. [2019-11-15 20:10:41,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:10:41,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-11-15 20:10:41,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:41,311 INFO L225 Difference]: With dead ends: 2231 [2019-11-15 20:10:41,312 INFO L226 Difference]: Without dead ends: 1453 [2019-11-15 20:10:41,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:10:41,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-11-15 20:10:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 699. [2019-11-15 20:10:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-11-15 20:10:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 964 transitions. [2019-11-15 20:10:41,341 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 964 transitions. Word has length 73 [2019-11-15 20:10:41,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:41,341 INFO L462 AbstractCegarLoop]: Abstraction has 699 states and 964 transitions. [2019-11-15 20:10:41,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:10:41,341 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 964 transitions. [2019-11-15 20:10:41,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 20:10:41,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:41,342 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:41,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:41,546 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:41,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1090909143, now seen corresponding path program 1 times [2019-11-15 20:10:41,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:41,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281406049] [2019-11-15 20:10:41,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:41,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:41,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 20:10:41,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281406049] [2019-11-15 20:10:41,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:10:41,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:10:41,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758616460] [2019-11-15 20:10:41,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:10:41,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:41,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:10:41,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:10:41,652 INFO L87 Difference]: Start difference. First operand 699 states and 964 transitions. Second operand 7 states. [2019-11-15 20:10:42,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:42,332 INFO L93 Difference]: Finished difference Result 2207 states and 3026 transitions. [2019-11-15 20:10:42,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:10:42,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-11-15 20:10:42,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:42,340 INFO L225 Difference]: With dead ends: 2207 [2019-11-15 20:10:42,340 INFO L226 Difference]: Without dead ends: 1440 [2019-11-15 20:10:42,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:10:42,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2019-11-15 20:10:42,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1366. [2019-11-15 20:10:42,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1366 states. [2019-11-15 20:10:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1849 transitions. [2019-11-15 20:10:42,394 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1849 transitions. Word has length 79 [2019-11-15 20:10:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:42,394 INFO L462 AbstractCegarLoop]: Abstraction has 1366 states and 1849 transitions. [2019-11-15 20:10:42,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:10:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1849 transitions. [2019-11-15 20:10:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 20:10:42,396 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:42,396 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:42,397 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:42,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:42,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2026749083, now seen corresponding path program 1 times [2019-11-15 20:10:42,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:42,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86292265] [2019-11-15 20:10:42,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:42,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:42,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 20:10:42,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86292265] [2019-11-15 20:10:42,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:10:42,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:10:42,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018626068] [2019-11-15 20:10:42,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:10:42,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:42,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:10:42,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:10:42,541 INFO L87 Difference]: Start difference. First operand 1366 states and 1849 transitions. Second operand 8 states. [2019-11-15 20:10:43,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:43,515 INFO L93 Difference]: Finished difference Result 2993 states and 4036 transitions. [2019-11-15 20:10:43,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 20:10:43,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-11-15 20:10:43,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:43,524 INFO L225 Difference]: With dead ends: 2993 [2019-11-15 20:10:43,525 INFO L226 Difference]: Without dead ends: 1570 [2019-11-15 20:10:43,527 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-15 20:10:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-11-15 20:10:43,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1505. [2019-11-15 20:10:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2019-11-15 20:10:43,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2009 transitions. [2019-11-15 20:10:43,601 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2009 transitions. Word has length 82 [2019-11-15 20:10:43,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:43,602 INFO L462 AbstractCegarLoop]: Abstraction has 1505 states and 2009 transitions. [2019-11-15 20:10:43,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:10:43,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2009 transitions. [2019-11-15 20:10:43,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 20:10:43,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:43,603 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:43,604 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:43,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:43,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1381975007, now seen corresponding path program 1 times [2019-11-15 20:10:43,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:43,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977168259] [2019-11-15 20:10:43,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:43,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:43,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-15 20:10:43,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977168259] [2019-11-15 20:10:43,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:10:43,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:10:43,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050906299] [2019-11-15 20:10:43,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:10:43,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:43,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:10:43,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:10:43,727 INFO L87 Difference]: Start difference. First operand 1505 states and 2009 transitions. Second operand 6 states. [2019-11-15 20:10:43,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:43,941 INFO L93 Difference]: Finished difference Result 3715 states and 4842 transitions. [2019-11-15 20:10:43,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:10:43,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-11-15 20:10:43,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:43,952 INFO L225 Difference]: With dead ends: 3715 [2019-11-15 20:10:43,952 INFO L226 Difference]: Without dead ends: 2246 [2019-11-15 20:10:43,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:10:43,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2019-11-15 20:10:44,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 1751. [2019-11-15 20:10:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2019-11-15 20:10:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2239 transitions. [2019-11-15 20:10:44,012 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2239 transitions. Word has length 84 [2019-11-15 20:10:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:44,012 INFO L462 AbstractCegarLoop]: Abstraction has 1751 states and 2239 transitions. [2019-11-15 20:10:44,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:10:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2239 transitions. [2019-11-15 20:10:44,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 20:10:44,014 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:44,014 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:44,015 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:44,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:44,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1248202203, now seen corresponding path program 1 times [2019-11-15 20:10:44,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:44,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433927602] [2019-11-15 20:10:44,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:44,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:44,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 20:10:44,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433927602] [2019-11-15 20:10:44,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:10:44,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:10:44,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917428253] [2019-11-15 20:10:44,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:10:44,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:44,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:10:44,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:10:44,153 INFO L87 Difference]: Start difference. First operand 1751 states and 2239 transitions. Second operand 9 states. [2019-11-15 20:10:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:45,092 INFO L93 Difference]: Finished difference Result 2185 states and 2753 transitions. [2019-11-15 20:10:45,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:10:45,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-11-15 20:10:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:45,099 INFO L225 Difference]: With dead ends: 2185 [2019-11-15 20:10:45,099 INFO L226 Difference]: Without dead ends: 1342 [2019-11-15 20:10:45,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:10:45,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-11-15 20:10:45,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1277. [2019-11-15 20:10:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1277 states. [2019-11-15 20:10:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1584 transitions. [2019-11-15 20:10:45,137 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1584 transitions. Word has length 84 [2019-11-15 20:10:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:45,138 INFO L462 AbstractCegarLoop]: Abstraction has 1277 states and 1584 transitions. [2019-11-15 20:10:45,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:10:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1584 transitions. [2019-11-15 20:10:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 20:10:45,139 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:45,140 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:45,140 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:45,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:45,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1356500467, now seen corresponding path program 1 times [2019-11-15 20:10:45,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:45,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299517650] [2019-11-15 20:10:45,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:45,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:45,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:45,351 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 20:10:45,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299517650] [2019-11-15 20:10:45,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945572184] [2019-11-15 20:10:45,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/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-15 20:10:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:45,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 20:10:45,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:10:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 27 proven. 32 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-15 20:10:45,526 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:10:45,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2019-11-15 20:10:45,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131736090] [2019-11-15 20:10:45,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 20:10:45,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:45,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:10:45,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:10:45,530 INFO L87 Difference]: Start difference. First operand 1277 states and 1584 transitions. Second operand 12 states. [2019-11-15 20:10:46,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:46,175 INFO L93 Difference]: Finished difference Result 3152 states and 3782 transitions. [2019-11-15 20:10:46,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:10:46,175 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-11-15 20:10:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:46,185 INFO L225 Difference]: With dead ends: 3152 [2019-11-15 20:10:46,185 INFO L226 Difference]: Without dead ends: 1890 [2019-11-15 20:10:46,187 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2019-11-15 20:10:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2019-11-15 20:10:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 964. [2019-11-15 20:10:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-11-15 20:10:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1166 transitions. [2019-11-15 20:10:46,223 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1166 transitions. Word has length 90 [2019-11-15 20:10:46,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:46,224 INFO L462 AbstractCegarLoop]: Abstraction has 964 states and 1166 transitions. [2019-11-15 20:10:46,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 20:10:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1166 transitions. [2019-11-15 20:10:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 20:10:46,226 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:46,226 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:46,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:46,430 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:46,431 INFO L82 PathProgramCache]: Analyzing trace with hash -987561873, now seen corresponding path program 2 times [2019-11-15 20:10:46,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:46,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654927580] [2019-11-15 20:10:46,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:46,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:46,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 20:10:46,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654927580] [2019-11-15 20:10:46,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20845104] [2019-11-15 20:10:46,619 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d94da55-6e88-4029-865b-c8f84f9ceb9f/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-15 20:10:46,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:10:46,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:10:46,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 20:10:46,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:10:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 47 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 20:10:46,821 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:10:46,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2019-11-15 20:10:46,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112870937] [2019-11-15 20:10:46,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 20:10:46,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:46,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:10:46,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:10:46,822 INFO L87 Difference]: Start difference. First operand 964 states and 1166 transitions. Second operand 12 states. [2019-11-15 20:10:47,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:47,393 INFO L93 Difference]: Finished difference Result 3188 states and 3691 transitions. [2019-11-15 20:10:47,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:10:47,394 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-11-15 20:10:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:47,400 INFO L225 Difference]: With dead ends: 3188 [2019-11-15 20:10:47,400 INFO L226 Difference]: Without dead ends: 1240 [2019-11-15 20:10:47,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2019-11-15 20:10:47,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2019-11-15 20:10:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 358. [2019-11-15 20:10:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-15 20:10:47,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 480 transitions. [2019-11-15 20:10:47,422 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 480 transitions. Word has length 90 [2019-11-15 20:10:47,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:47,422 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 480 transitions. [2019-11-15 20:10:47,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 20:10:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 480 transitions. [2019-11-15 20:10:47,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 20:10:47,423 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:47,423 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:47,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:47,636 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 20:10:47,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:47,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1499605514, now seen corresponding path program 1 times [2019-11-15 20:10:47,636 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:47,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676316479] [2019-11-15 20:10:47,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:47,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:47,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:10:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:10:47,793 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:10:47,794 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:10:47,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:10:47 BoogieIcfgContainer [2019-11-15 20:10:47,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:10:47,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:10:47,850 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:10:47,851 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:10:47,851 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:10:33" (3/4) ... [2019-11-15 20:10:47,854 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:10:47,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:10:47,861 INFO L168 Benchmark]: Toolchain (without parser) took 15601.15 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 362.3 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -203.2 MB). Peak memory consumption was 159.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:10:47,861 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:10:47,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -202.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:10:47,862 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:10:47,866 INFO L168 Benchmark]: Boogie Preprocessor took 26.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:10:47,867 INFO L168 Benchmark]: RCFGBuilder took 504.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:10:47,867 INFO L168 Benchmark]: TraceAbstraction took 14632.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -39.0 MB). Peak memory consumption was 167.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:10:47,867 INFO L168 Benchmark]: Witness Printer took 4.29 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:10:47,869 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 371.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -202.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 504.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14632.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -39.0 MB). Peak memory consumption was 167.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.29 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 77. Possible FailurePath: [L105] unsigned int a, b, r; [L106] a = __VERIFIER_nondet_uint() [L108] b = 234770789 [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 [L40] COND FALSE !(a3 == (unsigned char)0) [L49] nb = (unsigned char)4 [L50] COND FALSE !(b3 == (unsigned char)0) [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND TRUE i == (unsigned char)0 [L65] EXPR partial_sum + a0 [L65] partial_sum = partial_sum + a0 [L66] COND FALSE !(i == (unsigned char)1) [L67] COND FALSE !(i == (unsigned char)2) [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND TRUE i == (unsigned char)0 [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND FALSE !(i == (unsigned char)0) [L66] COND TRUE i == (unsigned char)1 [L66] EXPR partial_sum + a1 [L66] partial_sum = partial_sum + a1 [L67] COND FALSE !(i == (unsigned char)2) [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND TRUE i == (unsigned char)1 [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND FALSE !(i == (unsigned char)0) [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND FALSE !(i == (unsigned char)0) [L66] COND FALSE !(i == (unsigned char)1) [L67] COND TRUE i == (unsigned char)2 [L67] EXPR partial_sum + a2 [L67] partial_sum = partial_sum + a2 [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND FALSE !(i == (unsigned char)1) [L73] COND TRUE i == (unsigned char)2 [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND FALSE !(i == (unsigned char)0) [L81] COND FALSE !(i == (unsigned char)1) [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND FALSE !(i == (unsigned char)0) [L66] COND FALSE !(i == (unsigned char)1) [L67] COND FALSE !(i == (unsigned char)2) [L68] COND TRUE i == (unsigned char)3 [L68] EXPR partial_sum + a3 [L68] partial_sum = partial_sum + a3 [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND TRUE i == (unsigned char)3 [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 [L76] COND FALSE !(partial_sum > ((unsigned char)255)) [L80] COND FALSE !(i == (unsigned char)0) [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L88] COND FALSE !(i < (unsigned char)4) [L97] r1 << 8U [L97] r2 << 16U [L97] r3 << 24U - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 38 error locations. Result: UNSAFE, OverallTime: 14.5s, OverallIterations: 23, TraceHistogramMax: 4, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2136 SDtfs, 3923 SDslu, 4364 SDs, 0 SdLazy, 5037 SolverSat, 421 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 698 GetRequests, 515 SyntacticMatches, 18 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1751occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 3997 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1781 NumberOfCodeBlocks, 1781 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1651 ConstructedInterpolants, 18 QuantifiedInterpolants, 488908 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1136 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 1202/1367 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...