./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2.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/AliasDarteFeautrierGonnord-SAS2010-speedpldi2.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 086de8df2449d866ff611c83674a9697b7d09f2a2b1c5c922e46b0c1131a7d5c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:03:53,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:03:53,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:03:53,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:03:53,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:03:53,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:03:53,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:03:53,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:03:53,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:03:53,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:03:53,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:03:53,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:03:53,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:03:53,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:03:53,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:03:53,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:03:53,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:03:53,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:03:53,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:03:53,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:03:53,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:03:53,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:03:53,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:03:53,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:03:53,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:03:53,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:03:53,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:03:53,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:03:53,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:03:53,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:03:53,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:03:53,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:03:53,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:03:53,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:03:53,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:03:53,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:03:53,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:03:53,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:03:53,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:03:53,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:03:53,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:03:53,429 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:03:53,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:03:53,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:03:53,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:03:53,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:03:53,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:03:53,454 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:03:53,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:03:53,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:03:53,455 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:03:53,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:03:53,456 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:03:53,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:03:53,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:03:53,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:03:53,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:03:53,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:03:53,457 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:03:53,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:03:53,457 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:03:53,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:03:53,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:03:53,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:03:53,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:03:53,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:53,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:03:53,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:03:53,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:03:53,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:03:53,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:03:53,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:03:53,459 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 -> 086de8df2449d866ff611c83674a9697b7d09f2a2b1c5c922e46b0c1131a7d5c [2022-02-21 03:03:53,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:03:53,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:03:53,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:03:53,658 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:03:53,659 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:03:53,660 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2.c [2022-02-21 03:03:53,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60fadd094/484014ecc9c849b3adb3c2ee671193a9/FLAG60b2e928e [2022-02-21 03:03:54,072 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:03:54,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2.c [2022-02-21 03:03:54,091 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60fadd094/484014ecc9c849b3adb3c2ee671193a9/FLAG60b2e928e [2022-02-21 03:03:54,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60fadd094/484014ecc9c849b3adb3c2ee671193a9 [2022-02-21 03:03:54,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:03:54,106 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:03:54,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:54,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:03:54,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:03:54,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:54" (1/1) ... [2022-02-21 03:03:54,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a7ff60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:54, skipping insertion in model container [2022-02-21 03:03:54,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:54" (1/1) ... [2022-02-21 03:03:54,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:03:54,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:03:54,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:54,323 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:03:54,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:54,349 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:03:54,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:54 WrapperNode [2022-02-21 03:03:54,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:54,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:54,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:03:54,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:03:54,357 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:03:54" (1/1) ... [2022-02-21 03:03:54,361 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:03:54" (1/1) ... [2022-02-21 03:03:54,376 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2022-02-21 03:03:54,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:54,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:03:54,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:03:54,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:03:54,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:54" (1/1) ... [2022-02-21 03:03:54,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:54" (1/1) ... [2022-02-21 03:03:54,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:54" (1/1) ... [2022-02-21 03:03:54,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:54" (1/1) ... [2022-02-21 03:03:54,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:54" (1/1) ... [2022-02-21 03:03:54,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:54" (1/1) ... [2022-02-21 03:03:54,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:54" (1/1) ... [2022-02-21 03:03:54,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:03:54,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:03:54,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:03:54,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:03:54,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:54" (1/1) ... [2022-02-21 03:03:54,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:54,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:54,444 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:03:54,471 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:03:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:03:54,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:03:54,540 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:03:54,542 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:03:54,669 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:03:54,674 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:03:54,675 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:03:54,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:54 BoogieIcfgContainer [2022-02-21 03:03:54,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:03:54,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:03:54,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:03:54,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:03:54,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:03:54" (1/3) ... [2022-02-21 03:03:54,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e44ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:54, skipping insertion in model container [2022-02-21 03:03:54,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:54" (2/3) ... [2022-02-21 03:03:54,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e44ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:54, skipping insertion in model container [2022-02-21 03:03:54,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:54" (3/3) ... [2022-02-21 03:03:54,693 INFO L111 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-speedpldi2.c [2022-02-21 03:03:54,697 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:03:54,698 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-21 03:03:54,736 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:03:54,742 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:03:54,742 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-21 03:03:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 16 states have internal predecessors, (20), 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:03:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:03:54,760 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:54,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:03:54,761 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:54,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:54,775 INFO L85 PathProgramCache]: Analyzing trace with hash 889513677, now seen corresponding path program 1 times [2022-02-21 03:03:54,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:54,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864258413] [2022-02-21 03:03:54,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:54,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:54,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} assume { :begin_inline_ULTIMATE.init } true; {20#true} is VALID [2022-02-21 03:03:54,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {20#true} is VALID [2022-02-21 03:03:54,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; {22#(<= |ULTIMATE.start_main_~v2~0#1| 0)} is VALID [2022-02-21 03:03:54,984 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#(<= |ULTIMATE.start_main_~v2~0#1| 0)} assume !!(main_~v1~0#1 > 0); {22#(<= |ULTIMATE.start_main_~v2~0#1| 0)} is VALID [2022-02-21 03:03:54,984 INFO L290 TraceCheckUtils]: 4: Hoare triple {22#(<= |ULTIMATE.start_main_~v2~0#1| 0)} assume main_~v2~0#1 < main_~m~0#1; {22#(<= |ULTIMATE.start_main_~v2~0#1| 0)} is VALID [2022-02-21 03:03:54,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#(<= |ULTIMATE.start_main_~v2~0#1| 0)} assume !(1 + main_~v2~0#1 <= 2147483647); {21#false} is VALID [2022-02-21 03:03:54,986 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:03:54,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:54,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864258413] [2022-02-21 03:03:54,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864258413] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:54,989 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:54,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:54,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753649252] [2022-02-21 03:03:54,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:54,996 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:03:54,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:55,000 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:03:55,012 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:03:55,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:55,012 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:55,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:55,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:55,032 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 16 states have internal predecessors, (20), 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 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:03:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:55,109 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-21 03:03:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:55,110 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:03:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:55,112 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:03:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-02-21 03:03:55,120 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:03:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-02-21 03:03:55,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-02-21 03:03:55,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:55,172 INFO L225 Difference]: With dead ends: 30 [2022-02-21 03:03:55,173 INFO L226 Difference]: Without dead ends: 17 [2022-02-21 03:03:55,178 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:03:55,183 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:55,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:55,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-21 03:03:55,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-21 03:03:55,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:55,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 15 states have internal predecessors, (18), 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:03:55,208 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 15 states have internal predecessors, (18), 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:03:55,208 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 15 states have internal predecessors, (18), 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:03:55,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:55,211 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-21 03:03:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-21 03:03:55,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:55,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:55,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 15 states have internal predecessors, (18), 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 17 states. [2022-02-21 03:03:55,213 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 15 states have internal predecessors, (18), 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 17 states. [2022-02-21 03:03:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:55,220 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-21 03:03:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-21 03:03:55,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:55,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:55,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:55,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:55,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 15 states have internal predecessors, (18), 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:03:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-02-21 03:03:55,225 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 6 [2022-02-21 03:03:55,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:55,226 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-02-21 03:03:55,227 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:03:55,227 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-21 03:03:55,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:03:55,227 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:55,228 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:55,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:03:55,229 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:55,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1805120262, now seen corresponding path program 1 times [2022-02-21 03:03:55,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:55,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338995487] [2022-02-21 03:03:55,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:55,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:55,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#true} assume { :begin_inline_ULTIMATE.init } true; {112#true} is VALID [2022-02-21 03:03:55,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {112#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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {112#true} is VALID [2022-02-21 03:03:55,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {112#true} assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; {114#(<= 0 |ULTIMATE.start_main_~v2~0#1|)} is VALID [2022-02-21 03:03:55,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {114#(<= 0 |ULTIMATE.start_main_~v2~0#1|)} assume !!(main_~v1~0#1 > 0); {114#(<= 0 |ULTIMATE.start_main_~v2~0#1|)} is VALID [2022-02-21 03:03:55,263 INFO L290 TraceCheckUtils]: 4: Hoare triple {114#(<= 0 |ULTIMATE.start_main_~v2~0#1|)} assume main_~v2~0#1 < main_~m~0#1; {114#(<= 0 |ULTIMATE.start_main_~v2~0#1|)} is VALID [2022-02-21 03:03:55,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {114#(<= 0 |ULTIMATE.start_main_~v2~0#1|)} assume 1 + main_~v2~0#1 <= 2147483647; {114#(<= 0 |ULTIMATE.start_main_~v2~0#1|)} is VALID [2022-02-21 03:03:55,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {114#(<= 0 |ULTIMATE.start_main_~v2~0#1|)} assume !(1 + main_~v2~0#1 >= -2147483648); {113#false} is VALID [2022-02-21 03:03:55,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:03:55,264 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:55,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338995487] [2022-02-21 03:03:55,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338995487] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:55,265 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:55,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:55,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547623253] [2022-02-21 03:03:55,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:55,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-02-21 03:03:55,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:55,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:03:55,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:55,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:55,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:55,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:55,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:55,274 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:03:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:55,294 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-21 03:03:55,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:55,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-02-21 03:03:55,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:03:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-02-21 03:03:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:03:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-02-21 03:03:55,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 14 transitions. [2022-02-21 03:03:55,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:55,312 INFO L225 Difference]: With dead ends: 16 [2022-02-21 03:03:55,313 INFO L226 Difference]: Without dead ends: 15 [2022-02-21 03:03:55,314 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:03:55,315 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:55,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-21 03:03:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-21 03:03:55,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:55,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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:03:55,321 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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:03:55,321 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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:03:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:55,323 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:03:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:03:55,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:55,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:55,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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 15 states. [2022-02-21 03:03:55,324 INFO L87 Difference]: Start difference. First operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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 15 states. [2022-02-21 03:03:55,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:55,325 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:03:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:03:55,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:55,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:55,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:55,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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:03:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-21 03:03:55,327 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 7 [2022-02-21 03:03:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:55,328 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-21 03:03:55,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:03:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:03:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:03:55,329 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:55,329 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:55,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:03:55,330 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:55,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash 124153327, now seen corresponding path program 1 times [2022-02-21 03:03:55,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:55,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909654718] [2022-02-21 03:03:55,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:55,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {182#true} assume { :begin_inline_ULTIMATE.init } true; {182#true} is VALID [2022-02-21 03:03:55,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {184#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:55,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {184#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; {185#(<= |ULTIMATE.start_main_~v1~0#1| 2147483647)} is VALID [2022-02-21 03:03:55,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {185#(<= |ULTIMATE.start_main_~v1~0#1| 2147483647)} assume !!(main_~v1~0#1 > 0); {185#(<= |ULTIMATE.start_main_~v1~0#1| 2147483647)} is VALID [2022-02-21 03:03:55,403 INFO L290 TraceCheckUtils]: 4: Hoare triple {185#(<= |ULTIMATE.start_main_~v1~0#1| 2147483647)} assume main_~v2~0#1 < main_~m~0#1; {185#(<= |ULTIMATE.start_main_~v1~0#1| 2147483647)} is VALID [2022-02-21 03:03:55,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {185#(<= |ULTIMATE.start_main_~v1~0#1| 2147483647)} assume 1 + main_~v2~0#1 <= 2147483647; {185#(<= |ULTIMATE.start_main_~v1~0#1| 2147483647)} is VALID [2022-02-21 03:03:55,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {185#(<= |ULTIMATE.start_main_~v1~0#1| 2147483647)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {185#(<= |ULTIMATE.start_main_~v1~0#1| 2147483647)} is VALID [2022-02-21 03:03:55,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#(<= |ULTIMATE.start_main_~v1~0#1| 2147483647)} assume !(main_~v1~0#1 - 1 <= 2147483647); {183#false} is VALID [2022-02-21 03:03:55,407 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:03:55,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:55,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909654718] [2022-02-21 03:03:55,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909654718] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:55,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:55,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:03:55,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965253938] [2022-02-21 03:03:55,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:55,408 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:03:55,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:55,409 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:03:55,418 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:03:55,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:03:55,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:55,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:03:55,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:03:55,419 INFO L87 Difference]: Start difference. First operand 15 states and 17 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:03:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:55,467 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:03:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:03:55,468 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:03:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:55,468 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:03:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-02-21 03:03:55,469 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:03:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-02-21 03:03:55,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2022-02-21 03:03:55,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:55,482 INFO L225 Difference]: With dead ends: 15 [2022-02-21 03:03:55,482 INFO L226 Difference]: Without dead ends: 14 [2022-02-21 03:03:55,482 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:03:55,483 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:55,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-21 03:03:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 03:03:55,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:55,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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:03:55,493 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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:03:55,493 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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:03:55,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:55,494 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:03:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:03:55,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:55,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:55,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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 14 states. [2022-02-21 03:03:55,495 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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 14 states. [2022-02-21 03:03:55,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:55,496 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:03:55,496 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:03:55,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:55,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:55,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:55,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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:03:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-21 03:03:55,498 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2022-02-21 03:03:55,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:55,498 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:03:55,498 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:03:55,498 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:03:55,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:03:55,499 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:55,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:55,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:03:55,499 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:55,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:55,500 INFO L85 PathProgramCache]: Analyzing trace with hash -446214104, now seen corresponding path program 1 times [2022-02-21 03:03:55,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:55,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63840846] [2022-02-21 03:03:55,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:55,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:55,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#true} assume { :begin_inline_ULTIMATE.init } true; {251#true} is VALID [2022-02-21 03:03:55,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {251#true} is VALID [2022-02-21 03:03:55,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; {251#true} is VALID [2022-02-21 03:03:55,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {251#true} assume !!(main_~v1~0#1 > 0); {253#(<= 1 |ULTIMATE.start_main_~v1~0#1|)} is VALID [2022-02-21 03:03:55,526 INFO L290 TraceCheckUtils]: 4: Hoare triple {253#(<= 1 |ULTIMATE.start_main_~v1~0#1|)} assume main_~v2~0#1 < main_~m~0#1; {253#(<= 1 |ULTIMATE.start_main_~v1~0#1|)} is VALID [2022-02-21 03:03:55,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {253#(<= 1 |ULTIMATE.start_main_~v1~0#1|)} assume 1 + main_~v2~0#1 <= 2147483647; {253#(<= 1 |ULTIMATE.start_main_~v1~0#1|)} is VALID [2022-02-21 03:03:55,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {253#(<= 1 |ULTIMATE.start_main_~v1~0#1|)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {253#(<= 1 |ULTIMATE.start_main_~v1~0#1|)} is VALID [2022-02-21 03:03:55,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {253#(<= 1 |ULTIMATE.start_main_~v1~0#1|)} assume main_~v1~0#1 - 1 <= 2147483647; {253#(<= 1 |ULTIMATE.start_main_~v1~0#1|)} is VALID [2022-02-21 03:03:55,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {253#(<= 1 |ULTIMATE.start_main_~v1~0#1|)} assume !(main_~v1~0#1 - 1 >= -2147483648); {252#false} is VALID [2022-02-21 03:03:55,528 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:03:55,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:55,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63840846] [2022-02-21 03:03:55,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63840846] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:55,529 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:55,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:55,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393653729] [2022-02-21 03:03:55,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:55,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:03:55,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:55,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:03:55,536 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:03:55,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:55,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:55,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:55,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:55,538 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:03:55,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:55,593 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:03:55,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:55,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:03:55,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:03:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-02-21 03:03:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:03:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-02-21 03:03:55,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 13 transitions. [2022-02-21 03:03:55,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:55,604 INFO L225 Difference]: With dead ends: 15 [2022-02-21 03:03:55,605 INFO L226 Difference]: Without dead ends: 14 [2022-02-21 03:03:55,605 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:03:55,606 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:55,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-21 03:03:55,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-02-21 03:03:55,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:55,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:03:55,613 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:03:55,614 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:03:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:55,614 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:03:55,615 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:03:55,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:55,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:55,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 14 states. [2022-02-21 03:03:55,615 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 14 states. [2022-02-21 03:03:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:55,616 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:03:55,616 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:03:55,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:55,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:55,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:55,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:03:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-02-21 03:03:55,618 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 9 [2022-02-21 03:03:55,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:55,618 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-21 03:03:55,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:03:55,618 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-21 03:03:55,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-21 03:03:55,619 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:55,619 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:55,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:03:55,619 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:55,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:55,622 INFO L85 PathProgramCache]: Analyzing trace with hash -240547354, now seen corresponding path program 1 times [2022-02-21 03:03:55,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:55,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330868555] [2022-02-21 03:03:55,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:55,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:55,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {317#true} assume { :begin_inline_ULTIMATE.init } true; {317#true} is VALID [2022-02-21 03:03:55,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {317#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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {317#true} is VALID [2022-02-21 03:03:55,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {317#true} assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; {319#(<= |ULTIMATE.start_main_~v2~0#1| 0)} is VALID [2022-02-21 03:03:55,660 INFO L290 TraceCheckUtils]: 3: Hoare triple {319#(<= |ULTIMATE.start_main_~v2~0#1| 0)} assume !!(main_~v1~0#1 > 0); {319#(<= |ULTIMATE.start_main_~v2~0#1| 0)} is VALID [2022-02-21 03:03:55,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {319#(<= |ULTIMATE.start_main_~v2~0#1| 0)} assume main_~v2~0#1 < main_~m~0#1; {319#(<= |ULTIMATE.start_main_~v2~0#1| 0)} is VALID [2022-02-21 03:03:55,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {319#(<= |ULTIMATE.start_main_~v2~0#1| 0)} assume 1 + main_~v2~0#1 <= 2147483647; {319#(<= |ULTIMATE.start_main_~v2~0#1| 0)} is VALID [2022-02-21 03:03:55,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {319#(<= |ULTIMATE.start_main_~v2~0#1| 0)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} is VALID [2022-02-21 03:03:55,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} assume main_~v1~0#1 - 1 <= 2147483647; {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} is VALID [2022-02-21 03:03:55,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} assume main_~v1~0#1 - 1 >= -2147483648;main_~v1~0#1 := main_~v1~0#1 - 1; {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} is VALID [2022-02-21 03:03:55,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} assume !!(main_~v1~0#1 > 0); {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} is VALID [2022-02-21 03:03:55,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} assume main_~v2~0#1 < main_~m~0#1; {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} is VALID [2022-02-21 03:03:55,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} assume !(1 + main_~v2~0#1 <= 2147483647); {318#false} is VALID [2022-02-21 03:03:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:55,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:55,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330868555] [2022-02-21 03:03:55,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330868555] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:55,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193517436] [2022-02-21 03:03:55,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:55,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:55,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:55,668 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:03:55,670 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:03:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:55,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:55,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:55,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {317#true} assume { :begin_inline_ULTIMATE.init } true; {317#true} is VALID [2022-02-21 03:03:55,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {317#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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {317#true} is VALID [2022-02-21 03:03:55,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {317#true} assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; {319#(<= |ULTIMATE.start_main_~v2~0#1| 0)} is VALID [2022-02-21 03:03:55,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {319#(<= |ULTIMATE.start_main_~v2~0#1| 0)} assume !!(main_~v1~0#1 > 0); {319#(<= |ULTIMATE.start_main_~v2~0#1| 0)} is VALID [2022-02-21 03:03:55,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {319#(<= |ULTIMATE.start_main_~v2~0#1| 0)} assume main_~v2~0#1 < main_~m~0#1; {319#(<= |ULTIMATE.start_main_~v2~0#1| 0)} is VALID [2022-02-21 03:03:55,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {319#(<= |ULTIMATE.start_main_~v2~0#1| 0)} assume 1 + main_~v2~0#1 <= 2147483647; {319#(<= |ULTIMATE.start_main_~v2~0#1| 0)} is VALID [2022-02-21 03:03:55,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {319#(<= |ULTIMATE.start_main_~v2~0#1| 0)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} is VALID [2022-02-21 03:03:55,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} assume main_~v1~0#1 - 1 <= 2147483647; {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} is VALID [2022-02-21 03:03:55,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} assume main_~v1~0#1 - 1 >= -2147483648;main_~v1~0#1 := main_~v1~0#1 - 1; {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} is VALID [2022-02-21 03:03:55,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} assume !!(main_~v1~0#1 > 0); {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} is VALID [2022-02-21 03:03:55,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} assume main_~v2~0#1 < main_~m~0#1; {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} is VALID [2022-02-21 03:03:55,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {320#(<= |ULTIMATE.start_main_~v2~0#1| 1)} assume !(1 + main_~v2~0#1 <= 2147483647); {318#false} is VALID [2022-02-21 03:03:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:55,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:55,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {357#(<= |ULTIMATE.start_main_~v2~0#1| 2147483646)} assume !(1 + main_~v2~0#1 <= 2147483647); {318#false} is VALID [2022-02-21 03:03:55,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {357#(<= |ULTIMATE.start_main_~v2~0#1| 2147483646)} assume main_~v2~0#1 < main_~m~0#1; {357#(<= |ULTIMATE.start_main_~v2~0#1| 2147483646)} is VALID [2022-02-21 03:03:55,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {357#(<= |ULTIMATE.start_main_~v2~0#1| 2147483646)} assume !!(main_~v1~0#1 > 0); {357#(<= |ULTIMATE.start_main_~v2~0#1| 2147483646)} is VALID [2022-02-21 03:03:55,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {357#(<= |ULTIMATE.start_main_~v2~0#1| 2147483646)} assume main_~v1~0#1 - 1 >= -2147483648;main_~v1~0#1 := main_~v1~0#1 - 1; {357#(<= |ULTIMATE.start_main_~v2~0#1| 2147483646)} is VALID [2022-02-21 03:03:55,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {357#(<= |ULTIMATE.start_main_~v2~0#1| 2147483646)} assume main_~v1~0#1 - 1 <= 2147483647; {357#(<= |ULTIMATE.start_main_~v2~0#1| 2147483646)} is VALID [2022-02-21 03:03:55,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {373#(<= |ULTIMATE.start_main_~v2~0#1| 2147483645)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {357#(<= |ULTIMATE.start_main_~v2~0#1| 2147483646)} is VALID [2022-02-21 03:03:55,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {373#(<= |ULTIMATE.start_main_~v2~0#1| 2147483645)} assume 1 + main_~v2~0#1 <= 2147483647; {373#(<= |ULTIMATE.start_main_~v2~0#1| 2147483645)} is VALID [2022-02-21 03:03:55,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {373#(<= |ULTIMATE.start_main_~v2~0#1| 2147483645)} assume main_~v2~0#1 < main_~m~0#1; {373#(<= |ULTIMATE.start_main_~v2~0#1| 2147483645)} is VALID [2022-02-21 03:03:55,914 INFO L290 TraceCheckUtils]: 3: Hoare triple {373#(<= |ULTIMATE.start_main_~v2~0#1| 2147483645)} assume !!(main_~v1~0#1 > 0); {373#(<= |ULTIMATE.start_main_~v2~0#1| 2147483645)} is VALID [2022-02-21 03:03:55,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {317#true} assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; {373#(<= |ULTIMATE.start_main_~v2~0#1| 2147483645)} is VALID [2022-02-21 03:03:55,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {317#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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {317#true} is VALID [2022-02-21 03:03:55,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {317#true} assume { :begin_inline_ULTIMATE.init } true; {317#true} is VALID [2022-02-21 03:03:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:55,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193517436] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:55,916 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:55,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:03:55,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438050756] [2022-02-21 03:03:55,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:55,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 12 [2022-02-21 03:03:55,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:55,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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:03:55,936 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:03:55,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:03:55,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:55,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:03:55,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:55,938 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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:03:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:56,016 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-02-21 03:03:56,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:03:56,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 12 [2022-02-21 03:03:56,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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:03:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-02-21 03:03:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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:03:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-02-21 03:03:56,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-02-21 03:03:56,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:56,046 INFO L225 Difference]: With dead ends: 32 [2022-02-21 03:03:56,046 INFO L226 Difference]: Without dead ends: 31 [2022-02-21 03:03:56,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:56,050 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:56,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 23 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-21 03:03:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-21 03:03:56,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:56,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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:03:56,067 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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:03:56,067 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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:03:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:56,069 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-21 03:03:56,069 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-02-21 03:03:56,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:56,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:56,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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:03:56,070 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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:03:56,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:56,071 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-21 03:03:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-02-21 03:03:56,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:56,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:56,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:56,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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:03:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-02-21 03:03:56,073 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 12 [2022-02-21 03:03:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:56,073 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-02-21 03:03:56,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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:03:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-02-21 03:03:56,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-21 03:03:56,074 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:56,074 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2022-02-21 03:03:56,091 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:03:56,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:56,290 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:56,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:56,291 INFO L85 PathProgramCache]: Analyzing trace with hash -241374543, now seen corresponding path program 2 times [2022-02-21 03:03:56,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:56,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743344492] [2022-02-21 03:03:56,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:56,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:56,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {526#true} assume { :begin_inline_ULTIMATE.init } true; {526#true} is VALID [2022-02-21 03:03:56,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~v1~0#1 > 0); {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,350 INFO L290 TraceCheckUtils]: 4: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v2~0#1 < main_~m~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 >= -2147483648;main_~v1~0#1 := main_~v1~0#1 - 1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~v1~0#1 > 0); {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v2~0#1 < main_~m~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 >= -2147483648;main_~v1~0#1 := main_~v1~0#1 - 1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~v1~0#1 > 0); {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v2~0#1 < main_~m~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 >= -2147483648;main_~v1~0#1 := main_~v1~0#1 - 1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~v1~0#1 > 0); {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v2~0#1 < main_~m~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 >= -2147483648;main_~v1~0#1 := main_~v1~0#1 - 1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~v1~0#1 > 0); {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v2~0#1 < main_~m~0#1; {529#(<= |ULTIMATE.start_main_~v2~0#1| 2147483646)} is VALID [2022-02-21 03:03:56,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {529#(<= |ULTIMATE.start_main_~v2~0#1| 2147483646)} assume !(1 + main_~v2~0#1 <= 2147483647); {527#false} is VALID [2022-02-21 03:03:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-02-21 03:03:56,360 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:56,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743344492] [2022-02-21 03:03:56,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743344492] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:56,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766772183] [2022-02-21 03:03:56,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:03:56,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:56,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:56,362 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:03:56,363 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:03:56,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:03:56,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:56,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:56,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:56,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {526#true} assume { :begin_inline_ULTIMATE.init } true; {526#true} is VALID [2022-02-21 03:03:56,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~v1~0#1 > 0); {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v2~0#1 < main_~m~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 >= -2147483648;main_~v1~0#1 := main_~v1~0#1 - 1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~v1~0#1 > 0); {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v2~0#1 < main_~m~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 >= -2147483648;main_~v1~0#1 := main_~v1~0#1 - 1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~v1~0#1 > 0); {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v2~0#1 < main_~m~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 >= -2147483648;main_~v1~0#1 := main_~v1~0#1 - 1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~v1~0#1 > 0); {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v2~0#1 < main_~m~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 >= -2147483648;main_~v1~0#1 := main_~v1~0#1 - 1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~v1~0#1 > 0); {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v2~0#1 < main_~m~0#1; {529#(<= |ULTIMATE.start_main_~v2~0#1| 2147483646)} is VALID [2022-02-21 03:03:56,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {529#(<= |ULTIMATE.start_main_~v2~0#1| 2147483646)} assume !(1 + main_~v2~0#1 <= 2147483647); {527#false} is VALID [2022-02-21 03:03:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-02-21 03:03:56,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:56,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {529#(<= |ULTIMATE.start_main_~v2~0#1| 2147483646)} assume !(1 + main_~v2~0#1 <= 2147483647); {527#false} is VALID [2022-02-21 03:03:56,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v2~0#1 < main_~m~0#1; {529#(<= |ULTIMATE.start_main_~v2~0#1| 2147483646)} is VALID [2022-02-21 03:03:56,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~v1~0#1 > 0); {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 >= -2147483648;main_~v1~0#1 := main_~v1~0#1 - 1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v2~0#1 < main_~m~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~v1~0#1 > 0); {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 >= -2147483648;main_~v1~0#1 := main_~v1~0#1 - 1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v2~0#1 < main_~m~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~v1~0#1 > 0); {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 >= -2147483648;main_~v1~0#1 := main_~v1~0#1 - 1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v2~0#1 < main_~m~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~v1~0#1 > 0); {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 >= -2147483648;main_~v1~0#1 := main_~v1~0#1 - 1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v1~0#1 - 1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 >= -2147483648;main_~v2~0#1 := 1 + main_~v2~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~v2~0#1 <= 2147483647; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,695 INFO L290 TraceCheckUtils]: 4: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~v2~0#1 < main_~m~0#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~v1~0#1 > 0); {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {528#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:56,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {526#true} assume { :begin_inline_ULTIMATE.init } true; {526#true} is VALID [2022-02-21 03:03:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-02-21 03:03:56,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766772183] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:56,698 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:56,699 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-02-21 03:03:56,699 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555688761] [2022-02-21 03:03:56,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:56,700 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 30 [2022-02-21 03:03:56,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:56,700 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:03:56,708 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:03:56,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:03:56,709 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:56,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:03:56,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:03:56,710 INFO L87 Difference]: Start difference. First operand 31 states and 36 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:03:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:56,752 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-21 03:03:56,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:03:56,753 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 30 [2022-02-21 03:03:56,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:56,753 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:03:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-02-21 03:03:56,753 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:03:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-02-21 03:03:56,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 14 transitions. [2022-02-21 03:03:56,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:56,774 INFO L225 Difference]: With dead ends: 31 [2022-02-21 03:03:56,774 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:03:56,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 1 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:03:56,775 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:56,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 10 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:03:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:03:56,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:56,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:03:56,776 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:03:56,776 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:03:56,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:56,776 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:03:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:03:56,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:56,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:56,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-21 03:03:56,776 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-21 03:03:56,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:56,776 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:03:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:03:56,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:56,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:56,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:56,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:03:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:03:56,777 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-02-21 03:03:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:56,777 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:03:56,777 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:03:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:03:56,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:56,779 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-02-21 03:03:56,779 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-02-21 03:03:56,780 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-02-21 03:03:56,780 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-02-21 03:03:56,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:03:56,995 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,SelfDestructingSolverStorable5 [2022-02-21 03:03:56,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:03:57,044 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-02-21 03:03:57,045 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:03:57,045 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2022-02-21 03:03:57,045 INFO L861 garLoopResultBuilder]: At program point L29(lines 13 30) the Hoare annotation is: true [2022-02-21 03:03:57,047 INFO L858 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-02-21 03:03:57,047 INFO L858 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2022-02-21 03:03:57,047 INFO L858 garLoopResultBuilder]: For program point L21(lines 21 26) no Hoare annotation was computed. [2022-02-21 03:03:57,047 INFO L854 garLoopResultBuilder]: At program point L21-2(lines 20 27) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~v2~0#1|) (<= |ULTIMATE.start_main_~v1~0#1| 2147483647) (<= |ULTIMATE.start_main_~m~0#1| 2147483647)) [2022-02-21 03:03:57,048 INFO L858 garLoopResultBuilder]: For program point L17(lines 17 28) no Hoare annotation was computed. [2022-02-21 03:03:57,048 INFO L858 garLoopResultBuilder]: For program point L17-1(lines 17 28) no Hoare annotation was computed. [2022-02-21 03:03:57,048 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:03:57,048 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-02-21 03:03:57,048 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2022-02-21 03:03:57,048 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:03:57,048 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:03:57,048 INFO L858 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-02-21 03:03:57,048 INFO L858 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-02-21 03:03:57,051 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-02-21 03:03:57,052 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:03:57,055 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:03:57,055 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:03:57,055 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-21 03:03:57,055 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-21 03:03:57,055 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2022-02-21 03:03:57,055 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2022-02-21 03:03:57,055 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:03:57,055 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2022-02-21 03:03:57,055 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:03:57,055 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:03:57,055 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:03:57,055 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:03:57,055 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:03:57,055 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:03:57,055 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:03:57,056 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:03:57,056 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:03:57,056 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:03:57,056 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-21 03:03:57,056 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-21 03:03:57,056 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-21 03:03:57,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:03:57 BoogieIcfgContainer [2022-02-21 03:03:57,065 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:03:57,066 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:03:57,066 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:03:57,066 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:03:57,067 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:54" (3/4) ... [2022-02-21 03:03:57,069 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:03:57,076 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-21 03:03:57,076 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 03:03:57,077 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:03:57,099 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:03:57,099 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:03:57,100 INFO L158 Benchmark]: Toolchain (without parser) took 2994.20ms. Allocated memory was 94.4MB in the beginning and 134.2MB in the end (delta: 39.8MB). Free memory was 62.1MB in the beginning and 89.4MB in the end (delta: -27.3MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-02-21 03:03:57,101 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory was 49.8MB in the beginning and 49.8MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:03:57,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.41ms. Allocated memory is still 94.4MB. Free memory was 61.9MB in the beginning and 71.3MB in the end (delta: -9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:03:57,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.27ms. Allocated memory is still 94.4MB. Free memory was 71.3MB in the beginning and 69.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:03:57,101 INFO L158 Benchmark]: Boogie Preprocessor took 20.82ms. Allocated memory is still 94.4MB. Free memory was 69.9MB in the beginning and 69.0MB in the end (delta: 903.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:03:57,102 INFO L158 Benchmark]: RCFGBuilder took 276.64ms. Allocated memory is still 94.4MB. Free memory was 69.0MB in the beginning and 58.7MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:03:57,102 INFO L158 Benchmark]: TraceAbstraction took 2388.01ms. Allocated memory was 94.4MB in the beginning and 134.2MB in the end (delta: 39.8MB). Free memory was 58.5MB in the beginning and 91.5MB in the end (delta: -33.0MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2022-02-21 03:03:57,102 INFO L158 Benchmark]: Witness Printer took 33.59ms. Allocated memory is still 134.2MB. Free memory was 91.5MB in the beginning and 89.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:03:57,104 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory was 49.8MB in the beginning and 49.8MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.41ms. Allocated memory is still 94.4MB. Free memory was 61.9MB in the beginning and 71.3MB in the end (delta: -9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.27ms. Allocated memory is still 94.4MB. Free memory was 71.3MB in the beginning and 69.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.82ms. Allocated memory is still 94.4MB. Free memory was 69.9MB in the beginning and 69.0MB in the end (delta: 903.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 276.64ms. Allocated memory is still 94.4MB. Free memory was 69.0MB in the beginning and 58.7MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2388.01ms. Allocated memory was 94.4MB in the beginning and 134.2MB in the end (delta: 39.8MB). Free memory was 58.5MB in the beginning and 91.5MB in the end (delta: -33.0MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Witness Printer took 33.59ms. Allocated memory is still 134.2MB. Free memory was 91.5MB in the beginning and 89.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 53 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 8 NumberOfFragments, 14 HoareAnnotationTreeSize, 2 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 86 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 114 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 404 SizeOfPredicates, 2 NumberOfNonLiveVariables, 42 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 132/153 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((n <= 2147483647 && 0 <= v2) && v1 <= 2147483647) && m <= 2147483647 RESULT: Ultimate proved your program to be correct! [2022-02-21 03:03:57,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE