./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 64bit --witnessprinter.graph.data.programhash 33be026e9ca846df0a8faa91fc9c2bbf64ee20dbba0f4f48a9cd42fbefb372d5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:05:32,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:05:32,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:05:32,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:05:32,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:05:32,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:05:32,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:05:32,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:05:32,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:05:32,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:05:32,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:05:32,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:05:32,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:05:32,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:05:32,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:05:32,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:05:32,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:05:32,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:05:32,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:05:32,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:05:32,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:05:32,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:05:32,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:05:32,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:05:32,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:05:32,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:05:32,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:05:32,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:05:32,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:05:32,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:05:32,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:05:32,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:05:32,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:05:32,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:05:32,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:05:32,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:05:32,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:05:32,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:05:32,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:05:32,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:05:32,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:05:32,492 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:05:32,520 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:05:32,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:05:32,525 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:05:32,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:05:32,526 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:05:32,527 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:05:32,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:05:32,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:05:32,528 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:05:32,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:05:32,529 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:05:32,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:05:32,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:05:32,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:05:32,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:05:32,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:05:32,530 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:05:32,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:05:32,530 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:05:32,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:05:32,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:05:32,531 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:05:32,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:05:32,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:32,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:05:32,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:05:32,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:05:32,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:05:32,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:05:32,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:05:32,533 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 33be026e9ca846df0a8faa91fc9c2bbf64ee20dbba0f4f48a9cd42fbefb372d5 [2022-02-21 03:05:32,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:05:32,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:05:32,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:05:32,799 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:05:32,799 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:05:32,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2022-02-21 03:05:32,875 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc54dec8f/112c751ee6004e1cbf8bd134478cf3f7/FLAG0a2b24a4b [2022-02-21 03:05:33,257 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:05:33,258 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2022-02-21 03:05:33,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc54dec8f/112c751ee6004e1cbf8bd134478cf3f7/FLAG0a2b24a4b [2022-02-21 03:05:33,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc54dec8f/112c751ee6004e1cbf8bd134478cf3f7 [2022-02-21 03:05:33,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:05:33,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:05:33,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:33,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:05:33,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:05:33,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:33" (1/1) ... [2022-02-21 03:05:33,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b104aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:33, skipping insertion in model container [2022-02-21 03:05:33,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:33" (1/1) ... [2022-02-21 03:05:33,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:05:33,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:05:33,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:33,461 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:05:33,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:33,481 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:05:33,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:33 WrapperNode [2022-02-21 03:05:33,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:33,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:33,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:05:33,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:05:33,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:33" (1/1) ... [2022-02-21 03:05:33,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:33" (1/1) ... [2022-02-21 03:05:33,510 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2022-02-21 03:05:33,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:33,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:05:33,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:05:33,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:05:33,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:33" (1/1) ... [2022-02-21 03:05:33,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:33" (1/1) ... [2022-02-21 03:05:33,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:33" (1/1) ... [2022-02-21 03:05:33,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:33" (1/1) ... [2022-02-21 03:05:33,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:33" (1/1) ... [2022-02-21 03:05:33,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:33" (1/1) ... [2022-02-21 03:05:33,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:33" (1/1) ... [2022-02-21 03:05:33,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:05:33,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:05:33,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:05:33,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:05:33,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:33" (1/1) ... [2022-02-21 03:05:33,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:33,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:33,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:05:33,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:05:33,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:05:33,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:05:33,657 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:05:33,659 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:05:33,881 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:05:33,887 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:05:33,888 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:05:33,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:33 BoogieIcfgContainer [2022-02-21 03:05:33,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:05:33,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:05:33,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:05:33,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:05:33,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:05:33" (1/3) ... [2022-02-21 03:05:33,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bd5d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:33, skipping insertion in model container [2022-02-21 03:05:33,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:33" (2/3) ... [2022-02-21 03:05:33,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bd5d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:33, skipping insertion in model container [2022-02-21 03:05:33,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:33" (3/3) ... [2022-02-21 03:05:33,903 INFO L111 eAbstractionObserver]: Analyzing ICFG LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2022-02-21 03:05:33,907 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:05:33,907 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-02-21 03:05:33,994 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:05:34,000 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:05:34,000 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-02-21 03:05:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.8125) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:05:34,038 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:34,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:05:34,039 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:05:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:34,049 INFO L85 PathProgramCache]: Analyzing trace with hash 28693987, now seen corresponding path program 1 times [2022-02-21 03:05:34,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:34,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281021942] [2022-02-21 03:05:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:34,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:34,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} assume { :begin_inline_ULTIMATE.init } true; {28#true} is VALID [2022-02-21 03:05:34,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {30#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:05:34,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {30#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:05:34,263 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume !!(main_~y~0#1 >= 1); {30#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:05:34,263 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume !(main_~x~0#1 - 1 <= 2147483647); {29#false} is VALID [2022-02-21 03:05:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:34,265 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:34,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281021942] [2022-02-21 03:05:34,266 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281021942] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:34,266 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:34,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:34,268 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483047031] [2022-02-21 03:05:34,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:34,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:05:34,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:34,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:34,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:34,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:34,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:34,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:34,329 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.8125) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:34,452 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-02-21 03:05:34,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:34,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:05:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:34,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-02-21 03:05:34,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-02-21 03:05:34,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2022-02-21 03:05:34,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:34,570 INFO L225 Difference]: With dead ends: 61 [2022-02-21 03:05:34,570 INFO L226 Difference]: Without dead ends: 31 [2022-02-21 03:05:34,573 INFO L932 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 [2022-02-21 03:05:34,576 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:34,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:34,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-21 03:05:34,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-02-21 03:05:34,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:34,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 27 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,604 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 27 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,604 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 27 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:34,607 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-21 03:05:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-21 03:05:34,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:34,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:34,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2022-02-21 03:05:34,609 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2022-02-21 03:05:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:34,611 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-21 03:05:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-21 03:05:34,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:34,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:34,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:34,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-02-21 03:05:34,616 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 5 [2022-02-21 03:05:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:34,616 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-02-21 03:05:34,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-02-21 03:05:34,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:05:34,617 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:34,617 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:05:34,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:05:34,618 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:05:34,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:34,619 INFO L85 PathProgramCache]: Analyzing trace with hash 889513645, now seen corresponding path program 1 times [2022-02-21 03:05:34,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:34,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878727400] [2022-02-21 03:05:34,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:34,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:34,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {196#true} assume { :begin_inline_ULTIMATE.init } true; {196#true} is VALID [2022-02-21 03:05:34,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {196#true} is VALID [2022-02-21 03:05:34,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {198#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:34,650 INFO L290 TraceCheckUtils]: 3: Hoare triple {198#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~y~0#1 >= 1); {198#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:34,651 INFO L290 TraceCheckUtils]: 4: Hoare triple {198#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 - 1 <= 2147483647; {198#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:34,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 - 1 >= -2147483648); {197#false} is VALID [2022-02-21 03:05:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:34,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:34,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878727400] [2022-02-21 03:05:34,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878727400] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:34,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:34,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:34,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282717936] [2022-02-21 03:05:34,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:34,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:05:34,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:34,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:34,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:34,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:34,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:34,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:34,663 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:34,702 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-21 03:05:34,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:34,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:05:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-21 03:05:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-21 03:05:34,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-02-21 03:05:34,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:34,735 INFO L225 Difference]: With dead ends: 31 [2022-02-21 03:05:34,736 INFO L226 Difference]: Without dead ends: 30 [2022-02-21 03:05:34,736 INFO L932 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 [2022-02-21 03:05:34,743 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:34,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:34,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-21 03:05:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-21 03:05:34,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:34,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,759 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,760 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:34,763 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-21 03:05:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-02-21 03:05:34,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:34,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:34,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-21 03:05:34,767 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-21 03:05:34,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:34,771 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-21 03:05:34,771 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-02-21 03:05:34,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:34,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:34,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:34,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-02-21 03:05:34,777 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 6 [2022-02-21 03:05:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:34,778 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-02-21 03:05:34,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-02-21 03:05:34,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:05:34,779 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:34,779 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:34,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:05:34,779 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:05:34,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash 124122716, now seen corresponding path program 1 times [2022-02-21 03:05:34,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:34,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225491504] [2022-02-21 03:05:34,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:34,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:34,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {332#true} assume { :begin_inline_ULTIMATE.init } true; {332#true} is VALID [2022-02-21 03:05:34,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {332#true} is VALID [2022-02-21 03:05:34,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {332#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {334#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 20000)} is VALID [2022-02-21 03:05:34,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {334#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 20000)} assume !!(main_~y~0#1 >= 1); {334#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 20000)} is VALID [2022-02-21 03:05:34,836 INFO L290 TraceCheckUtils]: 4: Hoare triple {334#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 20000)} assume main_~x~0#1 - 1 <= 2147483647; {334#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 20000)} is VALID [2022-02-21 03:05:34,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 20000)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {335#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 19999)} is VALID [2022-02-21 03:05:34,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {335#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 19999)} assume !(main_~y~0#1 < main_~z~0#1); {335#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 19999)} is VALID [2022-02-21 03:05:34,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {335#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 19999)} assume !(main_~x~0#1 + main_~y~0#1 <= 2147483647); {333#false} is VALID [2022-02-21 03:05:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:34,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:34,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225491504] [2022-02-21 03:05:34,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225491504] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:34,840 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:34,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:05:34,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166218481] [2022-02-21 03:05:34,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:34,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:05:34,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:34,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:34,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:05:34,849 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:34,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:05:34,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:34,850 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:34,959 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-02-21 03:05:34,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:05:34,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:05:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:34,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-02-21 03:05:34,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:34,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-02-21 03:05:34,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2022-02-21 03:05:35,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:35,013 INFO L225 Difference]: With dead ends: 49 [2022-02-21 03:05:35,014 INFO L226 Difference]: Without dead ends: 48 [2022-02-21 03:05:35,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:35,029 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:35,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 19 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:35,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-21 03:05:35,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-02-21 03:05:35,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:35,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,044 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,044 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:35,051 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-02-21 03:05:35,052 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-02-21 03:05:35,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:35,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:35,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-21 03:05:35,053 INFO L87 Difference]: Start difference. First operand has 38 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-21 03:05:35,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:35,057 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-02-21 03:05:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-02-21 03:05:35,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:35,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:35,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:35,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-02-21 03:05:35,064 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 8 [2022-02-21 03:05:35,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:35,064 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-02-21 03:05:35,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-02-21 03:05:35,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:05:35,070 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:35,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:35,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:05:35,072 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:05:35,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:35,073 INFO L85 PathProgramCache]: Analyzing trace with hash 124122767, now seen corresponding path program 1 times [2022-02-21 03:05:35,073 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:35,073 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221831447] [2022-02-21 03:05:35,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:35,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:35,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {535#true} assume { :begin_inline_ULTIMATE.init } true; {535#true} is VALID [2022-02-21 03:05:35,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {535#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {535#true} is VALID [2022-02-21 03:05:35,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {535#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {537#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:05:35,126 INFO L290 TraceCheckUtils]: 3: Hoare triple {537#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume !!(main_~y~0#1 >= 1); {537#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:05:35,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {537#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume main_~x~0#1 - 1 <= 2147483647; {537#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:05:35,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {537#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {538#(<= |ULTIMATE.start_main_~x~0#1| 9999)} is VALID [2022-02-21 03:05:35,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {538#(<= |ULTIMATE.start_main_~x~0#1| 9999)} assume !!(main_~y~0#1 < main_~z~0#1); {538#(<= |ULTIMATE.start_main_~x~0#1| 9999)} is VALID [2022-02-21 03:05:35,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#(<= |ULTIMATE.start_main_~x~0#1| 9999)} assume !(1 + main_~x~0#1 <= 2147483647); {536#false} is VALID [2022-02-21 03:05:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:35,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:35,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221831447] [2022-02-21 03:05:35,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221831447] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:35,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:35,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:05:35,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699738241] [2022-02-21 03:05:35,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:35,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:05:35,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:35,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:35,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:05:35,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:35,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:05:35,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:35,151 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:35,277 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-02-21 03:05:35,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:05:35,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:05:35,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:35,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-21 03:05:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-21 03:05:35,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-02-21 03:05:35,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:35,329 INFO L225 Difference]: With dead ends: 64 [2022-02-21 03:05:35,329 INFO L226 Difference]: Without dead ends: 62 [2022-02-21 03:05:35,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:35,330 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:35,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 28 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-21 03:05:35,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2022-02-21 03:05:35,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:35,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 43 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 42 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,347 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 43 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 42 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,348 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 43 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 42 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:35,350 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2022-02-21 03:05:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2022-02-21 03:05:35,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:35,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:35,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 42 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 62 states. [2022-02-21 03:05:35,351 INFO L87 Difference]: Start difference. First operand has 43 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 42 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 62 states. [2022-02-21 03:05:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:35,353 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2022-02-21 03:05:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2022-02-21 03:05:35,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:35,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:35,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:35,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 42 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-02-21 03:05:35,356 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 8 [2022-02-21 03:05:35,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:35,356 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2022-02-21 03:05:35,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-02-21 03:05:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:05:35,357 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:35,357 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:35,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:05:35,357 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:05:35,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:35,358 INFO L85 PathProgramCache]: Analyzing trace with hash -447163028, now seen corresponding path program 1 times [2022-02-21 03:05:35,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:35,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571537479] [2022-02-21 03:05:35,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:35,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:35,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {791#true} assume { :begin_inline_ULTIMATE.init } true; {791#true} is VALID [2022-02-21 03:05:35,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {791#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {791#true} is VALID [2022-02-21 03:05:35,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {791#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {793#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:35,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {793#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~y~0#1 >= 1); {794#(<= 0 (+ 9999 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:35,424 INFO L290 TraceCheckUtils]: 4: Hoare triple {794#(<= 0 (+ 9999 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~x~0#1 - 1 <= 2147483647; {794#(<= 0 (+ 9999 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:35,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {794#(<= 0 (+ 9999 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {795#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:35,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {795#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} assume !(main_~y~0#1 < main_~z~0#1); {795#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:35,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {795#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {795#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:35,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {795#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} assume !(main_~x~0#1 + main_~y~0#1 >= -2147483648); {792#false} is VALID [2022-02-21 03:05:35,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:35,427 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:35,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571537479] [2022-02-21 03:05:35,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571537479] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:35,427 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:35,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:05:35,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721798710] [2022-02-21 03:05:35,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:35,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:05:35,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:35,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:35,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:05:35,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:35,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:05:35,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:05:35,438 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:35,604 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-02-21 03:05:35,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:05:35,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:05:35,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:35,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-21 03:05:35,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-21 03:05:35,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-02-21 03:05:35,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:35,647 INFO L225 Difference]: With dead ends: 60 [2022-02-21 03:05:35,647 INFO L226 Difference]: Without dead ends: 59 [2022-02-21 03:05:35,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:05:35,648 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:35,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 28 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:05:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-21 03:05:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2022-02-21 03:05:35,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:35,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 52 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 51 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,666 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 52 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 51 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,667 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 52 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 51 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:35,668 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-02-21 03:05:35,668 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-02-21 03:05:35,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:35,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:35,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 51 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 59 states. [2022-02-21 03:05:35,669 INFO L87 Difference]: Start difference. First operand has 52 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 51 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 59 states. [2022-02-21 03:05:35,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:35,671 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-02-21 03:05:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-02-21 03:05:35,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:35,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:35,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:35,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 51 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2022-02-21 03:05:35,674 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 9 [2022-02-21 03:05:35,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:35,674 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2022-02-21 03:05:35,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,674 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2022-02-21 03:05:35,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:05:35,675 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:35,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:35,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:05:35,675 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:05:35,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:35,676 INFO L85 PathProgramCache]: Analyzing trace with hash -447161458, now seen corresponding path program 1 times [2022-02-21 03:05:35,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:35,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199644231] [2022-02-21 03:05:35,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:35,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:35,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {1048#true} assume { :begin_inline_ULTIMATE.init } true; {1048#true} is VALID [2022-02-21 03:05:35,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1048#true} is VALID [2022-02-21 03:05:35,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {1050#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:35,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {1050#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~y~0#1 >= 1); {1050#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:35,711 INFO L290 TraceCheckUtils]: 4: Hoare triple {1050#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 - 1 <= 2147483647; {1050#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:35,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {1050#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {1051#(<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:35,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {1051#(<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~y~0#1 < main_~z~0#1); {1051#(<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:35,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {1051#(<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {1051#(<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:35,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {1051#(<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|))} assume !(1 + main_~x~0#1 >= -2147483648); {1049#false} is VALID [2022-02-21 03:05:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:35,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:35,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199644231] [2022-02-21 03:05:35,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199644231] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:35,714 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:35,714 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:05:35,714 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329407281] [2022-02-21 03:05:35,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:35,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:05:35,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:35,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:35,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:05:35,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:35,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:05:35,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:35,723 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:35,835 INFO L93 Difference]: Finished difference Result 97 states and 136 transitions. [2022-02-21 03:05:35,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:05:35,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:05:35,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-21 03:05:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-21 03:05:35,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-02-21 03:05:35,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:35,886 INFO L225 Difference]: With dead ends: 97 [2022-02-21 03:05:35,886 INFO L226 Difference]: Without dead ends: 95 [2022-02-21 03:05:35,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:35,888 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:35,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 27 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:35,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-21 03:05:35,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2022-02-21 03:05:35,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:35,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 87 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 86 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,928 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 87 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 86 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,928 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 87 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 86 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:35,931 INFO L93 Difference]: Finished difference Result 95 states and 127 transitions. [2022-02-21 03:05:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2022-02-21 03:05:35,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:35,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:35,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 86 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 95 states. [2022-02-21 03:05:35,932 INFO L87 Difference]: Start difference. First operand has 87 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 86 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 95 states. [2022-02-21 03:05:35,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:35,935 INFO L93 Difference]: Finished difference Result 95 states and 127 transitions. [2022-02-21 03:05:35,935 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2022-02-21 03:05:35,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:35,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:35,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:35,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 86 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2022-02-21 03:05:35,939 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 9 [2022-02-21 03:05:35,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:35,939 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2022-02-21 03:05:35,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2022-02-21 03:05:35,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:05:35,940 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:35,940 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:35,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:05:35,940 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:05:35,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:35,941 INFO L85 PathProgramCache]: Analyzing trace with hash -977103247, now seen corresponding path program 1 times [2022-02-21 03:05:35,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:35,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676008332] [2022-02-21 03:05:35,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:35,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:35,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {1462#true} assume { :begin_inline_ULTIMATE.init } true; {1462#true} is VALID [2022-02-21 03:05:35,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {1462#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1464#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} is VALID [2022-02-21 03:05:35,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {1464#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {1464#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} is VALID [2022-02-21 03:05:35,968 INFO L290 TraceCheckUtils]: 3: Hoare triple {1464#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} assume !!(main_~y~0#1 >= 1); {1464#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} is VALID [2022-02-21 03:05:35,968 INFO L290 TraceCheckUtils]: 4: Hoare triple {1464#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} assume main_~x~0#1 - 1 <= 2147483647; {1464#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} is VALID [2022-02-21 03:05:35,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {1464#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {1464#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} is VALID [2022-02-21 03:05:35,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {1464#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} assume !!(main_~y~0#1 < main_~z~0#1); {1464#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} is VALID [2022-02-21 03:05:35,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {1464#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} assume 1 + main_~x~0#1 <= 2147483647; {1464#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} is VALID [2022-02-21 03:05:35,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {1464#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {1464#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} is VALID [2022-02-21 03:05:35,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {1464#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} assume !(main_~z~0#1 - 1 <= 2147483647); {1463#false} is VALID [2022-02-21 03:05:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:35,971 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:35,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676008332] [2022-02-21 03:05:35,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676008332] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:35,971 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:35,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:35,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230123869] [2022-02-21 03:05:35,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:35,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 03:05:35,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:35,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:35,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:35,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:35,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:35,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:35,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:35,981 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:36,048 INFO L93 Difference]: Finished difference Result 87 states and 124 transitions. [2022-02-21 03:05:36,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:36,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 03:05:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:36,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-02-21 03:05:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-02-21 03:05:36,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2022-02-21 03:05:36,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:36,066 INFO L225 Difference]: With dead ends: 87 [2022-02-21 03:05:36,067 INFO L226 Difference]: Without dead ends: 86 [2022-02-21 03:05:36,067 INFO L932 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 [2022-02-21 03:05:36,068 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:36,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 16 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:36,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-21 03:05:36,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-02-21 03:05:36,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:36,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 85 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,108 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 85 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,109 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 85 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:36,111 INFO L93 Difference]: Finished difference Result 86 states and 118 transitions. [2022-02-21 03:05:36,111 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2022-02-21 03:05:36,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:36,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:36,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 85 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 86 states. [2022-02-21 03:05:36,112 INFO L87 Difference]: Start difference. First operand has 86 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 85 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 86 states. [2022-02-21 03:05:36,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:36,115 INFO L93 Difference]: Finished difference Result 86 states and 118 transitions. [2022-02-21 03:05:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2022-02-21 03:05:36,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:36,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:36,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:36,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:36,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 85 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2022-02-21 03:05:36,118 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 10 [2022-02-21 03:05:36,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:36,118 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2022-02-21 03:05:36,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,119 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2022-02-21 03:05:36,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-21 03:05:36,119 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:36,119 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:36,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 03:05:36,120 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:05:36,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:36,120 INFO L85 PathProgramCache]: Analyzing trace with hash -225429520, now seen corresponding path program 1 times [2022-02-21 03:05:36,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:36,121 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687311194] [2022-02-21 03:05:36,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:36,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:36,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {1846#true} assume { :begin_inline_ULTIMATE.init } true; {1846#true} is VALID [2022-02-21 03:05:36,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {1846#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1846#true} is VALID [2022-02-21 03:05:36,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {1846#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {1846#true} is VALID [2022-02-21 03:05:36,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {1846#true} assume !!(main_~y~0#1 >= 1); {1848#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:36,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {1848#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume main_~x~0#1 - 1 <= 2147483647; {1848#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:36,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {1848#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {1848#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:36,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {1848#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~y~0#1 < main_~z~0#1); {1849#(<= 2 |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:05:36,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {1849#(<= 2 |ULTIMATE.start_main_~z~0#1|)} assume 1 + main_~x~0#1 <= 2147483647; {1849#(<= 2 |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:05:36,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {1849#(<= 2 |ULTIMATE.start_main_~z~0#1|)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {1849#(<= 2 |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:05:36,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {1849#(<= 2 |ULTIMATE.start_main_~z~0#1|)} assume main_~z~0#1 - 1 <= 2147483647; {1849#(<= 2 |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:05:36,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {1849#(<= 2 |ULTIMATE.start_main_~z~0#1|)} assume !(main_~z~0#1 - 1 >= -2147483648); {1847#false} is VALID [2022-02-21 03:05:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:36,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:36,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687311194] [2022-02-21 03:05:36,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687311194] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:36,182 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:36,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:05:36,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166009536] [2022-02-21 03:05:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:36,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-21 03:05:36,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:36,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:36,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:05:36,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:36,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:05:36,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:36,191 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:36,272 INFO L93 Difference]: Finished difference Result 86 states and 118 transitions. [2022-02-21 03:05:36,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:05:36,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-21 03:05:36,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-02-21 03:05:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-02-21 03:05:36,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2022-02-21 03:05:36,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:36,290 INFO L225 Difference]: With dead ends: 86 [2022-02-21 03:05:36,290 INFO L226 Difference]: Without dead ends: 85 [2022-02-21 03:05:36,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:05:36,291 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:36,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 19 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-21 03:05:36,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-02-21 03:05:36,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:36,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 84 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,330 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 84 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,330 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 84 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:36,333 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions. [2022-02-21 03:05:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2022-02-21 03:05:36,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:36,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:36,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 84 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 85 states. [2022-02-21 03:05:36,334 INFO L87 Difference]: Start difference. First operand has 85 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 84 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 85 states. [2022-02-21 03:05:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:36,336 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions. [2022-02-21 03:05:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2022-02-21 03:05:36,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:36,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:36,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:36,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 84 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2022-02-21 03:05:36,340 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 11 [2022-02-21 03:05:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:36,340 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2022-02-21 03:05:36,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2022-02-21 03:05:36,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 03:05:36,341 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:36,341 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:36,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 03:05:36,341 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:05:36,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash -458138511, now seen corresponding path program 1 times [2022-02-21 03:05:36,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:36,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634507904] [2022-02-21 03:05:36,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:36,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:36,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {2229#true} assume { :begin_inline_ULTIMATE.init } true; {2229#true} is VALID [2022-02-21 03:05:36,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {2229#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2229#true} is VALID [2022-02-21 03:05:36,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {2231#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30000)} is VALID [2022-02-21 03:05:36,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {2231#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30000)} assume !!(main_~y~0#1 >= 1); {2231#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30000)} is VALID [2022-02-21 03:05:36,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {2231#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30000)} assume main_~x~0#1 - 1 <= 2147483647; {2231#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30000)} is VALID [2022-02-21 03:05:36,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {2231#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30000)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {2232#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 29998)} is VALID [2022-02-21 03:05:36,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {2232#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 29998)} assume !(main_~y~0#1 < main_~z~0#1); {2232#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 29998)} is VALID [2022-02-21 03:05:36,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {2232#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 29998)} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {2232#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 29998)} is VALID [2022-02-21 03:05:36,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {2232#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 29998)} assume main_~x~0#1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {2233#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 29998)} is VALID [2022-02-21 03:05:36,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {2233#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 29998)} assume !!(main_~y~0#1 >= 1); {2233#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 29998)} is VALID [2022-02-21 03:05:36,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {2233#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 29998)} assume main_~x~0#1 - 1 <= 2147483647; {2233#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 29998)} is VALID [2022-02-21 03:05:36,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {2233#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 29998)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {2234#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 29997)} is VALID [2022-02-21 03:05:36,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {2234#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 29997)} assume !(main_~y~0#1 < main_~z~0#1); {2234#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 29997)} is VALID [2022-02-21 03:05:36,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 29997)} assume !(main_~x~0#1 + main_~y~0#1 <= 2147483647); {2230#false} is VALID [2022-02-21 03:05:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:36,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:36,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634507904] [2022-02-21 03:05:36,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634507904] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:05:36,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45889721] [2022-02-21 03:05:36,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:36,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:36,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:36,403 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:05:36,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:05:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:36,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:05:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:36,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:05:36,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {2229#true} assume { :begin_inline_ULTIMATE.init } true; {2229#true} is VALID [2022-02-21 03:05:36,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {2229#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2229#true} is VALID [2022-02-21 03:05:36,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {2244#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} is VALID [2022-02-21 03:05:36,749 INFO L290 TraceCheckUtils]: 3: Hoare triple {2244#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} assume !!(main_~y~0#1 >= 1); {2244#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} is VALID [2022-02-21 03:05:36,751 INFO L290 TraceCheckUtils]: 4: Hoare triple {2244#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} assume main_~x~0#1 - 1 <= 2147483647; {2244#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} is VALID [2022-02-21 03:05:36,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {2244#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {2254#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 9999))} is VALID [2022-02-21 03:05:36,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {2254#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 9999))} assume !(main_~y~0#1 < main_~z~0#1); {2254#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 9999))} is VALID [2022-02-21 03:05:36,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {2254#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 9999))} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {2254#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 9999))} is VALID [2022-02-21 03:05:36,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {2254#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 9999))} assume main_~x~0#1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {2264#(and (<= |ULTIMATE.start_main_~y~0#1| (+ 10000 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 9999))} is VALID [2022-02-21 03:05:36,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {2264#(and (<= |ULTIMATE.start_main_~y~0#1| (+ 10000 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 9999))} assume !!(main_~y~0#1 >= 1); {2264#(and (<= |ULTIMATE.start_main_~y~0#1| (+ 10000 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 9999))} is VALID [2022-02-21 03:05:36,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {2264#(and (<= |ULTIMATE.start_main_~y~0#1| (+ 10000 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 9999))} assume main_~x~0#1 - 1 <= 2147483647; {2264#(and (<= |ULTIMATE.start_main_~y~0#1| (+ 10000 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 9999))} is VALID [2022-02-21 03:05:36,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {2264#(and (<= |ULTIMATE.start_main_~y~0#1| (+ 10000 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 9999))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {2274#(and (<= |ULTIMATE.start_main_~y~0#1| 19999) (<= |ULTIMATE.start_main_~x~0#1| 9998))} is VALID [2022-02-21 03:05:36,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {2274#(and (<= |ULTIMATE.start_main_~y~0#1| 19999) (<= |ULTIMATE.start_main_~x~0#1| 9998))} assume !(main_~y~0#1 < main_~z~0#1); {2274#(and (<= |ULTIMATE.start_main_~y~0#1| 19999) (<= |ULTIMATE.start_main_~x~0#1| 9998))} is VALID [2022-02-21 03:05:36,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {2274#(and (<= |ULTIMATE.start_main_~y~0#1| 19999) (<= |ULTIMATE.start_main_~x~0#1| 9998))} assume !(main_~x~0#1 + main_~y~0#1 <= 2147483647); {2230#false} is VALID [2022-02-21 03:05:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:36,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:09,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {2281#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume !(main_~x~0#1 + main_~y~0#1 <= 2147483647); {2230#false} is VALID [2022-02-21 03:06:09,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {2281#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume !(main_~y~0#1 < main_~z~0#1); {2281#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:06:09,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {2288#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483648)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {2281#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:06:09,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {2288#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483648)} assume main_~x~0#1 - 1 <= 2147483647; {2288#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483648)} is VALID [2022-02-21 03:06:09,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {2288#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483648)} assume !!(main_~y~0#1 >= 1); {2288#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483648)} is VALID [2022-02-21 03:06:09,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {2298#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 2147483648)} assume main_~x~0#1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {2288#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483648)} is VALID [2022-02-21 03:06:09,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {2298#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 2147483648)} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {2298#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 2147483648)} is VALID [2022-02-21 03:06:09,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {2298#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 2147483648)} assume !(main_~y~0#1 < main_~z~0#1); {2298#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 2147483648)} is VALID [2022-02-21 03:06:09,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {2308#(<= |ULTIMATE.start_main_~x~0#1| (+ (div (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 2147483648) 2) 1))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {2298#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 2147483648)} is VALID [2022-02-21 03:06:09,216 INFO L290 TraceCheckUtils]: 4: Hoare triple {2308#(<= |ULTIMATE.start_main_~x~0#1| (+ (div (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 2147483648) 2) 1))} assume main_~x~0#1 - 1 <= 2147483647; {2308#(<= |ULTIMATE.start_main_~x~0#1| (+ (div (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 2147483648) 2) 1))} is VALID [2022-02-21 03:06:09,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {2308#(<= |ULTIMATE.start_main_~x~0#1| (+ (div (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 2147483648) 2) 1))} assume !!(main_~y~0#1 >= 1); {2308#(<= |ULTIMATE.start_main_~x~0#1| (+ (div (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 2147483648) 2) 1))} is VALID [2022-02-21 03:06:09,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {2308#(<= |ULTIMATE.start_main_~x~0#1| (+ (div (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 2147483648) 2) 1))} is VALID [2022-02-21 03:06:09,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {2229#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2229#true} is VALID [2022-02-21 03:06:09,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {2229#true} assume { :begin_inline_ULTIMATE.init } true; {2229#true} is VALID [2022-02-21 03:06:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:09,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45889721] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:09,218 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:09,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-02-21 03:06:09,218 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653418539] [2022-02-21 03:06:09,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:09,219 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-21 03:06:09,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:09,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:09,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:09,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:06:09,260 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:09,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:06:09,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:06:09,261 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:10,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:10,006 INFO L93 Difference]: Finished difference Result 215 states and 282 transitions. [2022-02-21 03:06:10,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-21 03:06:10,006 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-21 03:06:10,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2022-02-21 03:06:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2022-02-21 03:06:10,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 139 transitions. [2022-02-21 03:06:10,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:10,144 INFO L225 Difference]: With dead ends: 215 [2022-02-21 03:06:10,144 INFO L226 Difference]: Without dead ends: 214 [2022-02-21 03:06:10,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=389, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:06:10,145 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 164 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:10,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 34 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:06:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-02-21 03:06:10,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 144. [2022-02-21 03:06:10,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:10,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 144 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 143 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:10,256 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 144 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 143 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:10,260 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 144 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 143 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:10,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:10,265 INFO L93 Difference]: Finished difference Result 214 states and 272 transitions. [2022-02-21 03:06:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 272 transitions. [2022-02-21 03:06:10,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:10,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:10,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 143 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 214 states. [2022-02-21 03:06:10,266 INFO L87 Difference]: Start difference. First operand has 144 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 143 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 214 states. [2022-02-21 03:06:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:10,271 INFO L93 Difference]: Finished difference Result 214 states and 272 transitions. [2022-02-21 03:06:10,271 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 272 transitions. [2022-02-21 03:06:10,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:10,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:10,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:10,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 143 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 191 transitions. [2022-02-21 03:06:10,274 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 191 transitions. Word has length 14 [2022-02-21 03:06:10,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:10,276 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 191 transitions. [2022-02-21 03:06:10,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:10,276 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 191 transitions. [2022-02-21 03:06:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 03:06:10,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:10,277 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:06:10,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 03:06:10,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:10,492 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:06:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1317391881, now seen corresponding path program 1 times [2022-02-21 03:06:10,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:10,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8365087] [2022-02-21 03:06:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:10,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {3204#true} assume { :begin_inline_ULTIMATE.init } true; {3204#true} is VALID [2022-02-21 03:06:10,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {3204#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {3204#true} is VALID [2022-02-21 03:06:10,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {3206#(<= |ULTIMATE.start_main_~y~0#1| 10000)} is VALID [2022-02-21 03:06:10,584 INFO L290 TraceCheckUtils]: 3: Hoare triple {3206#(<= |ULTIMATE.start_main_~y~0#1| 10000)} assume !!(main_~y~0#1 >= 1); {3206#(<= |ULTIMATE.start_main_~y~0#1| 10000)} is VALID [2022-02-21 03:06:10,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {3206#(<= |ULTIMATE.start_main_~y~0#1| 10000)} assume main_~x~0#1 - 1 <= 2147483647; {3206#(<= |ULTIMATE.start_main_~y~0#1| 10000)} is VALID [2022-02-21 03:06:10,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {3206#(<= |ULTIMATE.start_main_~y~0#1| 10000)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {3206#(<= |ULTIMATE.start_main_~y~0#1| 10000)} is VALID [2022-02-21 03:06:10,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {3206#(<= |ULTIMATE.start_main_~y~0#1| 10000)} assume !(main_~y~0#1 < main_~z~0#1); {3206#(<= |ULTIMATE.start_main_~y~0#1| 10000)} is VALID [2022-02-21 03:06:10,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {3206#(<= |ULTIMATE.start_main_~y~0#1| 10000)} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {3206#(<= |ULTIMATE.start_main_~y~0#1| 10000)} is VALID [2022-02-21 03:06:10,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {3206#(<= |ULTIMATE.start_main_~y~0#1| 10000)} assume main_~x~0#1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {3207#(<= |ULTIMATE.start_main_~y~0#1| (+ 10000 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:06:10,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {3207#(<= |ULTIMATE.start_main_~y~0#1| (+ 10000 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~y~0#1 >= 1); {3208#(<= 0 (+ 9998 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:06:10,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {3208#(<= 0 (+ 9998 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~x~0#1 - 1 <= 2147483647; {3208#(<= 0 (+ 9998 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:06:10,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {3208#(<= 0 (+ 9998 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {3209#(<= 0 (+ 9999 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:06:10,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {3209#(<= 0 (+ 9999 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} assume !(main_~y~0#1 < main_~z~0#1); {3209#(<= 0 (+ 9999 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:06:10,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {3209#(<= 0 (+ 9999 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {3209#(<= 0 (+ 9999 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:06:10,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {3209#(<= 0 (+ 9999 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} assume !(main_~x~0#1 + main_~y~0#1 >= -2147483648); {3205#false} is VALID [2022-02-21 03:06:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:10,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:10,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8365087] [2022-02-21 03:06:10,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8365087] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:10,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971979589] [2022-02-21 03:06:10,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:10,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:10,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:10,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:06:10,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:06:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:10,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:06:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:10,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:10,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {3204#true} assume { :begin_inline_ULTIMATE.init } true; {3204#true} is VALID [2022-02-21 03:06:10,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {3204#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {3204#true} is VALID [2022-02-21 03:06:10,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {3219#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:06:10,771 INFO L290 TraceCheckUtils]: 3: Hoare triple {3219#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~y~0#1 >= 1); {3219#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:06:10,772 INFO L290 TraceCheckUtils]: 4: Hoare triple {3219#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 - 1 <= 2147483647; {3219#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:06:10,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {3219#(<= 0 (+ 10000 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {3229#(<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:06:10,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {3229#(<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~y~0#1 < main_~z~0#1); {3229#(<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:06:10,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {3229#(<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {3229#(<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:06:10,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {3229#(<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {3229#(<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:06:10,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {3229#(<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~y~0#1 >= 1); {3242#(and (<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|)) (<= 1 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:06:10,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {3242#(and (<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|)) (<= 1 |ULTIMATE.start_main_~y~0#1|))} assume main_~x~0#1 - 1 <= 2147483647; {3242#(and (<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|)) (<= 1 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:06:10,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {3242#(and (<= 0 (+ 10001 |ULTIMATE.start_main_~x~0#1|)) (<= 1 |ULTIMATE.start_main_~y~0#1|))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {3249#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 0 (+ 10002 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:06:10,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {3249#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 0 (+ 10002 |ULTIMATE.start_main_~x~0#1|)))} assume !(main_~y~0#1 < main_~z~0#1); {3249#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 0 (+ 10002 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:06:10,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {3249#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 0 (+ 10002 |ULTIMATE.start_main_~x~0#1|)))} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {3249#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 0 (+ 10002 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:06:10,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {3249#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 0 (+ 10002 |ULTIMATE.start_main_~x~0#1|)))} assume !(main_~x~0#1 + main_~y~0#1 >= -2147483648); {3205#false} is VALID [2022-02-21 03:06:10,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:10,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:10,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {3259#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 2147483648))} assume !(main_~x~0#1 + main_~y~0#1 >= -2147483648); {3205#false} is VALID [2022-02-21 03:06:10,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {3259#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 2147483648))} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {3259#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:06:10,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {3259#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 2147483648))} assume !(main_~y~0#1 < main_~z~0#1); {3259#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:06:10,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {3269#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {3259#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:06:10,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {3269#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~x~0#1 - 1 <= 2147483647; {3269#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:06:10,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {3276#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume !!(main_~y~0#1 >= 1); {3269#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:06:10,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {3276#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume main_~x~0#1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {3276#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:06:10,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {3276#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {3276#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:06:10,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {3276#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume !(main_~y~0#1 < main_~z~0#1); {3276#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:06:10,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {3289#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {3276#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:06:10,909 INFO L290 TraceCheckUtils]: 4: Hoare triple {3289#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 - 1 <= 2147483647; {3289#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:06:10,909 INFO L290 TraceCheckUtils]: 3: Hoare triple {3289#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~y~0#1 >= 1); {3289#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:06:10,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {3289#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:06:10,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {3204#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {3204#true} is VALID [2022-02-21 03:06:10,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {3204#true} assume { :begin_inline_ULTIMATE.init } true; {3204#true} is VALID [2022-02-21 03:06:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:10,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971979589] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:10,911 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:10,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-02-21 03:06:10,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683700966] [2022-02-21 03:06:10,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:10,912 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-21 03:06:10,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:10,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:10,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:10,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:06:10,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:10,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:06:10,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:06:10,942 INFO L87 Difference]: Start difference. First operand 144 states and 191 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:11,968 INFO L93 Difference]: Finished difference Result 261 states and 361 transitions. [2022-02-21 03:06:11,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-21 03:06:11,968 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-21 03:06:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 124 transitions. [2022-02-21 03:06:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:11,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 124 transitions. [2022-02-21 03:06:11,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 124 transitions. [2022-02-21 03:06:12,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:12,095 INFO L225 Difference]: With dead ends: 261 [2022-02-21 03:06:12,095 INFO L226 Difference]: Without dead ends: 258 [2022-02-21 03:06:12,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=354, Invalid=768, Unknown=0, NotChecked=0, Total=1122 [2022-02-21 03:06:12,097 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 215 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:12,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 30 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:06:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-02-21 03:06:12,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 167. [2022-02-21 03:06:12,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:12,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 167 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 166 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:12,251 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 167 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 166 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:12,252 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 167 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 166 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:12,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:12,258 INFO L93 Difference]: Finished difference Result 258 states and 319 transitions. [2022-02-21 03:06:12,258 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 319 transitions. [2022-02-21 03:06:12,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:12,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:12,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 166 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 258 states. [2022-02-21 03:06:12,259 INFO L87 Difference]: Start difference. First operand has 167 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 166 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 258 states. [2022-02-21 03:06:12,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:12,264 INFO L93 Difference]: Finished difference Result 258 states and 319 transitions. [2022-02-21 03:06:12,265 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 319 transitions. [2022-02-21 03:06:12,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:12,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:12,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:12,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 166 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 210 transitions. [2022-02-21 03:06:12,269 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 210 transitions. Word has length 15 [2022-02-21 03:06:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:12,269 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 210 transitions. [2022-02-21 03:06:12,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 210 transitions. [2022-02-21 03:06:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 03:06:12,270 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:12,270 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:12,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-21 03:06:12,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-21 03:06:12,492 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:06:12,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:12,493 INFO L85 PathProgramCache]: Analyzing trace with hash -23572369, now seen corresponding path program 1 times [2022-02-21 03:06:12,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:12,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090531804] [2022-02-21 03:06:12,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:12,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:12,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {4385#true} assume { :begin_inline_ULTIMATE.init } true; {4385#true} is VALID [2022-02-21 03:06:12,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {4385#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {4385#true} is VALID [2022-02-21 03:06:12,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {4385#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:06:12,558 INFO L290 TraceCheckUtils]: 3: Hoare triple {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume !!(main_~y~0#1 >= 1); {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:06:12,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume main_~x~0#1 - 1 <= 2147483647; {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:06:12,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {4388#(<= |ULTIMATE.start_main_~x~0#1| 9999)} is VALID [2022-02-21 03:06:12,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {4388#(<= |ULTIMATE.start_main_~x~0#1| 9999)} assume !!(main_~y~0#1 < main_~z~0#1); {4388#(<= |ULTIMATE.start_main_~x~0#1| 9999)} is VALID [2022-02-21 03:06:12,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {4388#(<= |ULTIMATE.start_main_~x~0#1| 9999)} assume 1 + main_~x~0#1 <= 2147483647; {4388#(<= |ULTIMATE.start_main_~x~0#1| 9999)} is VALID [2022-02-21 03:06:12,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {4388#(<= |ULTIMATE.start_main_~x~0#1| 9999)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:06:12,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume main_~z~0#1 - 1 <= 2147483647; {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:06:12,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:06:12,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume !!(main_~y~0#1 < main_~z~0#1); {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:06:12,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume 1 + main_~x~0#1 <= 2147483647; {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:06:12,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4389#(<= |ULTIMATE.start_main_~x~0#1| 10001)} is VALID [2022-02-21 03:06:12,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {4389#(<= |ULTIMATE.start_main_~x~0#1| 10001)} assume main_~z~0#1 - 1 <= 2147483647; {4389#(<= |ULTIMATE.start_main_~x~0#1| 10001)} is VALID [2022-02-21 03:06:12,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {4389#(<= |ULTIMATE.start_main_~x~0#1| 10001)} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {4389#(<= |ULTIMATE.start_main_~x~0#1| 10001)} is VALID [2022-02-21 03:06:12,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {4389#(<= |ULTIMATE.start_main_~x~0#1| 10001)} assume !!(main_~y~0#1 < main_~z~0#1); {4389#(<= |ULTIMATE.start_main_~x~0#1| 10001)} is VALID [2022-02-21 03:06:12,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {4389#(<= |ULTIMATE.start_main_~x~0#1| 10001)} assume !(1 + main_~x~0#1 <= 2147483647); {4386#false} is VALID [2022-02-21 03:06:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:12,564 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:12,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090531804] [2022-02-21 03:06:12,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090531804] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:12,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247430758] [2022-02-21 03:06:12,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:12,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:12,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:12,592 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:06:12,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:06:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:12,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:06:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:12,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:12,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {4385#true} assume { :begin_inline_ULTIMATE.init } true; {4385#true} is VALID [2022-02-21 03:06:12,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {4385#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {4385#true} is VALID [2022-02-21 03:06:12,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {4385#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:06:12,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume !!(main_~y~0#1 >= 1); {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:06:12,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume main_~x~0#1 - 1 <= 2147483647; {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:06:12,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {4388#(<= |ULTIMATE.start_main_~x~0#1| 9999)} is VALID [2022-02-21 03:06:12,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {4388#(<= |ULTIMATE.start_main_~x~0#1| 9999)} assume !!(main_~y~0#1 < main_~z~0#1); {4388#(<= |ULTIMATE.start_main_~x~0#1| 9999)} is VALID [2022-02-21 03:06:12,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {4388#(<= |ULTIMATE.start_main_~x~0#1| 9999)} assume 1 + main_~x~0#1 <= 2147483647; {4388#(<= |ULTIMATE.start_main_~x~0#1| 9999)} is VALID [2022-02-21 03:06:12,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {4388#(<= |ULTIMATE.start_main_~x~0#1| 9999)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:06:12,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume main_~z~0#1 - 1 <= 2147483647; {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:06:12,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:06:12,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume !!(main_~y~0#1 < main_~z~0#1); {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:06:12,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume 1 + main_~x~0#1 <= 2147483647; {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} is VALID [2022-02-21 03:06:12,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {4387#(<= |ULTIMATE.start_main_~x~0#1| 10000)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4389#(<= |ULTIMATE.start_main_~x~0#1| 10001)} is VALID [2022-02-21 03:06:12,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {4389#(<= |ULTIMATE.start_main_~x~0#1| 10001)} assume main_~z~0#1 - 1 <= 2147483647; {4389#(<= |ULTIMATE.start_main_~x~0#1| 10001)} is VALID [2022-02-21 03:06:12,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {4389#(<= |ULTIMATE.start_main_~x~0#1| 10001)} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {4389#(<= |ULTIMATE.start_main_~x~0#1| 10001)} is VALID [2022-02-21 03:06:12,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {4389#(<= |ULTIMATE.start_main_~x~0#1| 10001)} assume !!(main_~y~0#1 < main_~z~0#1); {4389#(<= |ULTIMATE.start_main_~x~0#1| 10001)} is VALID [2022-02-21 03:06:12,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {4389#(<= |ULTIMATE.start_main_~x~0#1| 10001)} assume !(1 + main_~x~0#1 <= 2147483647); {4386#false} is VALID [2022-02-21 03:06:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:12,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:12,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {4444#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !(1 + main_~x~0#1 <= 2147483647); {4386#false} is VALID [2022-02-21 03:06:12,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {4444#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !!(main_~y~0#1 < main_~z~0#1); {4444#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:06:12,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {4444#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {4444#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:06:12,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {4444#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume main_~z~0#1 - 1 <= 2147483647; {4444#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:06:12,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {4457#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4444#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:06:12,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {4457#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~x~0#1 <= 2147483647; {4457#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:06:12,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {4457#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume !!(main_~y~0#1 < main_~z~0#1); {4457#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:06:12,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {4457#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {4457#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:06:12,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {4457#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume main_~z~0#1 - 1 <= 2147483647; {4457#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:06:12,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {4473#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4457#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:06:12,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {4473#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 1 + main_~x~0#1 <= 2147483647; {4473#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:06:12,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {4473#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume !!(main_~y~0#1 < main_~z~0#1); {4473#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:06:12,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {4457#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {4473#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:06:12,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {4457#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume main_~x~0#1 - 1 <= 2147483647; {4457#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:06:12,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {4457#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume !!(main_~y~0#1 >= 1); {4457#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:06:12,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {4385#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {4457#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:06:12,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {4385#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {4385#true} is VALID [2022-02-21 03:06:12,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {4385#true} assume { :begin_inline_ULTIMATE.init } true; {4385#true} is VALID [2022-02-21 03:06:12,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:12,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247430758] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:12,879 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:12,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 03:06:12,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444447784] [2022-02-21 03:06:12,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:12,880 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-21 03:06:12,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:12,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:12,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:12,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:06:12,909 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:12,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:06:12,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:06:12,910 INFO L87 Difference]: Start difference. First operand 167 states and 210 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:13,377 INFO L93 Difference]: Finished difference Result 377 states and 498 transitions. [2022-02-21 03:06:13,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:06:13,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-21 03:06:13,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-02-21 03:06:13,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-02-21 03:06:13,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 103 transitions. [2022-02-21 03:06:13,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:13,461 INFO L225 Difference]: With dead ends: 377 [2022-02-21 03:06:13,462 INFO L226 Difference]: Without dead ends: 375 [2022-02-21 03:06:13,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:06:13,463 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 66 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:13,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 44 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:06:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-02-21 03:06:13,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 274. [2022-02-21 03:06:13,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:13,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 274 states, 270 states have (on average 1.2592592592592593) internal successors, (340), 273 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:13,688 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 274 states, 270 states have (on average 1.2592592592592593) internal successors, (340), 273 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:13,688 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 274 states, 270 states have (on average 1.2592592592592593) internal successors, (340), 273 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:13,716 INFO L93 Difference]: Finished difference Result 375 states and 457 transitions. [2022-02-21 03:06:13,717 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 457 transitions. [2022-02-21 03:06:13,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:13,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:13,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 274 states, 270 states have (on average 1.2592592592592593) internal successors, (340), 273 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 375 states. [2022-02-21 03:06:13,719 INFO L87 Difference]: Start difference. First operand has 274 states, 270 states have (on average 1.2592592592592593) internal successors, (340), 273 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 375 states. [2022-02-21 03:06:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:13,729 INFO L93 Difference]: Finished difference Result 375 states and 457 transitions. [2022-02-21 03:06:13,729 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 457 transitions. [2022-02-21 03:06:13,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:13,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:13,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:13,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 270 states have (on average 1.2592592592592593) internal successors, (340), 273 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 340 transitions. [2022-02-21 03:06:13,745 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 340 transitions. Word has length 18 [2022-02-21 03:06:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:13,746 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 340 transitions. [2022-02-21 03:06:13,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 340 transitions. [2022-02-21 03:06:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 03:06:13,747 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:13,747 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:13,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:06:13,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:13,964 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:06:13,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:13,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1589103225, now seen corresponding path program 1 times [2022-02-21 03:06:13,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:13,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752922788] [2022-02-21 03:06:13,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:13,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:14,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {6051#true} assume { :begin_inline_ULTIMATE.init } true; {6051#true} is VALID [2022-02-21 03:06:14,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {6051#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {6051#true} is VALID [2022-02-21 03:06:14,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {6051#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {6053#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 20000)} is VALID [2022-02-21 03:06:14,048 INFO L290 TraceCheckUtils]: 3: Hoare triple {6053#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 20000)} assume !!(main_~y~0#1 >= 1); {6053#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 20000)} is VALID [2022-02-21 03:06:14,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {6053#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 20000)} assume main_~x~0#1 - 1 <= 2147483647; {6053#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 20000)} is VALID [2022-02-21 03:06:14,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {6053#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 20000)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} is VALID [2022-02-21 03:06:14,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} assume !!(main_~y~0#1 < main_~z~0#1); {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} is VALID [2022-02-21 03:06:14,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} assume 1 + main_~x~0#1 <= 2147483647; {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} is VALID [2022-02-21 03:06:14,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {6053#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 20000)} is VALID [2022-02-21 03:06:14,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {6053#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 20000)} assume main_~z~0#1 - 1 <= 2147483647; {6053#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 20000)} is VALID [2022-02-21 03:06:14,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {6053#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 20000)} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} is VALID [2022-02-21 03:06:14,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} assume !(main_~y~0#1 < main_~z~0#1); {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} is VALID [2022-02-21 03:06:14,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} is VALID [2022-02-21 03:06:14,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} assume main_~x~0#1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} is VALID [2022-02-21 03:06:14,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} assume !!(main_~y~0#1 >= 1); {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} is VALID [2022-02-21 03:06:14,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} assume main_~x~0#1 - 1 <= 2147483647; {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} is VALID [2022-02-21 03:06:14,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {6054#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19999)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {6055#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19998)} is VALID [2022-02-21 03:06:14,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {6055#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 19998)} assume !!(main_~y~0#1 < main_~z~0#1); {6056#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 19997)} is VALID [2022-02-21 03:06:14,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {6056#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 19997)} assume 1 + main_~x~0#1 <= 2147483647; {6056#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 19997)} is VALID [2022-02-21 03:06:14,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {6056#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 19997)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {6057#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 19998)} is VALID [2022-02-21 03:06:14,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {6057#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 19998)} assume main_~z~0#1 - 1 <= 2147483647; {6057#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 19998)} is VALID [2022-02-21 03:06:14,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {6057#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 19998)} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {6057#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 19998)} is VALID [2022-02-21 03:06:14,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {6057#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 19998)} assume !(main_~y~0#1 < main_~z~0#1); {6057#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 19998)} is VALID [2022-02-21 03:06:14,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {6057#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 19998)} assume !(main_~x~0#1 + main_~y~0#1 <= 2147483647); {6052#false} is VALID [2022-02-21 03:06:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:06:14,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:14,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752922788] [2022-02-21 03:06:14,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752922788] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:14,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609933743] [2022-02-21 03:06:14,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:14,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:14,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:14,058 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:06:14,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:06:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:14,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:06:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:14,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:14,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {6051#true} assume { :begin_inline_ULTIMATE.init } true; {6051#true} is VALID [2022-02-21 03:06:14,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {6051#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {6051#true} is VALID [2022-02-21 03:06:14,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {6051#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} is VALID [2022-02-21 03:06:14,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} assume !!(main_~y~0#1 >= 1); {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} is VALID [2022-02-21 03:06:14,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} assume main_~x~0#1 - 1 <= 2147483647; {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} is VALID [2022-02-21 03:06:14,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} is VALID [2022-02-21 03:06:14,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} assume !!(main_~y~0#1 < main_~z~0#1); {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} is VALID [2022-02-21 03:06:14,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} assume 1 + main_~x~0#1 <= 2147483647; {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} is VALID [2022-02-21 03:06:14,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} is VALID [2022-02-21 03:06:14,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} assume main_~z~0#1 - 1 <= 2147483647; {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} is VALID [2022-02-21 03:06:14,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} is VALID [2022-02-21 03:06:14,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {6067#(<= |ULTIMATE.start_main_~y~0#1| 10000)} assume !(main_~y~0#1 < main_~z~0#1); {6095#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-21 03:06:14,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {6095#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)))} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {6095#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-21 03:06:14,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {6095#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)))} assume main_~x~0#1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {6102#(and (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~z~0#1| 10000))} is VALID [2022-02-21 03:06:14,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {6102#(and (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~z~0#1| 10000))} assume !!(main_~y~0#1 >= 1); {6102#(and (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~z~0#1| 10000))} is VALID [2022-02-21 03:06:14,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {6102#(and (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~z~0#1| 10000))} assume main_~x~0#1 - 1 <= 2147483647; {6102#(and (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~z~0#1| 10000))} is VALID [2022-02-21 03:06:14,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {6102#(and (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~z~0#1| 10000))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {6112#(and (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| 1) |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~z~0#1| 10000))} is VALID [2022-02-21 03:06:14,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {6112#(and (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| 1) |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~z~0#1| 10000))} assume !!(main_~y~0#1 < main_~z~0#1); {6116#(and (< (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (< |ULTIMATE.start_main_~y~0#1| 10000))} is VALID [2022-02-21 03:06:14,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {6116#(and (< (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (< |ULTIMATE.start_main_~y~0#1| 10000))} assume 1 + main_~x~0#1 <= 2147483647; {6116#(and (< (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (< |ULTIMATE.start_main_~y~0#1| 10000))} is VALID [2022-02-21 03:06:14,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {6116#(and (< (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (< |ULTIMATE.start_main_~y~0#1| 10000))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {6123#(and (< |ULTIMATE.start_main_~x~0#1| 0) (< |ULTIMATE.start_main_~y~0#1| 10000))} is VALID [2022-02-21 03:06:14,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {6123#(and (< |ULTIMATE.start_main_~x~0#1| 0) (< |ULTIMATE.start_main_~y~0#1| 10000))} assume main_~z~0#1 - 1 <= 2147483647; {6123#(and (< |ULTIMATE.start_main_~x~0#1| 0) (< |ULTIMATE.start_main_~y~0#1| 10000))} is VALID [2022-02-21 03:06:14,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {6123#(and (< |ULTIMATE.start_main_~x~0#1| 0) (< |ULTIMATE.start_main_~y~0#1| 10000))} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {6123#(and (< |ULTIMATE.start_main_~x~0#1| 0) (< |ULTIMATE.start_main_~y~0#1| 10000))} is VALID [2022-02-21 03:06:14,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {6123#(and (< |ULTIMATE.start_main_~x~0#1| 0) (< |ULTIMATE.start_main_~y~0#1| 10000))} assume !(main_~y~0#1 < main_~z~0#1); {6123#(and (< |ULTIMATE.start_main_~x~0#1| 0) (< |ULTIMATE.start_main_~y~0#1| 10000))} is VALID [2022-02-21 03:06:14,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {6123#(and (< |ULTIMATE.start_main_~x~0#1| 0) (< |ULTIMATE.start_main_~y~0#1| 10000))} assume !(main_~x~0#1 + main_~y~0#1 <= 2147483647); {6052#false} is VALID [2022-02-21 03:06:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:06:14,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:30,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {6136#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume !(main_~x~0#1 + main_~y~0#1 <= 2147483647); {6052#false} is VALID [2022-02-21 03:06:30,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {6136#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume !(main_~y~0#1 < main_~z~0#1); {6136#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:06:30,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {6136#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {6136#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:06:30,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {6136#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume main_~z~0#1 - 1 <= 2147483647; {6136#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:06:30,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {6149#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {6136#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:06:30,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {6149#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} assume 1 + main_~x~0#1 <= 2147483647; {6149#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} is VALID [2022-02-21 03:06:30,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {6156#(or (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646) (not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)))} assume !!(main_~y~0#1 < main_~z~0#1); {6149#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} is VALID [2022-02-21 03:06:30,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {6160#(or (not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {6156#(or (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646) (not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-21 03:06:30,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {6160#(or (not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647))} assume main_~x~0#1 - 1 <= 2147483647; {6160#(or (not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647))} is VALID [2022-02-21 03:06:30,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {6160#(or (not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647))} assume !!(main_~y~0#1 >= 1); {6160#(or (not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647))} is VALID [2022-02-21 03:06:30,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {6170#(<= (* 2 |ULTIMATE.start_main_~z~0#1|) (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} assume main_~x~0#1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {6160#(or (not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647))} is VALID [2022-02-21 03:06:30,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {6170#(<= (* 2 |ULTIMATE.start_main_~z~0#1|) (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {6170#(<= (* 2 |ULTIMATE.start_main_~z~0#1|) (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:06:30,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} assume !(main_~y~0#1 < main_~z~0#1); {6170#(<= (* 2 |ULTIMATE.start_main_~z~0#1|) (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:06:30,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-21 03:06:30,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} assume main_~z~0#1 - 1 <= 2147483647; {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-21 03:06:30,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-21 03:06:30,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} assume 1 + main_~x~0#1 <= 2147483647; {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-21 03:06:30,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~y~0#1 < main_~z~0#1); {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-21 03:06:30,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-21 03:06:30,839 INFO L290 TraceCheckUtils]: 4: Hoare triple {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} assume main_~x~0#1 - 1 <= 2147483647; {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-21 03:06:30,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~y~0#1 >= 1); {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-21 03:06:30,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {6051#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {6177#(<= |ULTIMATE.start_main_~y~0#1| (div (+ 2147483649 |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-21 03:06:30,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {6051#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {6051#true} is VALID [2022-02-21 03:06:30,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {6051#true} assume { :begin_inline_ULTIMATE.init } true; {6051#true} is VALID [2022-02-21 03:06:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:06:30,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609933743] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:30,841 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:30,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2022-02-21 03:06:30,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158284346] [2022-02-21 03:06:30,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:30,841 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-21 03:06:30,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:30,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:30,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:30,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-21 03:06:30,900 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:30,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 03:06:30,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:06:30,901 INFO L87 Difference]: Start difference. First operand 274 states and 340 transitions. Second operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:32,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:32,760 INFO L93 Difference]: Finished difference Result 511 states and 647 transitions. [2022-02-21 03:06:32,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-21 03:06:32,760 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-21 03:06:32,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 69 transitions. [2022-02-21 03:06:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 69 transitions. [2022-02-21 03:06:32,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 69 transitions. [2022-02-21 03:06:32,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:32,845 INFO L225 Difference]: With dead ends: 511 [2022-02-21 03:06:32,845 INFO L226 Difference]: Without dead ends: 508 [2022-02-21 03:06:32,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=554, Invalid=1252, Unknown=0, NotChecked=0, Total=1806 [2022-02-21 03:06:32,847 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 117 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:32,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 7 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-21 03:06:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-02-21 03:06:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 305. [2022-02-21 03:06:33,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:33,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 508 states. Second operand has 305 states, 301 states have (on average 1.239202657807309) internal successors, (373), 304 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:33,198 INFO L74 IsIncluded]: Start isIncluded. First operand 508 states. Second operand has 305 states, 301 states have (on average 1.239202657807309) internal successors, (373), 304 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:33,198 INFO L87 Difference]: Start difference. First operand 508 states. Second operand has 305 states, 301 states have (on average 1.239202657807309) internal successors, (373), 304 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:33,213 INFO L93 Difference]: Finished difference Result 508 states and 601 transitions. [2022-02-21 03:06:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 601 transitions. [2022-02-21 03:06:33,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:33,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:33,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 301 states have (on average 1.239202657807309) internal successors, (373), 304 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 508 states. [2022-02-21 03:06:33,215 INFO L87 Difference]: Start difference. First operand has 305 states, 301 states have (on average 1.239202657807309) internal successors, (373), 304 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 508 states. [2022-02-21 03:06:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:33,229 INFO L93 Difference]: Finished difference Result 508 states and 601 transitions. [2022-02-21 03:06:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 601 transitions. [2022-02-21 03:06:33,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:33,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:33,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:33,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 301 states have (on average 1.239202657807309) internal successors, (373), 304 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 373 transitions. [2022-02-21 03:06:33,238 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 373 transitions. Word has length 24 [2022-02-21 03:06:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:33,239 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 373 transitions. [2022-02-21 03:06:33,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 373 transitions. [2022-02-21 03:06:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-21 03:06:33,240 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:33,240 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:33,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:06:33,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:33,451 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:06:33,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:33,452 INFO L85 PathProgramCache]: Analyzing trace with hash -809405228, now seen corresponding path program 2 times [2022-02-21 03:06:33,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:33,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602231414] [2022-02-21 03:06:33,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:33,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:33,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {8291#true} assume { :begin_inline_ULTIMATE.init } true; {8291#true} is VALID [2022-02-21 03:06:33,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {8291#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {8291#true} is VALID [2022-02-21 03:06:33,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {8291#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {8293#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 30000)} is VALID [2022-02-21 03:06:33,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {8293#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 30000)} assume !!(main_~y~0#1 >= 1); {8293#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 30000)} is VALID [2022-02-21 03:06:33,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {8293#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 30000)} assume main_~x~0#1 - 1 <= 2147483647; {8293#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 30000)} is VALID [2022-02-21 03:06:33,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {8293#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 30000)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {8294#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 29998)} is VALID [2022-02-21 03:06:33,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {8294#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 29998)} assume !!(main_~y~0#1 < main_~z~0#1); {8294#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 29998)} is VALID [2022-02-21 03:06:33,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {8294#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 29998)} assume 1 + main_~x~0#1 <= 2147483647; {8294#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 29998)} is VALID [2022-02-21 03:06:33,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {8294#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 29998)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8293#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 30000)} is VALID [2022-02-21 03:06:33,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {8293#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 30000)} assume main_~z~0#1 - 1 <= 2147483647; {8293#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 30000)} is VALID [2022-02-21 03:06:33,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {8293#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 30000)} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {8295#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 29999)} is VALID [2022-02-21 03:06:33,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {8295#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|) 29999)} assume !!(main_~y~0#1 < main_~z~0#1); {8296#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 29998)} is VALID [2022-02-21 03:06:33,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {8296#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 29998)} assume 1 + main_~x~0#1 <= 2147483647; {8296#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 29998)} is VALID [2022-02-21 03:06:33,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {8296#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 29998)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8297#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30000)} is VALID [2022-02-21 03:06:33,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {8297#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30000)} assume main_~z~0#1 - 1 <= 2147483647; {8297#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30000)} is VALID [2022-02-21 03:06:33,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {8297#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30000)} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {8297#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30000)} is VALID [2022-02-21 03:06:33,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {8297#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30000)} assume !!(main_~y~0#1 < main_~z~0#1); {8297#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30000)} is VALID [2022-02-21 03:06:33,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {8297#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30000)} assume 1 + main_~x~0#1 <= 2147483647; {8297#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30000)} is VALID [2022-02-21 03:06:33,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {8297#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30000)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8298#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30002)} is VALID [2022-02-21 03:06:33,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {8298#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30002)} assume main_~z~0#1 - 1 <= 2147483647; {8298#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30002)} is VALID [2022-02-21 03:06:33,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {8298#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30002)} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {8298#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30002)} is VALID [2022-02-21 03:06:33,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {8298#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30002)} assume !(main_~y~0#1 < main_~z~0#1); {8298#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30002)} is VALID [2022-02-21 03:06:33,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {8298#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30002)} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {8298#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30002)} is VALID [2022-02-21 03:06:33,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {8298#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) 30002)} assume main_~x~0#1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {8299#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 30002)} is VALID [2022-02-21 03:06:33,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {8299#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 30002)} assume !!(main_~y~0#1 >= 1); {8299#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 30002)} is VALID [2022-02-21 03:06:33,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {8299#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 30002)} assume main_~x~0#1 - 1 <= 2147483647; {8299#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 30002)} is VALID [2022-02-21 03:06:33,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {8299#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 30002)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {8300#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 30001)} is VALID [2022-02-21 03:06:33,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {8300#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 30001)} assume !(main_~y~0#1 < main_~z~0#1); {8300#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 30001)} is VALID [2022-02-21 03:06:33,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {8300#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 30001)} assume !(main_~x~0#1 + main_~y~0#1 <= 2147483647); {8292#false} is VALID [2022-02-21 03:06:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:33,572 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:33,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602231414] [2022-02-21 03:06:33,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602231414] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:33,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037775296] [2022-02-21 03:06:33,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:06:33,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:33,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:33,574 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:06:33,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:06:33,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:06:33,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:06:33,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:06:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:33,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:33,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {8291#true} assume { :begin_inline_ULTIMATE.init } true; {8291#true} is VALID [2022-02-21 03:06:33,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {8291#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {8291#true} is VALID [2022-02-21 03:06:33,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {8291#true} assume ((main_~x~0#1 <= 10000 && main_~x~0#1 >= -10000) && main_~y~0#1 <= 10000) && main_~z~0#1 <= 10000; {8310#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} is VALID [2022-02-21 03:06:33,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {8310#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} assume !!(main_~y~0#1 >= 1); {8310#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} is VALID [2022-02-21 03:06:33,969 INFO L290 TraceCheckUtils]: 4: Hoare triple {8310#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} assume main_~x~0#1 - 1 <= 2147483647; {8310#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} is VALID [2022-02-21 03:06:33,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {8310#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {8320#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 9999))} is VALID [2022-02-21 03:06:33,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {8320#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 9999))} assume !!(main_~y~0#1 < main_~z~0#1); {8320#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 9999))} is VALID [2022-02-21 03:06:33,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {8320#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 9999))} assume 1 + main_~x~0#1 <= 2147483647; {8320#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 9999))} is VALID [2022-02-21 03:06:33,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {8320#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 9999))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8310#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} is VALID [2022-02-21 03:06:33,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {8310#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} assume main_~z~0#1 - 1 <= 2147483647; {8310#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} is VALID [2022-02-21 03:06:33,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {8310#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {8310#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} is VALID [2022-02-21 03:06:33,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {8310#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} assume !!(main_~y~0#1 < main_~z~0#1); {8310#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} is VALID [2022-02-21 03:06:33,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {8310#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} assume 1 + main_~x~0#1 <= 2147483647; {8310#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} is VALID [2022-02-21 03:06:33,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {8310#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10000))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8345#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10001))} is VALID [2022-02-21 03:06:33,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {8345#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10001))} assume main_~z~0#1 - 1 <= 2147483647; {8345#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10001))} is VALID [2022-02-21 03:06:33,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {8345#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10001))} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {8345#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10001))} is VALID [2022-02-21 03:06:33,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {8345#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10001))} assume !!(main_~y~0#1 < main_~z~0#1); {8345#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10001))} is VALID [2022-02-21 03:06:33,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {8345#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10001))} assume 1 + main_~x~0#1 <= 2147483647; {8345#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10001))} is VALID [2022-02-21 03:06:33,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {8345#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10001))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8361#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10002))} is VALID [2022-02-21 03:06:33,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {8361#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10002))} assume main_~z~0#1 - 1 <= 2147483647; {8361#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10002))} is VALID [2022-02-21 03:06:33,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {8361#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10002))} assume main_~z~0#1 - 1 >= -2147483648;main_~z~0#1 := main_~z~0#1 - 1; {8361#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10002))} is VALID [2022-02-21 03:06:33,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {8361#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10002))} assume !(main_~y~0#1 < main_~z~0#1); {8361#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10002))} is VALID [2022-02-21 03:06:33,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {8361#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10002))} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {8361#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10002))} is VALID [2022-02-21 03:06:33,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {8361#(and (<= |ULTIMATE.start_main_~y~0#1| 10000) (<= |ULTIMATE.start_main_~x~0#1| 10002))} assume main_~x~0#1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := main_~x~0#1 + main_~y~0#1; {8377#(and (<= |ULTIMATE.start_main_~y~0#1| (+ 10000 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 10002))} is VALID [2022-02-21 03:06:33,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {8377#(and (<= |ULTIMATE.start_main_~y~0#1| (+ 10000 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 10002))} assume !!(main_~y~0#1 >= 1); {8377#(and (<= |ULTIMATE.start_main_~y~0#1| (+ 10000 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 10002))} is VALID [2022-02-21 03:06:33,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {8377#(and (<= |ULTIMATE.start_main_~y~0#1| (+ 10000 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 10002))} assume main_~x~0#1 - 1 <= 2147483647; {8377#(and (<= |ULTIMATE.start_main_~y~0#1| (+ 10000 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 10002))} is VALID [2022-02-21 03:06:33,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {8377#(and (<= |ULTIMATE.start_main_~y~0#1| (+ 10000 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 10002))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {8387#(and (<= |ULTIMATE.start_main_~x~0#1| 10001) (<= |ULTIMATE.start_main_~y~0#1| 20002))} is VALID [2022-02-21 03:06:33,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {8387#(and (<= |ULTIMATE.start_main_~x~0#1| 10001) (<= |ULTIMATE.start_main_~y~0#1| 20002))} assume !(main_~y~0#1 < main_~z~0#1); {8387#(and (<= |ULTIMATE.start_main_~x~0#1| 10001) (<= |ULTIMATE.start_main_~y~0#1| 20002))} is VALID [2022-02-21 03:06:33,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {8387#(and (<= |ULTIMATE.start_main_~x~0#1| 10001) (<= |ULTIMATE.start_main_~y~0#1| 20002))} assume !(main_~x~0#1 + main_~y~0#1 <= 2147483647); {8292#false} is VALID [2022-02-21 03:06:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:06:33,980 INFO L328 TraceCheckSpWp]: Computing backward predicates...