./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination4.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/NonTermination4.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 737f9e8de77d32d8f03e01ab5f98ec0cb28ec6478e68b10a65bdf5d745ac7455 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:02:44,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:02:44,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:02:44,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:02:44,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:02:44,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:02:44,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:02:44,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:02:44,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:02:44,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:02:44,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:02:44,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:02:44,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:02:44,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:02:44,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:02:44,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:02:44,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:02:44,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:02:44,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:02:44,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:02:44,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:02:44,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:02:44,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:02:44,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:02:44,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:02:44,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:02:44,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:02:44,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:02:44,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:02:44,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:02:44,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:02:44,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:02:44,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:02:44,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:02:44,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:02:44,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:02:44,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:02:44,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:02:44,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:02:44,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:02:44,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:02:44,970 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:02:44,992 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:02:44,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:02:44,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:02:44,993 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:02:44,993 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:02:44,993 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:02:44,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:02:44,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:02:44,994 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:02:44,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:02:44,995 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:02:44,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:02:44,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:02:44,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:02:44,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:02:44,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:02:44,996 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:02:44,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:02:44,996 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:02:44,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:02:44,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:02:44,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:02:44,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:02:44,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:02:44,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:02:44,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:02:44,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:02:44,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:02:44,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:02:44,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:02:44,998 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 -> 737f9e8de77d32d8f03e01ab5f98ec0cb28ec6478e68b10a65bdf5d745ac7455 [2022-02-21 03:02:45,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:02:45,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:02:45,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:02:45,216 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:02:45,216 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:02:45,217 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination4.c [2022-02-21 03:02:45,290 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf56af079/8af7b28194c745a6a94f642ff46e85ef/FLAGbdc205415 [2022-02-21 03:02:45,654 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:02:45,655 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination4.c [2022-02-21 03:02:45,659 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf56af079/8af7b28194c745a6a94f642ff46e85ef/FLAGbdc205415 [2022-02-21 03:02:45,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf56af079/8af7b28194c745a6a94f642ff46e85ef [2022-02-21 03:02:45,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:02:45,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:02:45,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:02:45,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:02:45,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:02:45,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:02:45" (1/1) ... [2022-02-21 03:02:45,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23513500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:45, skipping insertion in model container [2022-02-21 03:02:45,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:02:45" (1/1) ... [2022-02-21 03:02:45,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:02:45,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:02:45,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:02:45,837 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:02:45,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:02:45,852 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:02:45,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:45 WrapperNode [2022-02-21 03:02:45,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:02:45,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:02:45,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:02:45,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:02:45,859 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:02:45" (1/1) ... [2022-02-21 03:02:45,863 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:02:45" (1/1) ... [2022-02-21 03:02:45,881 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2022-02-21 03:02:45,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:02:45,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:02:45,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:02:45,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:02:45,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:45" (1/1) ... [2022-02-21 03:02:45,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:45" (1/1) ... [2022-02-21 03:02:45,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:45" (1/1) ... [2022-02-21 03:02:45,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:45" (1/1) ... [2022-02-21 03:02:45,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:45" (1/1) ... [2022-02-21 03:02:45,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:45" (1/1) ... [2022-02-21 03:02:45,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:45" (1/1) ... [2022-02-21 03:02:45,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:02:45,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:02:45,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:02:45,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:02:45,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:45" (1/1) ... [2022-02-21 03:02:45,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:02:45,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:45,939 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:02:45,955 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:02:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:02:45,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:02:46,007 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:02:46,009 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:02:46,075 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:02:46,080 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:02:46,080 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:02:46,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:02:46 BoogieIcfgContainer [2022-02-21 03:02:46,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:02:46,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:02:46,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:02:46,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:02:46,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:02:45" (1/3) ... [2022-02-21 03:02:46,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec5623a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:02:46, skipping insertion in model container [2022-02-21 03:02:46,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:45" (2/3) ... [2022-02-21 03:02:46,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec5623a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:02:46, skipping insertion in model container [2022-02-21 03:02:46,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:02:46" (3/3) ... [2022-02-21 03:02:46,087 INFO L111 eAbstractionObserver]: Analyzing ICFG NonTermination4.c [2022-02-21 03:02:46,091 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:02:46,091 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-21 03:02:46,122 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:02:46,126 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:02:46,127 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-21 03:02:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.6) internal successors, (16), 14 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:02:46,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 03:02:46,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:46,161 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 03:02:46,162 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:02:46,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash 925796, now seen corresponding path program 1 times [2022-02-21 03:02:46,185 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:46,185 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385436822] [2022-02-21 03:02:46,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:46,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:46,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {18#true} assume { :begin_inline_ULTIMATE.init } true; {18#true} is VALID [2022-02-21 03:02:46,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {18#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {20#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:46,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 >= 0); {20#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:46,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {20#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !(2 * main_~x~0#1 <= 2147483647); {19#false} is VALID [2022-02-21 03:02:46,317 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:02:46,318 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:46,318 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385436822] [2022-02-21 03:02:46,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385436822] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:46,319 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:46,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:46,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87960939] [2022-02-21 03:02:46,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:46,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-02-21 03:02:46,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:46,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:02:46,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:46,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:46,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:46,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:46,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:46,359 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.6) internal successors, (16), 14 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 has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:02:46,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:46,423 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-21 03:02:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:46,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-02-21 03:02:46,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:02:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-21 03:02:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:02:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-21 03:02:46,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-02-21 03:02:46,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:46,472 INFO L225 Difference]: With dead ends: 23 [2022-02-21 03:02:46,472 INFO L226 Difference]: Without dead ends: 14 [2022-02-21 03:02:46,475 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:02:46,480 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:46,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 15 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:46,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-21 03:02:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-02-21 03:02:46,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:46,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 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:02:46,509 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 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:02:46,510 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 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:02:46,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:46,516 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-21 03:02:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-21 03:02:46,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:46,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:46,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 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:02:46,517 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 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:02:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:46,520 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-21 03:02:46,520 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-21 03:02:46,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:46,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:46,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:46,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 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:02:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-02-21 03:02:46,526 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 4 [2022-02-21 03:02:46,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:46,527 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-02-21 03:02:46,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:02:46,528 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-21 03:02:46,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:02:46,528 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:46,529 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:02:46,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:02:46,529 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:02:46,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:46,533 INFO L85 PathProgramCache]: Analyzing trace with hash 28699721, now seen corresponding path program 1 times [2022-02-21 03:02:46,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:46,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886508813] [2022-02-21 03:02:46,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:46,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:46,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {93#true} assume { :begin_inline_ULTIMATE.init } true; {93#true} is VALID [2022-02-21 03:02:46,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {93#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {95#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:46,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {95#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~x~0#1 >= 0); {95#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:46,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {95#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume 2 * main_~x~0#1 <= 2147483647; {95#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:46,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {95#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume !(2 * main_~x~0#1 >= -2147483648); {94#false} is VALID [2022-02-21 03:02:46,569 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:02:46,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:46,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886508813] [2022-02-21 03:02:46,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886508813] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:46,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:46,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:46,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353580343] [2022-02-21 03:02:46,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:46,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:02:46,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:46,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:46,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:46,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:46,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:46,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:46,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:46,579 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:46,598 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-02-21 03:02:46,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:46,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:02:46,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:02:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:02:46,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2022-02-21 03:02:46,612 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:02:46,613 INFO L225 Difference]: With dead ends: 13 [2022-02-21 03:02:46,613 INFO L226 Difference]: Without dead ends: 12 [2022-02-21 03:02:46,613 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:02:46,614 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:46,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 7 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:46,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-21 03:02:46,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 03:02:46,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:46,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 11 states have internal predecessors, (12), 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:02:46,621 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 11 states have internal predecessors, (12), 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:02:46,621 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 11 states have internal predecessors, (12), 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:02:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:46,622 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-02-21 03:02:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-02-21 03:02:46,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:46,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:46,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 11 states have internal predecessors, (12), 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 12 states. [2022-02-21 03:02:46,624 INFO L87 Difference]: Start difference. First operand has 12 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 11 states have internal predecessors, (12), 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 12 states. [2022-02-21 03:02:46,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:46,625 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-02-21 03:02:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-02-21 03:02:46,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:46,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:46,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:46,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 11 states have internal predecessors, (12), 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:02:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-02-21 03:02:46,628 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 5 [2022-02-21 03:02:46,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:46,628 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-02-21 03:02:46,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-02-21 03:02:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:02:46,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:46,629 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:02:46,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:02:46,629 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:02:46,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:46,630 INFO L85 PathProgramCache]: Analyzing trace with hash 889691398, now seen corresponding path program 1 times [2022-02-21 03:02:46,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:46,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319455361] [2022-02-21 03:02:46,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:46,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:46,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} assume { :begin_inline_ULTIMATE.init } true; {151#true} is VALID [2022-02-21 03:02:46,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {153#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:46,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {153#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 >= 0); {153#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:46,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {153#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 2 * main_~x~0#1 <= 2147483647; {153#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:46,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {153#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {153#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:46,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {153#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(3 * main_~y~0#1 <= 2147483647); {152#false} is VALID [2022-02-21 03:02:46,666 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:02:46,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:46,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319455361] [2022-02-21 03:02:46,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319455361] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:46,666 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:46,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:46,666 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574382078] [2022-02-21 03:02:46,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:46,668 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:02:46,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:46,668 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:02:46,676 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:02:46,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:46,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:46,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:46,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:46,678 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:46,699 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-21 03:02:46,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:46,699 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:02:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:46,700 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:02:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-21 03:02:46,701 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:02:46,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-21 03:02:46,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2022-02-21 03:02:46,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:46,718 INFO L225 Difference]: With dead ends: 16 [2022-02-21 03:02:46,718 INFO L226 Difference]: Without dead ends: 15 [2022-02-21 03:02:46,718 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:02:46,724 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:46,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 12 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:46,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-21 03:02:46,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-02-21 03:02:46,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:46,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 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:02:46,730 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 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:02:46,730 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 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:02:46,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:46,730 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-21 03:02:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-21 03:02:46,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:46,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:46,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 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:02:46,731 INFO L87 Difference]: Start difference. First operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 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:02:46,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:46,732 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-21 03:02:46,732 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-21 03:02:46,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:46,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:46,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:46,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 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:02:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-02-21 03:02:46,733 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 6 [2022-02-21 03:02:46,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:46,733 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-02-21 03:02:46,733 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:02:46,733 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-21 03:02:46,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:02:46,733 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:46,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:46,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:02:46,734 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:02:46,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:46,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1810629611, now seen corresponding path program 1 times [2022-02-21 03:02:46,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:46,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516831574] [2022-02-21 03:02:46,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:46,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:46,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {220#true} assume { :begin_inline_ULTIMATE.init } true; {220#true} is VALID [2022-02-21 03:02:46,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {222#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:02:46,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~x~0#1 >= 0); {222#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:02:46,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {222#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume 2 * main_~x~0#1 <= 2147483647; {222#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:02:46,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {222#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {222#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:02:46,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume 3 * main_~y~0#1 <= 2147483647; {222#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:02:46,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {222#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !(3 * main_~y~0#1 >= -2147483648); {221#false} is VALID [2022-02-21 03:02:46,755 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:02:46,756 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:46,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516831574] [2022-02-21 03:02:46,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516831574] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:46,756 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:46,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:46,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347421449] [2022-02-21 03:02:46,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:46,756 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:02:46,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:46,757 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:02:46,761 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:02:46,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:46,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:46,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:46,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:46,762 INFO L87 Difference]: Start difference. First operand 14 states and 14 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:02:46,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:46,775 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-21 03:02:46,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:46,775 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:02:46,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:46,775 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:02:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-02-21 03:02:46,776 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:02:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-02-21 03:02:46,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2022-02-21 03:02:46,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:46,783 INFO L225 Difference]: With dead ends: 14 [2022-02-21 03:02:46,783 INFO L226 Difference]: Without dead ends: 13 [2022-02-21 03:02:46,784 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:02:46,785 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:46,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 7 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:46,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-21 03:02:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:02:46,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:46,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 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:02:46,790 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 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:02:46,790 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 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:02:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:46,791 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-02-21 03:02:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-21 03:02:46,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:46,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:46,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 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 13 states. [2022-02-21 03:02:46,792 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 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 13 states. [2022-02-21 03:02:46,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:46,792 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-02-21 03:02:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-21 03:02:46,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:46,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:46,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:46,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 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:02:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-02-21 03:02:46,793 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2022-02-21 03:02:46,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:46,793 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-02-21 03:02:46,793 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:02:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-21 03:02:46,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:02:46,794 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:46,794 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:46,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:02:46,794 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:02:46,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:46,795 INFO L85 PathProgramCache]: Analyzing trace with hash 553302605, now seen corresponding path program 1 times [2022-02-21 03:02:46,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:46,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740430900] [2022-02-21 03:02:46,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:46,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:46,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {282#true} assume { :begin_inline_ULTIMATE.init } true; {282#true} is VALID [2022-02-21 03:02:46,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {282#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {284#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:46,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {284#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 >= 0); {284#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:46,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {284#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 2 * main_~x~0#1 <= 2147483647; {284#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:46,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {284#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {285#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:46,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 3 * main_~y~0#1 <= 2147483647; {285#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:46,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {285#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {285#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:46,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {285#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 >= 0); {285#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:46,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {285#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !(2 * main_~x~0#1 <= 2147483647); {283#false} is VALID [2022-02-21 03:02:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:46,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:46,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740430900] [2022-02-21 03:02:46,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740430900] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:46,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646227517] [2022-02-21 03:02:46,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:46,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:46,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:46,825 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:02:46,840 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:02:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:46,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:02:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:46,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:46,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {282#true} assume { :begin_inline_ULTIMATE.init } true; {282#true} is VALID [2022-02-21 03:02:46,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {282#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {284#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:46,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {284#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 >= 0); {284#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:46,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {284#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 2 * main_~x~0#1 <= 2147483647; {284#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:46,967 INFO L290 TraceCheckUtils]: 4: Hoare triple {284#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {285#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:46,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 3 * main_~y~0#1 <= 2147483647; {285#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:46,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {285#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {285#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:46,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {285#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 >= 0); {285#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:46,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {285#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !(2 * main_~x~0#1 <= 2147483647); {283#false} is VALID [2022-02-21 03:02:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:46,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:47,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} assume !(2 * main_~x~0#1 <= 2147483647); {283#false} is VALID [2022-02-21 03:02:47,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} assume !!(main_~x~0#1 >= 0); {313#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} is VALID [2022-02-21 03:02:47,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {313#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} is VALID [2022-02-21 03:02:47,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} assume 3 * main_~y~0#1 <= 2147483647; {313#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} is VALID [2022-02-21 03:02:47,065 INFO L290 TraceCheckUtils]: 4: Hoare triple {326#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {313#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} is VALID [2022-02-21 03:02:47,065 INFO L290 TraceCheckUtils]: 3: Hoare triple {326#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} assume 2 * main_~x~0#1 <= 2147483647; {326#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} is VALID [2022-02-21 03:02:47,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} assume !!(main_~x~0#1 >= 0); {326#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} is VALID [2022-02-21 03:02:47,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {282#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {326#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} is VALID [2022-02-21 03:02:47,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {282#true} assume { :begin_inline_ULTIMATE.init } true; {282#true} is VALID [2022-02-21 03:02:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:47,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646227517] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:47,076 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:47,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:02:47,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319795467] [2022-02-21 03:02:47,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:47,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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) Word has length 9 [2022-02-21 03:02:47,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:47,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:02:47,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:47,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:02:47,090 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:47,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:02:47,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:47,094 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:02:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:47,163 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-21 03:02:47,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:02:47,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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) Word has length 9 [2022-02-21 03:02:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:02:47,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-02-21 03:02:47,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:02:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-02-21 03:02:47,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-02-21 03:02:47,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:47,184 INFO L225 Difference]: With dead ends: 29 [2022-02-21 03:02:47,185 INFO L226 Difference]: Without dead ends: 28 [2022-02-21 03:02:47,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 1 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:02:47,185 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:47,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 20 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:47,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-21 03:02:47,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-02-21 03:02:47,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:47,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 26 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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:02:47,197 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 26 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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:02:47,197 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 26 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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:02:47,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:47,198 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-02-21 03:02:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-02-21 03:02:47,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:47,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:47,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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 28 states. [2022-02-21 03:02:47,199 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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 28 states. [2022-02-21 03:02:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:47,200 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-02-21 03:02:47,201 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-02-21 03:02:47,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:47,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:47,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:47,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:47,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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:02:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-02-21 03:02:47,202 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 9 [2022-02-21 03:02:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:47,202 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-02-21 03:02:47,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:02:47,203 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-21 03:02:47,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-21 03:02:47,203 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:47,203 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:02:47,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:02:47,419 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:02:47,420 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:02:47,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:47,420 INFO L85 PathProgramCache]: Analyzing trace with hash -852139857, now seen corresponding path program 1 times [2022-02-21 03:02:47,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:47,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546160609] [2022-02-21 03:02:47,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:47,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:47,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {459#true} assume { :begin_inline_ULTIMATE.init } true; {459#true} is VALID [2022-02-21 03:02:47,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {459#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:47,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 >= 0); {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:47,449 INFO L290 TraceCheckUtils]: 3: Hoare triple {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 2 * main_~x~0#1 <= 2147483647; {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:47,450 INFO L290 TraceCheckUtils]: 4: Hoare triple {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:47,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 3 * main_~y~0#1 <= 2147483647; {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:47,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {462#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:47,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume !!(main_~x~0#1 >= 0); {462#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:47,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 2 * main_~x~0#1 <= 2147483647; {462#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:47,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {462#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:47,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {462#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume !(3 * main_~y~0#1 <= 2147483647); {460#false} is VALID [2022-02-21 03:02:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:47,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:47,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546160609] [2022-02-21 03:02:47,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546160609] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:47,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260420534] [2022-02-21 03:02:47,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:47,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:47,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:47,455 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:02:47,463 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:02:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:47,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:02:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:47,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:47,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {459#true} assume { :begin_inline_ULTIMATE.init } true; {459#true} is VALID [2022-02-21 03:02:47,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {459#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:47,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 >= 0); {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:47,530 INFO L290 TraceCheckUtils]: 3: Hoare triple {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 2 * main_~x~0#1 <= 2147483647; {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:47,530 INFO L290 TraceCheckUtils]: 4: Hoare triple {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:47,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 3 * main_~y~0#1 <= 2147483647; {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:47,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {461#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {462#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:47,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume !!(main_~x~0#1 >= 0); {462#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:47,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 2 * main_~x~0#1 <= 2147483647; {462#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:47,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {462#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:47,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {462#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume !(3 * main_~y~0#1 <= 2147483647); {460#false} is VALID [2022-02-21 03:02:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:47,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:47,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {496#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume !(3 * main_~y~0#1 <= 2147483647); {460#false} is VALID [2022-02-21 03:02:47,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {496#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {496#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:02:47,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {496#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume 2 * main_~x~0#1 <= 2147483647; {496#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:02:47,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {496#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume !!(main_~x~0#1 >= 0); {496#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:02:47,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {509#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {496#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:02:47,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} assume 3 * main_~y~0#1 <= 2147483647; {509#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} is VALID [2022-02-21 03:02:47,594 INFO L290 TraceCheckUtils]: 4: Hoare triple {509#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {509#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} is VALID [2022-02-21 03:02:47,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {509#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} assume 2 * main_~x~0#1 <= 2147483647; {509#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} is VALID [2022-02-21 03:02:47,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {509#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} assume !!(main_~x~0#1 >= 0); {509#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} is VALID [2022-02-21 03:02:47,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {459#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {509#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} is VALID [2022-02-21 03:02:47,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {459#true} assume { :begin_inline_ULTIMATE.init } true; {459#true} is VALID [2022-02-21 03:02:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:47,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260420534] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:47,601 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:47,601 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:02:47,601 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346283127] [2022-02-21 03:02:47,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:47,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-21 03:02:47,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:47,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:02:47,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:47,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:02:47,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:47,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:02:47,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:47,618 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:02:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:47,674 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-21 03:02:47,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:02:47,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-21 03:02:47,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:02:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-02-21 03:02:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:02:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-02-21 03:02:47,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-02-21 03:02:47,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:47,703 INFO L225 Difference]: With dead ends: 29 [2022-02-21 03:02:47,703 INFO L226 Difference]: Without dead ends: 28 [2022-02-21 03:02:47,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 1 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:02:47,706 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:47,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 27 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:47,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-21 03:02:47,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-21 03:02:47,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:47,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 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:02:47,719 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 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:02:47,719 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 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:02:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:47,720 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-02-21 03:02:47,720 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-02-21 03:02:47,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:47,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:47,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 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 28 states. [2022-02-21 03:02:47,721 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 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 28 states. [2022-02-21 03:02:47,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:47,721 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-02-21 03:02:47,722 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-02-21 03:02:47,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:47,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:47,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:47,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 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:02:47,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-02-21 03:02:47,723 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 11 [2022-02-21 03:02:47,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:47,723 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-02-21 03:02:47,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:02:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-02-21 03:02:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 03:02:47,724 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:47,724 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1] [2022-02-21 03:02:47,742 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:02:47,942 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:02:47,943 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:02:47,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:47,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1484270500, now seen corresponding path program 2 times [2022-02-21 03:02:47,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:47,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404896064] [2022-02-21 03:02:47,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:47,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:48,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#true} assume { :begin_inline_ULTIMATE.init } true; {650#true} is VALID [2022-02-21 03:02:48,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {652#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:48,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {652#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 >= 0); {652#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:48,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {652#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 2 * main_~x~0#1 <= 2147483647; {652#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:48,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {652#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:48,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 3 * main_~y~0#1 <= 2147483647; {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:48,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:48,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 >= 0); {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:48,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 2 * main_~x~0#1 <= 2147483647; {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:48,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:48,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 3 * main_~y~0#1 <= 2147483647; {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:48,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:48,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 >= 0); {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:48,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 2 * main_~x~0#1 <= 2147483647; {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:48,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:48,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 3 * main_~y~0#1 <= 2147483647; {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:48,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:48,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 >= 0); {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:48,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 2 * main_~x~0#1 <= 2147483647; {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:48,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {656#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:48,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {656#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume 3 * main_~y~0#1 <= 2147483647; {656#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:48,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {656#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {656#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:48,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {656#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume !!(main_~x~0#1 >= 0); {656#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:48,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {656#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume !(2 * main_~x~0#1 <= 2147483647); {651#false} is VALID [2022-02-21 03:02:48,024 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:48,024 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:48,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404896064] [2022-02-21 03:02:48,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404896064] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:48,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044257779] [2022-02-21 03:02:48,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:02:48,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:48,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:48,027 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:02:48,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:02:48,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:02:48,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:02:48,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:02:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:48,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:48,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#true} assume { :begin_inline_ULTIMATE.init } true; {650#true} is VALID [2022-02-21 03:02:48,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {652#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:48,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {652#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 >= 0); {652#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:48,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {652#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 2 * main_~x~0#1 <= 2147483647; {652#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:48,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {652#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:48,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 3 * main_~y~0#1 <= 2147483647; {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:48,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:48,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 >= 0); {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:48,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 2 * main_~x~0#1 <= 2147483647; {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:48,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:48,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 3 * main_~y~0#1 <= 2147483647; {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:48,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:48,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 >= 0); {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:48,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 2 * main_~x~0#1 <= 2147483647; {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:48,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {654#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:48,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 3 * main_~y~0#1 <= 2147483647; {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:48,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:48,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 >= 0); {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:48,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 2 * main_~x~0#1 <= 2147483647; {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:48,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {655#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {656#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:48,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {656#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume 3 * main_~y~0#1 <= 2147483647; {656#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:48,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {656#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {656#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:48,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {656#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume !!(main_~x~0#1 >= 0); {656#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:48,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {656#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume !(2 * main_~x~0#1 <= 2147483647); {651#false} is VALID [2022-02-21 03:02:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:48,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:48,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {729#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} assume !(2 * main_~x~0#1 <= 2147483647); {651#false} is VALID [2022-02-21 03:02:48,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {729#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} assume !!(main_~x~0#1 >= 0); {729#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} is VALID [2022-02-21 03:02:48,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {729#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {729#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} is VALID [2022-02-21 03:02:48,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {729#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} assume 3 * main_~y~0#1 <= 2147483647; {729#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} is VALID [2022-02-21 03:02:48,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {742#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {729#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} is VALID [2022-02-21 03:02:48,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {742#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} assume 2 * main_~x~0#1 <= 2147483647; {742#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} is VALID [2022-02-21 03:02:48,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {742#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} assume !!(main_~x~0#1 >= 0); {742#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} is VALID [2022-02-21 03:02:48,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {742#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {742#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} is VALID [2022-02-21 03:02:48,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {742#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} assume 3 * main_~y~0#1 <= 2147483647; {742#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} is VALID [2022-02-21 03:02:48,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {758#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {742#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} is VALID [2022-02-21 03:02:48,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {758#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} assume 2 * main_~x~0#1 <= 2147483647; {758#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} is VALID [2022-02-21 03:02:48,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {758#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} assume !!(main_~x~0#1 >= 0); {758#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} is VALID [2022-02-21 03:02:48,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {758#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {758#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} is VALID [2022-02-21 03:02:48,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {758#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} assume 3 * main_~y~0#1 <= 2147483647; {758#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} is VALID [2022-02-21 03:02:48,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {758#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} is VALID [2022-02-21 03:02:48,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} assume 2 * main_~x~0#1 <= 2147483647; {774#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} is VALID [2022-02-21 03:02:48,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} assume !!(main_~x~0#1 >= 0); {774#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} is VALID [2022-02-21 03:02:48,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {774#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} is VALID [2022-02-21 03:02:48,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} assume 3 * main_~y~0#1 <= 2147483647; {774#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} is VALID [2022-02-21 03:02:48,370 INFO L290 TraceCheckUtils]: 4: Hoare triple {790#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 134217727)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {774#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} is VALID [2022-02-21 03:02:48,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {790#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 134217727)} assume 2 * main_~x~0#1 <= 2147483647; {790#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 134217727)} is VALID [2022-02-21 03:02:48,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 134217727)} assume !!(main_~x~0#1 >= 0); {790#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 134217727)} is VALID [2022-02-21 03:02:48,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {790#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 134217727)} is VALID [2022-02-21 03:02:48,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#true} assume { :begin_inline_ULTIMATE.init } true; {650#true} is VALID [2022-02-21 03:02:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:48,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044257779] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:48,371 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:48,372 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-02-21 03:02:48,372 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883503419] [2022-02-21 03:02:48,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:48,372 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-21 03:02:48,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:48,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 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:02:48,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:48,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:02:48,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:48,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:02:48,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:02:48,407 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 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:02:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:48,537 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-02-21 03:02:48,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:02:48,537 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-21 03:02:48,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 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:02:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2022-02-21 03:02:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 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:02:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2022-02-21 03:02:48,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 67 transitions. [2022-02-21 03:02:48,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:48,587 INFO L225 Difference]: With dead ends: 62 [2022-02-21 03:02:48,587 INFO L226 Difference]: Without dead ends: 61 [2022-02-21 03:02:48,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:02:48,588 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:48,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 38 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-21 03:02:48,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-02-21 03:02:48,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:48,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 56 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 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:02:48,609 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 56 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 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:02:48,609 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 56 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 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:02:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:48,610 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-02-21 03:02:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-02-21 03:02:48,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:48,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:48,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 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 61 states. [2022-02-21 03:02:48,611 INFO L87 Difference]: Start difference. First operand has 56 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 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 61 states. [2022-02-21 03:02:48,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:48,613 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-02-21 03:02:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-02-21 03:02:48,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:48,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:48,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:48,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 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:02:48,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-02-21 03:02:48,615 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 24 [2022-02-21 03:02:48,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:48,615 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-02-21 03:02:48,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 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:02:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-02-21 03:02:48,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 03:02:48,616 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:48,616 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2022-02-21 03:02:48,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:02:48,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:48,832 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:02:48,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:48,833 INFO L85 PathProgramCache]: Analyzing trace with hash 454809670, now seen corresponding path program 2 times [2022-02-21 03:02:48,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:48,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902539948] [2022-02-21 03:02:48,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:48,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:48,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {1064#true} assume { :begin_inline_ULTIMATE.init } true; {1064#true} is VALID [2022-02-21 03:02:48,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {1064#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:48,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 >= 0); {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:48,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 2 * main_~x~0#1 <= 2147483647; {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:48,921 INFO L290 TraceCheckUtils]: 4: Hoare triple {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:48,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 3 * main_~y~0#1 <= 2147483647; {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:48,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:48,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume !!(main_~x~0#1 >= 0); {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:48,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 2 * main_~x~0#1 <= 2147483647; {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:48,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:48,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 3 * main_~y~0#1 <= 2147483647; {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:48,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:48,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume !!(main_~x~0#1 >= 0); {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:48,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 2 * main_~x~0#1 <= 2147483647; {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:48,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:48,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 3 * main_~y~0#1 <= 2147483647; {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:48,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:48,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume !!(main_~x~0#1 >= 0); {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:48,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 2 * main_~x~0#1 <= 2147483647; {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:48,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:48,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 3 * main_~y~0#1 <= 2147483647; {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:48,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1070#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:48,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {1070#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume !!(main_~x~0#1 >= 0); {1070#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:48,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {1070#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume 2 * main_~x~0#1 <= 2147483647; {1070#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:48,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {1070#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1070#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:48,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {1070#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume !(3 * main_~y~0#1 <= 2147483647); {1065#false} is VALID [2022-02-21 03:02:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:48,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:48,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902539948] [2022-02-21 03:02:48,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902539948] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:48,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038063218] [2022-02-21 03:02:48,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:02:48,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:48,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:48,930 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:02:48,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:02:48,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:02:48,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:02:48,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:02:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:48,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:49,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {1064#true} assume { :begin_inline_ULTIMATE.init } true; {1064#true} is VALID [2022-02-21 03:02:49,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {1064#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:49,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 >= 0); {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:49,073 INFO L290 TraceCheckUtils]: 3: Hoare triple {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 2 * main_~x~0#1 <= 2147483647; {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:49,073 INFO L290 TraceCheckUtils]: 4: Hoare triple {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:49,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 3 * main_~y~0#1 <= 2147483647; {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:49,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {1066#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:49,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume !!(main_~x~0#1 >= 0); {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:49,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 2 * main_~x~0#1 <= 2147483647; {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:49,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:49,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 3 * main_~y~0#1 <= 2147483647; {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:49,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {1067#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:49,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume !!(main_~x~0#1 >= 0); {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:49,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 2 * main_~x~0#1 <= 2147483647; {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:49,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:49,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 3 * main_~y~0#1 <= 2147483647; {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:49,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {1068#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:49,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume !!(main_~x~0#1 >= 0); {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:49,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 2 * main_~x~0#1 <= 2147483647; {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:49,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:49,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 3 * main_~y~0#1 <= 2147483647; {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:49,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {1069#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1070#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:49,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {1070#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume !!(main_~x~0#1 >= 0); {1070#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:49,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {1070#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume 2 * main_~x~0#1 <= 2147483647; {1070#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:49,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {1070#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1070#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:49,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {1070#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume !(3 * main_~y~0#1 <= 2147483647); {1065#false} is VALID [2022-02-21 03:02:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:49,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:49,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {1149#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume !(3 * main_~y~0#1 <= 2147483647); {1065#false} is VALID [2022-02-21 03:02:49,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1149#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:02:49,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {1149#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume 2 * main_~x~0#1 <= 2147483647; {1149#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:02:49,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {1149#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume !!(main_~x~0#1 >= 0); {1149#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:02:49,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {1162#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1149#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:02:49,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {1162#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} assume 3 * main_~y~0#1 <= 2147483647; {1162#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} is VALID [2022-02-21 03:02:49,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {1162#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1162#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} is VALID [2022-02-21 03:02:49,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {1162#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} assume 2 * main_~x~0#1 <= 2147483647; {1162#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} is VALID [2022-02-21 03:02:49,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {1162#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} assume !!(main_~x~0#1 >= 0); {1162#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} is VALID [2022-02-21 03:02:49,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1162#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} is VALID [2022-02-21 03:02:49,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} assume 3 * main_~y~0#1 <= 2147483647; {1178#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} is VALID [2022-02-21 03:02:49,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1178#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} is VALID [2022-02-21 03:02:49,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} assume 2 * main_~x~0#1 <= 2147483647; {1178#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} is VALID [2022-02-21 03:02:49,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} assume !!(main_~x~0#1 >= 0); {1178#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} is VALID [2022-02-21 03:02:49,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {1194#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1178#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} is VALID [2022-02-21 03:02:49,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {1194#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} assume 3 * main_~y~0#1 <= 2147483647; {1194#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} is VALID [2022-02-21 03:02:49,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {1194#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1194#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} is VALID [2022-02-21 03:02:49,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {1194#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} assume 2 * main_~x~0#1 <= 2147483647; {1194#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} is VALID [2022-02-21 03:02:49,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {1194#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} assume !!(main_~x~0#1 >= 0); {1194#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} is VALID [2022-02-21 03:02:49,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {1210#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1194#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} is VALID [2022-02-21 03:02:49,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} assume 3 * main_~y~0#1 <= 2147483647; {1210#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} is VALID [2022-02-21 03:02:49,227 INFO L290 TraceCheckUtils]: 4: Hoare triple {1210#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1210#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} is VALID [2022-02-21 03:02:49,228 INFO L290 TraceCheckUtils]: 3: Hoare triple {1210#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} assume 2 * main_~x~0#1 <= 2147483647; {1210#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} is VALID [2022-02-21 03:02:49,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} assume !!(main_~x~0#1 >= 0); {1210#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} is VALID [2022-02-21 03:02:49,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {1064#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {1210#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} is VALID [2022-02-21 03:02:49,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {1064#true} assume { :begin_inline_ULTIMATE.init } true; {1064#true} is VALID [2022-02-21 03:02:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:49,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038063218] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:49,229 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:49,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-02-21 03:02:49,229 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108908849] [2022-02-21 03:02:49,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:49,230 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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 26 [2022-02-21 03:02:49,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:49,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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:02:49,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:49,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:02:49,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:49,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:02:49,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:02:49,274 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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:02:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:49,362 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-02-21 03:02:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:02:49,362 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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 26 [2022-02-21 03:02:49,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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:02:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2022-02-21 03:02:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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:02:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2022-02-21 03:02:49,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 64 transitions. [2022-02-21 03:02:49,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:49,404 INFO L225 Difference]: With dead ends: 59 [2022-02-21 03:02:49,404 INFO L226 Difference]: Without dead ends: 58 [2022-02-21 03:02:49,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:02:49,405 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:49,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 45 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-21 03:02:49,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-02-21 03:02:49,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:49,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 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:02:49,429 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 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:02:49,429 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 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:02:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:49,431 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-02-21 03:02:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-02-21 03:02:49,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:49,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:49,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 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 58 states. [2022-02-21 03:02:49,432 INFO L87 Difference]: Start difference. First operand has 58 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 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 58 states. [2022-02-21 03:02:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:49,433 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-02-21 03:02:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-02-21 03:02:49,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:49,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:49,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:49,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 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:02:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-02-21 03:02:49,435 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 26 [2022-02-21 03:02:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:49,435 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-02-21 03:02:49,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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:02:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-02-21 03:02:49,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-21 03:02:49,436 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:49,436 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1] [2022-02-21 03:02:49,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:02:49,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:49,651 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:02:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:49,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1025163396, now seen corresponding path program 3 times [2022-02-21 03:02:49,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:49,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606787272] [2022-02-21 03:02:49,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:49,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:49,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {1483#true} assume { :begin_inline_ULTIMATE.init } true; {1483#true} is VALID [2022-02-21 03:02:49,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {1483#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {1485#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:49,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {1485#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 >= 0); {1485#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:49,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {1485#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 2 * main_~x~0#1 <= 2147483647; {1485#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:49,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {1485#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:49,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 3 * main_~y~0#1 <= 2147483647; {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:49,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:49,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 >= 0); {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:49,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 2 * main_~x~0#1 <= 2147483647; {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:49,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:49,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 3 * main_~y~0#1 <= 2147483647; {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:49,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:49,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 >= 0); {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:49,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 2 * main_~x~0#1 <= 2147483647; {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:49,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:49,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 3 * main_~y~0#1 <= 2147483647; {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:49,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:49,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 >= 0); {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:49,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 2 * main_~x~0#1 <= 2147483647; {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:49,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:49,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume 3 * main_~y~0#1 <= 2147483647; {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:49,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:49,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume !!(main_~x~0#1 >= 0); {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:49,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume 2 * main_~x~0#1 <= 2147483647; {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:49,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-21 03:02:49,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} assume 3 * main_~y~0#1 <= 2147483647; {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-21 03:02:49,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-21 03:02:49,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} assume !!(main_~x~0#1 >= 0); {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-21 03:02:49,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} assume 2 * main_~x~0#1 <= 2147483647; {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-21 03:02:49,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} is VALID [2022-02-21 03:02:49,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} assume 3 * main_~y~0#1 <= 2147483647; {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} is VALID [2022-02-21 03:02:49,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} is VALID [2022-02-21 03:02:49,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} assume !!(main_~x~0#1 >= 0); {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} is VALID [2022-02-21 03:02:49,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} assume 2 * main_~x~0#1 <= 2147483647; {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} is VALID [2022-02-21 03:02:49,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} is VALID [2022-02-21 03:02:49,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} assume 3 * main_~y~0#1 <= 2147483647; {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} is VALID [2022-02-21 03:02:49,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} is VALID [2022-02-21 03:02:49,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} assume !!(main_~x~0#1 >= 0); {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} is VALID [2022-02-21 03:02:49,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} assume 2 * main_~x~0#1 <= 2147483647; {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} is VALID [2022-02-21 03:02:49,809 INFO L290 TraceCheckUtils]: 39: Hoare triple {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} is VALID [2022-02-21 03:02:49,809 INFO L290 TraceCheckUtils]: 40: Hoare triple {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} assume 3 * main_~y~0#1 <= 2147483647; {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} is VALID [2022-02-21 03:02:49,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} is VALID [2022-02-21 03:02:49,809 INFO L290 TraceCheckUtils]: 42: Hoare triple {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} assume !!(main_~x~0#1 >= 0); {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} is VALID [2022-02-21 03:02:49,810 INFO L290 TraceCheckUtils]: 43: Hoare triple {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} assume 2 * main_~x~0#1 <= 2147483647; {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} is VALID [2022-02-21 03:02:49,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} is VALID [2022-02-21 03:02:49,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} assume 3 * main_~y~0#1 <= 2147483647; {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} is VALID [2022-02-21 03:02:49,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} is VALID [2022-02-21 03:02:49,811 INFO L290 TraceCheckUtils]: 47: Hoare triple {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} assume !!(main_~x~0#1 >= 0); {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} is VALID [2022-02-21 03:02:49,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} assume 2 * main_~x~0#1 <= 2147483647; {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} is VALID [2022-02-21 03:02:49,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1495#(<= |ULTIMATE.start_main_~x~0#1| 1024)} is VALID [2022-02-21 03:02:49,812 INFO L290 TraceCheckUtils]: 50: Hoare triple {1495#(<= |ULTIMATE.start_main_~x~0#1| 1024)} assume 3 * main_~y~0#1 <= 2147483647; {1495#(<= |ULTIMATE.start_main_~x~0#1| 1024)} is VALID [2022-02-21 03:02:49,812 INFO L290 TraceCheckUtils]: 51: Hoare triple {1495#(<= |ULTIMATE.start_main_~x~0#1| 1024)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1495#(<= |ULTIMATE.start_main_~x~0#1| 1024)} is VALID [2022-02-21 03:02:49,812 INFO L290 TraceCheckUtils]: 52: Hoare triple {1495#(<= |ULTIMATE.start_main_~x~0#1| 1024)} assume !!(main_~x~0#1 >= 0); {1495#(<= |ULTIMATE.start_main_~x~0#1| 1024)} is VALID [2022-02-21 03:02:49,813 INFO L290 TraceCheckUtils]: 53: Hoare triple {1495#(<= |ULTIMATE.start_main_~x~0#1| 1024)} assume !(2 * main_~x~0#1 <= 2147483647); {1484#false} is VALID [2022-02-21 03:02:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:49,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:49,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606787272] [2022-02-21 03:02:49,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606787272] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:49,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659882103] [2022-02-21 03:02:49,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:02:49,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:49,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:49,816 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:02:49,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:02:49,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-21 03:02:49,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:02:49,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:02:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:49,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:50,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {1483#true} assume { :begin_inline_ULTIMATE.init } true; {1483#true} is VALID [2022-02-21 03:02:50,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {1483#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {1485#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:50,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {1485#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 >= 0); {1485#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:50,202 INFO L290 TraceCheckUtils]: 3: Hoare triple {1485#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 2 * main_~x~0#1 <= 2147483647; {1485#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:02:50,203 INFO L290 TraceCheckUtils]: 4: Hoare triple {1485#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:50,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 3 * main_~y~0#1 <= 2147483647; {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:50,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:50,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 >= 0); {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:50,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 2 * main_~x~0#1 <= 2147483647; {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:02:50,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {1486#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:50,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 3 * main_~y~0#1 <= 2147483647; {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:50,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:50,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 >= 0); {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:50,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 2 * main_~x~0#1 <= 2147483647; {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:02:50,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {1487#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:50,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 3 * main_~y~0#1 <= 2147483647; {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:50,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:50,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 >= 0); {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:50,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 2 * main_~x~0#1 <= 2147483647; {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:02:50,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {1488#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:50,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume 3 * main_~y~0#1 <= 2147483647; {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:50,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:50,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume !!(main_~x~0#1 >= 0); {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:50,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume 2 * main_~x~0#1 <= 2147483647; {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:02:50,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {1489#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-21 03:02:50,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} assume 3 * main_~y~0#1 <= 2147483647; {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-21 03:02:50,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-21 03:02:50,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} assume !!(main_~x~0#1 >= 0); {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-21 03:02:50,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} assume 2 * main_~x~0#1 <= 2147483647; {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-21 03:02:50,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {1490#(<= |ULTIMATE.start_main_~x~0#1| 32)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} is VALID [2022-02-21 03:02:50,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} assume 3 * main_~y~0#1 <= 2147483647; {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} is VALID [2022-02-21 03:02:50,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} is VALID [2022-02-21 03:02:50,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} assume !!(main_~x~0#1 >= 0); {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} is VALID [2022-02-21 03:02:50,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} assume 2 * main_~x~0#1 <= 2147483647; {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} is VALID [2022-02-21 03:02:50,216 INFO L290 TraceCheckUtils]: 34: Hoare triple {1491#(<= |ULTIMATE.start_main_~x~0#1| 64)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} is VALID [2022-02-21 03:02:50,216 INFO L290 TraceCheckUtils]: 35: Hoare triple {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} assume 3 * main_~y~0#1 <= 2147483647; {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} is VALID [2022-02-21 03:02:50,216 INFO L290 TraceCheckUtils]: 36: Hoare triple {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} is VALID [2022-02-21 03:02:50,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} assume !!(main_~x~0#1 >= 0); {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} is VALID [2022-02-21 03:02:50,217 INFO L290 TraceCheckUtils]: 38: Hoare triple {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} assume 2 * main_~x~0#1 <= 2147483647; {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} is VALID [2022-02-21 03:02:50,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {1492#(<= |ULTIMATE.start_main_~x~0#1| 128)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} is VALID [2022-02-21 03:02:50,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} assume 3 * main_~y~0#1 <= 2147483647; {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} is VALID [2022-02-21 03:02:50,218 INFO L290 TraceCheckUtils]: 41: Hoare triple {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} is VALID [2022-02-21 03:02:50,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} assume !!(main_~x~0#1 >= 0); {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} is VALID [2022-02-21 03:02:50,219 INFO L290 TraceCheckUtils]: 43: Hoare triple {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} assume 2 * main_~x~0#1 <= 2147483647; {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} is VALID [2022-02-21 03:02:50,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {1493#(<= |ULTIMATE.start_main_~x~0#1| 256)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} is VALID [2022-02-21 03:02:50,220 INFO L290 TraceCheckUtils]: 45: Hoare triple {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} assume 3 * main_~y~0#1 <= 2147483647; {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} is VALID [2022-02-21 03:02:50,220 INFO L290 TraceCheckUtils]: 46: Hoare triple {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} is VALID [2022-02-21 03:02:50,221 INFO L290 TraceCheckUtils]: 47: Hoare triple {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} assume !!(main_~x~0#1 >= 0); {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} is VALID [2022-02-21 03:02:50,221 INFO L290 TraceCheckUtils]: 48: Hoare triple {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} assume 2 * main_~x~0#1 <= 2147483647; {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} is VALID [2022-02-21 03:02:50,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {1494#(<= |ULTIMATE.start_main_~x~0#1| 512)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1495#(<= |ULTIMATE.start_main_~x~0#1| 1024)} is VALID [2022-02-21 03:02:50,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {1495#(<= |ULTIMATE.start_main_~x~0#1| 1024)} assume 3 * main_~y~0#1 <= 2147483647; {1495#(<= |ULTIMATE.start_main_~x~0#1| 1024)} is VALID [2022-02-21 03:02:50,222 INFO L290 TraceCheckUtils]: 51: Hoare triple {1495#(<= |ULTIMATE.start_main_~x~0#1| 1024)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1495#(<= |ULTIMATE.start_main_~x~0#1| 1024)} is VALID [2022-02-21 03:02:50,222 INFO L290 TraceCheckUtils]: 52: Hoare triple {1495#(<= |ULTIMATE.start_main_~x~0#1| 1024)} assume !!(main_~x~0#1 >= 0); {1495#(<= |ULTIMATE.start_main_~x~0#1| 1024)} is VALID [2022-02-21 03:02:50,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {1495#(<= |ULTIMATE.start_main_~x~0#1| 1024)} assume !(2 * main_~x~0#1 <= 2147483647); {1484#false} is VALID [2022-02-21 03:02:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:50,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:50,630 INFO L290 TraceCheckUtils]: 53: Hoare triple {1658#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} assume !(2 * main_~x~0#1 <= 2147483647); {1484#false} is VALID [2022-02-21 03:02:50,630 INFO L290 TraceCheckUtils]: 52: Hoare triple {1658#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} assume !!(main_~x~0#1 >= 0); {1658#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} is VALID [2022-02-21 03:02:50,631 INFO L290 TraceCheckUtils]: 51: Hoare triple {1658#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1658#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} is VALID [2022-02-21 03:02:50,631 INFO L290 TraceCheckUtils]: 50: Hoare triple {1658#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} assume 3 * main_~y~0#1 <= 2147483647; {1658#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} is VALID [2022-02-21 03:02:50,631 INFO L290 TraceCheckUtils]: 49: Hoare triple {1671#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1658#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2147483647)} is VALID [2022-02-21 03:02:50,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {1671#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} assume 2 * main_~x~0#1 <= 2147483647; {1671#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} is VALID [2022-02-21 03:02:50,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {1671#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} assume !!(main_~x~0#1 >= 0); {1671#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} is VALID [2022-02-21 03:02:50,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {1671#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1671#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} is VALID [2022-02-21 03:02:50,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {1671#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} assume 3 * main_~y~0#1 <= 2147483647; {1671#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} is VALID [2022-02-21 03:02:50,633 INFO L290 TraceCheckUtils]: 44: Hoare triple {1687#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1671#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 1073741823)} is VALID [2022-02-21 03:02:50,633 INFO L290 TraceCheckUtils]: 43: Hoare triple {1687#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} assume 2 * main_~x~0#1 <= 2147483647; {1687#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} is VALID [2022-02-21 03:02:50,634 INFO L290 TraceCheckUtils]: 42: Hoare triple {1687#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} assume !!(main_~x~0#1 >= 0); {1687#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} is VALID [2022-02-21 03:02:50,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {1687#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1687#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} is VALID [2022-02-21 03:02:50,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {1687#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} assume 3 * main_~y~0#1 <= 2147483647; {1687#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} is VALID [2022-02-21 03:02:50,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {1703#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1687#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 536870911)} is VALID [2022-02-21 03:02:50,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {1703#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} assume 2 * main_~x~0#1 <= 2147483647; {1703#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} is VALID [2022-02-21 03:02:50,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {1703#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} assume !!(main_~x~0#1 >= 0); {1703#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} is VALID [2022-02-21 03:02:50,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {1703#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1703#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} is VALID [2022-02-21 03:02:50,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {1703#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} assume 3 * main_~y~0#1 <= 2147483647; {1703#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} is VALID [2022-02-21 03:02:50,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {1719#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 134217727)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1703#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 268435455)} is VALID [2022-02-21 03:02:50,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {1719#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 134217727)} assume 2 * main_~x~0#1 <= 2147483647; {1719#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 134217727)} is VALID [2022-02-21 03:02:50,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {1719#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 134217727)} assume !!(main_~x~0#1 >= 0); {1719#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 134217727)} is VALID [2022-02-21 03:02:50,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {1719#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 134217727)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1719#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 134217727)} is VALID [2022-02-21 03:02:50,638 INFO L290 TraceCheckUtils]: 30: Hoare triple {1719#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 134217727)} assume 3 * main_~y~0#1 <= 2147483647; {1719#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 134217727)} is VALID [2022-02-21 03:02:50,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {1735#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 67108863)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1719#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 134217727)} is VALID [2022-02-21 03:02:50,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {1735#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 67108863)} assume 2 * main_~x~0#1 <= 2147483647; {1735#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 67108863)} is VALID [2022-02-21 03:02:50,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {1735#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 67108863)} assume !!(main_~x~0#1 >= 0); {1735#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 67108863)} is VALID [2022-02-21 03:02:50,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {1735#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 67108863)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1735#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 67108863)} is VALID [2022-02-21 03:02:50,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {1735#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 67108863)} assume 3 * main_~y~0#1 <= 2147483647; {1735#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 67108863)} is VALID [2022-02-21 03:02:50,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {1751#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 33554431)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1735#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 67108863)} is VALID [2022-02-21 03:02:50,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {1751#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 33554431)} assume 2 * main_~x~0#1 <= 2147483647; {1751#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 33554431)} is VALID [2022-02-21 03:02:50,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {1751#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 33554431)} assume !!(main_~x~0#1 >= 0); {1751#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 33554431)} is VALID [2022-02-21 03:02:50,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {1751#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 33554431)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1751#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 33554431)} is VALID [2022-02-21 03:02:50,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {1751#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 33554431)} assume 3 * main_~y~0#1 <= 2147483647; {1751#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 33554431)} is VALID [2022-02-21 03:02:50,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {1767#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 16777215)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1751#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 33554431)} is VALID [2022-02-21 03:02:50,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {1767#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 16777215)} assume 2 * main_~x~0#1 <= 2147483647; {1767#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 16777215)} is VALID [2022-02-21 03:02:50,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {1767#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 16777215)} assume !!(main_~x~0#1 >= 0); {1767#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 16777215)} is VALID [2022-02-21 03:02:50,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {1767#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 16777215)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1767#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 16777215)} is VALID [2022-02-21 03:02:50,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {1767#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 16777215)} assume 3 * main_~y~0#1 <= 2147483647; {1767#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 16777215)} is VALID [2022-02-21 03:02:50,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {1783#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 8388607)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1767#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 16777215)} is VALID [2022-02-21 03:02:50,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {1783#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 8388607)} assume 2 * main_~x~0#1 <= 2147483647; {1783#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 8388607)} is VALID [2022-02-21 03:02:50,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {1783#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 8388607)} assume !!(main_~x~0#1 >= 0); {1783#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 8388607)} is VALID [2022-02-21 03:02:50,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {1783#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 8388607)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1783#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 8388607)} is VALID [2022-02-21 03:02:50,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {1783#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 8388607)} assume 3 * main_~y~0#1 <= 2147483647; {1783#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 8388607)} is VALID [2022-02-21 03:02:50,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {1799#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 4194303)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1783#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 8388607)} is VALID [2022-02-21 03:02:50,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {1799#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 4194303)} assume 2 * main_~x~0#1 <= 2147483647; {1799#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 4194303)} is VALID [2022-02-21 03:02:50,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {1799#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 4194303)} assume !!(main_~x~0#1 >= 0); {1799#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 4194303)} is VALID [2022-02-21 03:02:50,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {1799#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 4194303)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {1799#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 4194303)} is VALID [2022-02-21 03:02:50,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {1799#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 4194303)} assume 3 * main_~y~0#1 <= 2147483647; {1799#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 4194303)} is VALID [2022-02-21 03:02:50,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {1815#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2097151)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {1799#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 4194303)} is VALID [2022-02-21 03:02:50,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {1815#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2097151)} assume 2 * main_~x~0#1 <= 2147483647; {1815#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2097151)} is VALID [2022-02-21 03:02:50,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {1815#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2097151)} assume !!(main_~x~0#1 >= 0); {1815#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2097151)} is VALID [2022-02-21 03:02:50,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {1483#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {1815#(<= (* 2 |ULTIMATE.start_main_~x~0#1|) 2097151)} is VALID [2022-02-21 03:02:50,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {1483#true} assume { :begin_inline_ULTIMATE.init } true; {1483#true} is VALID [2022-02-21 03:02:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:50,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659882103] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:50,653 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:50,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-02-21 03:02:50,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998967455] [2022-02-21 03:02:50,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:50,654 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 24 states have internal predecessors, (107), 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 54 [2022-02-21 03:02:50,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:50,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 24 states have internal predecessors, (107), 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:02:50,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:50,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-21 03:02:50,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:50,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-21 03:02:50,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-02-21 03:02:50,725 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 24 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 24 states have internal predecessors, (107), 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:02:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:50,922 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2022-02-21 03:02:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:02:50,922 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 24 states have internal predecessors, (107), 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 54 [2022-02-21 03:02:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 24 states have internal predecessors, (107), 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:02:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 139 transitions. [2022-02-21 03:02:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 24 states have internal predecessors, (107), 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:02:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 139 transitions. [2022-02-21 03:02:50,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 139 transitions. [2022-02-21 03:02:51,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:51,011 INFO L225 Difference]: With dead ends: 128 [2022-02-21 03:02:51,012 INFO L226 Difference]: Without dead ends: 127 [2022-02-21 03:02:51,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 86 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-02-21 03:02:51,012 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 73 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:51,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 69 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-21 03:02:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2022-02-21 03:02:51,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:51,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 116 states, 114 states have (on average 1.1140350877192982) internal successors, (127), 115 states have internal predecessors, (127), 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:02:51,054 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 116 states, 114 states have (on average 1.1140350877192982) internal successors, (127), 115 states have internal predecessors, (127), 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:02:51,054 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 116 states, 114 states have (on average 1.1140350877192982) internal successors, (127), 115 states have internal predecessors, (127), 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:02:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:51,056 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2022-02-21 03:02:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2022-02-21 03:02:51,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:51,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:51,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 114 states have (on average 1.1140350877192982) internal successors, (127), 115 states have internal predecessors, (127), 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 127 states. [2022-02-21 03:02:51,057 INFO L87 Difference]: Start difference. First operand has 116 states, 114 states have (on average 1.1140350877192982) internal successors, (127), 115 states have internal predecessors, (127), 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 127 states. [2022-02-21 03:02:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:51,058 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2022-02-21 03:02:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2022-02-21 03:02:51,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:51,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:51,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:51,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.1140350877192982) internal successors, (127), 115 states have internal predecessors, (127), 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:02:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2022-02-21 03:02:51,061 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 54 [2022-02-21 03:02:51,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:51,061 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2022-02-21 03:02:51,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 24 states have internal predecessors, (107), 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:02:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2022-02-21 03:02:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-21 03:02:51,062 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:51,062 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1] [2022-02-21 03:02:51,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:02:51,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:51,275 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:02:51,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:51,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1634514214, now seen corresponding path program 3 times [2022-02-21 03:02:51,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:51,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827698185] [2022-02-21 03:02:51,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:51,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:51,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {2371#true} assume { :begin_inline_ULTIMATE.init } true; {2371#true} is VALID [2022-02-21 03:02:51,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {2371#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:51,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 >= 0); {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:51,399 INFO L290 TraceCheckUtils]: 3: Hoare triple {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 2 * main_~x~0#1 <= 2147483647; {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:51,399 INFO L290 TraceCheckUtils]: 4: Hoare triple {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:51,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 3 * main_~y~0#1 <= 2147483647; {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:51,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:51,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume !!(main_~x~0#1 >= 0); {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:51,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 2 * main_~x~0#1 <= 2147483647; {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:51,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:51,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 3 * main_~y~0#1 <= 2147483647; {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:51,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:51,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume !!(main_~x~0#1 >= 0); {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:51,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 2 * main_~x~0#1 <= 2147483647; {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:51,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:51,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 3 * main_~y~0#1 <= 2147483647; {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:51,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:51,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume !!(main_~x~0#1 >= 0); {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:51,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 2 * main_~x~0#1 <= 2147483647; {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:51,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:51,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 3 * main_~y~0#1 <= 2147483647; {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:51,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:51,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume !!(main_~x~0#1 >= 0); {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:51,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume 2 * main_~x~0#1 <= 2147483647; {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:51,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:51,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume 3 * main_~y~0#1 <= 2147483647; {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:51,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} is VALID [2022-02-21 03:02:51,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} assume !!(main_~x~0#1 >= 0); {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} is VALID [2022-02-21 03:02:51,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} assume 2 * main_~x~0#1 <= 2147483647; {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} is VALID [2022-02-21 03:02:51,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} is VALID [2022-02-21 03:02:51,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} assume 3 * main_~y~0#1 <= 2147483647; {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} is VALID [2022-02-21 03:02:51,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} is VALID [2022-02-21 03:02:51,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} assume !!(main_~x~0#1 >= 0); {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} is VALID [2022-02-21 03:02:51,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} assume 2 * main_~x~0#1 <= 2147483647; {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} is VALID [2022-02-21 03:02:51,411 INFO L290 TraceCheckUtils]: 34: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} is VALID [2022-02-21 03:02:51,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} assume 3 * main_~y~0#1 <= 2147483647; {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} is VALID [2022-02-21 03:02:51,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} is VALID [2022-02-21 03:02:51,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} assume !!(main_~x~0#1 >= 0); {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} is VALID [2022-02-21 03:02:51,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} assume 2 * main_~x~0#1 <= 2147483647; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} is VALID [2022-02-21 03:02:51,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} is VALID [2022-02-21 03:02:51,412 INFO L290 TraceCheckUtils]: 40: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} assume 3 * main_~y~0#1 <= 2147483647; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} is VALID [2022-02-21 03:02:51,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} is VALID [2022-02-21 03:02:51,413 INFO L290 TraceCheckUtils]: 42: Hoare triple {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} assume !!(main_~x~0#1 >= 0); {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} is VALID [2022-02-21 03:02:51,413 INFO L290 TraceCheckUtils]: 43: Hoare triple {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} assume 2 * main_~x~0#1 <= 2147483647; {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} is VALID [2022-02-21 03:02:51,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} is VALID [2022-02-21 03:02:51,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} assume 3 * main_~y~0#1 <= 2147483647; {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} is VALID [2022-02-21 03:02:51,414 INFO L290 TraceCheckUtils]: 46: Hoare triple {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} is VALID [2022-02-21 03:02:51,415 INFO L290 TraceCheckUtils]: 47: Hoare triple {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} assume !!(main_~x~0#1 >= 0); {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} is VALID [2022-02-21 03:02:51,415 INFO L290 TraceCheckUtils]: 48: Hoare triple {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} assume 2 * main_~x~0#1 <= 2147483647; {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} is VALID [2022-02-21 03:02:51,415 INFO L290 TraceCheckUtils]: 49: Hoare triple {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} is VALID [2022-02-21 03:02:51,415 INFO L290 TraceCheckUtils]: 50: Hoare triple {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} assume 3 * main_~y~0#1 <= 2147483647; {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} is VALID [2022-02-21 03:02:51,416 INFO L290 TraceCheckUtils]: 51: Hoare triple {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2383#(<= |ULTIMATE.start_main_~y~0#1| 59049)} is VALID [2022-02-21 03:02:51,416 INFO L290 TraceCheckUtils]: 52: Hoare triple {2383#(<= |ULTIMATE.start_main_~y~0#1| 59049)} assume !!(main_~x~0#1 >= 0); {2383#(<= |ULTIMATE.start_main_~y~0#1| 59049)} is VALID [2022-02-21 03:02:51,416 INFO L290 TraceCheckUtils]: 53: Hoare triple {2383#(<= |ULTIMATE.start_main_~y~0#1| 59049)} assume 2 * main_~x~0#1 <= 2147483647; {2383#(<= |ULTIMATE.start_main_~y~0#1| 59049)} is VALID [2022-02-21 03:02:51,416 INFO L290 TraceCheckUtils]: 54: Hoare triple {2383#(<= |ULTIMATE.start_main_~y~0#1| 59049)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2383#(<= |ULTIMATE.start_main_~y~0#1| 59049)} is VALID [2022-02-21 03:02:51,417 INFO L290 TraceCheckUtils]: 55: Hoare triple {2383#(<= |ULTIMATE.start_main_~y~0#1| 59049)} assume !(3 * main_~y~0#1 <= 2147483647); {2372#false} is VALID [2022-02-21 03:02:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:51,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:51,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827698185] [2022-02-21 03:02:51,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827698185] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:51,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75737614] [2022-02-21 03:02:51,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:02:51,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:51,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:51,418 INFO L229 MonitoredProcess]: Starting monitored process 7 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:02:51,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 03:02:51,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-21 03:02:51,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:02:51,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:02:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:51,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:51,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {2371#true} assume { :begin_inline_ULTIMATE.init } true; {2371#true} is VALID [2022-02-21 03:02:51,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {2371#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:51,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 >= 0); {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:51,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 2 * main_~x~0#1 <= 2147483647; {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:51,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:51,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 3 * main_~y~0#1 <= 2147483647; {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:02:51,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {2373#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:51,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume !!(main_~x~0#1 >= 0); {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:51,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 2 * main_~x~0#1 <= 2147483647; {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:51,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:51,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 3 * main_~y~0#1 <= 2147483647; {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:02:51,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {2374#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:51,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume !!(main_~x~0#1 >= 0); {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:51,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 2 * main_~x~0#1 <= 2147483647; {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:51,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:51,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 3 * main_~y~0#1 <= 2147483647; {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:02:51,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {2375#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:51,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume !!(main_~x~0#1 >= 0); {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:51,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 2 * main_~x~0#1 <= 2147483647; {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:51,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:51,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 3 * main_~y~0#1 <= 2147483647; {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:02:51,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {2376#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:51,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume !!(main_~x~0#1 >= 0); {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:51,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume 2 * main_~x~0#1 <= 2147483647; {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:51,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:51,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume 3 * main_~y~0#1 <= 2147483647; {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} is VALID [2022-02-21 03:02:51,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {2377#(<= |ULTIMATE.start_main_~y~0#1| 81)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} is VALID [2022-02-21 03:02:51,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} assume !!(main_~x~0#1 >= 0); {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} is VALID [2022-02-21 03:02:51,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} assume 2 * main_~x~0#1 <= 2147483647; {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} is VALID [2022-02-21 03:02:51,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} is VALID [2022-02-21 03:02:51,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} assume 3 * main_~y~0#1 <= 2147483647; {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} is VALID [2022-02-21 03:02:51,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 243)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} is VALID [2022-02-21 03:02:51,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} assume !!(main_~x~0#1 >= 0); {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} is VALID [2022-02-21 03:02:51,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} assume 2 * main_~x~0#1 <= 2147483647; {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} is VALID [2022-02-21 03:02:51,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} is VALID [2022-02-21 03:02:51,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} assume 3 * main_~y~0#1 <= 2147483647; {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} is VALID [2022-02-21 03:02:51,800 INFO L290 TraceCheckUtils]: 36: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 729)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} is VALID [2022-02-21 03:02:51,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} assume !!(main_~x~0#1 >= 0); {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} is VALID [2022-02-21 03:02:51,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} assume 2 * main_~x~0#1 <= 2147483647; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} is VALID [2022-02-21 03:02:51,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} is VALID [2022-02-21 03:02:51,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} assume 3 * main_~y~0#1 <= 2147483647; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} is VALID [2022-02-21 03:02:51,802 INFO L290 TraceCheckUtils]: 41: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2187)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} is VALID [2022-02-21 03:02:51,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} assume !!(main_~x~0#1 >= 0); {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} is VALID [2022-02-21 03:02:51,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} assume 2 * main_~x~0#1 <= 2147483647; {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} is VALID [2022-02-21 03:02:51,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} is VALID [2022-02-21 03:02:51,803 INFO L290 TraceCheckUtils]: 45: Hoare triple {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} assume 3 * main_~y~0#1 <= 2147483647; {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} is VALID [2022-02-21 03:02:51,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {2381#(<= |ULTIMATE.start_main_~y~0#1| 6561)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} is VALID [2022-02-21 03:02:51,803 INFO L290 TraceCheckUtils]: 47: Hoare triple {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} assume !!(main_~x~0#1 >= 0); {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} is VALID [2022-02-21 03:02:51,803 INFO L290 TraceCheckUtils]: 48: Hoare triple {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} assume 2 * main_~x~0#1 <= 2147483647; {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} is VALID [2022-02-21 03:02:51,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} is VALID [2022-02-21 03:02:51,804 INFO L290 TraceCheckUtils]: 50: Hoare triple {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} assume 3 * main_~y~0#1 <= 2147483647; {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} is VALID [2022-02-21 03:02:51,804 INFO L290 TraceCheckUtils]: 51: Hoare triple {2382#(<= |ULTIMATE.start_main_~y~0#1| 19683)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2383#(<= |ULTIMATE.start_main_~y~0#1| 59049)} is VALID [2022-02-21 03:02:51,805 INFO L290 TraceCheckUtils]: 52: Hoare triple {2383#(<= |ULTIMATE.start_main_~y~0#1| 59049)} assume !!(main_~x~0#1 >= 0); {2383#(<= |ULTIMATE.start_main_~y~0#1| 59049)} is VALID [2022-02-21 03:02:51,805 INFO L290 TraceCheckUtils]: 53: Hoare triple {2383#(<= |ULTIMATE.start_main_~y~0#1| 59049)} assume 2 * main_~x~0#1 <= 2147483647; {2383#(<= |ULTIMATE.start_main_~y~0#1| 59049)} is VALID [2022-02-21 03:02:51,805 INFO L290 TraceCheckUtils]: 54: Hoare triple {2383#(<= |ULTIMATE.start_main_~y~0#1| 59049)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2383#(<= |ULTIMATE.start_main_~y~0#1| 59049)} is VALID [2022-02-21 03:02:51,805 INFO L290 TraceCheckUtils]: 55: Hoare triple {2383#(<= |ULTIMATE.start_main_~y~0#1| 59049)} assume !(3 * main_~y~0#1 <= 2147483647); {2372#false} is VALID [2022-02-21 03:02:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:51,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:52,217 INFO L290 TraceCheckUtils]: 55: Hoare triple {2552#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume !(3 * main_~y~0#1 <= 2147483647); {2372#false} is VALID [2022-02-21 03:02:52,217 INFO L290 TraceCheckUtils]: 54: Hoare triple {2552#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2552#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:02:52,218 INFO L290 TraceCheckUtils]: 53: Hoare triple {2552#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume 2 * main_~x~0#1 <= 2147483647; {2552#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:02:52,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {2552#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume !!(main_~x~0#1 >= 0); {2552#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:02:52,218 INFO L290 TraceCheckUtils]: 51: Hoare triple {2565#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2552#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:02:52,219 INFO L290 TraceCheckUtils]: 50: Hoare triple {2565#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} assume 3 * main_~y~0#1 <= 2147483647; {2565#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} is VALID [2022-02-21 03:02:52,219 INFO L290 TraceCheckUtils]: 49: Hoare triple {2565#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2565#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} is VALID [2022-02-21 03:02:52,219 INFO L290 TraceCheckUtils]: 48: Hoare triple {2565#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} assume 2 * main_~x~0#1 <= 2147483647; {2565#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} is VALID [2022-02-21 03:02:52,220 INFO L290 TraceCheckUtils]: 47: Hoare triple {2565#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} assume !!(main_~x~0#1 >= 0); {2565#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} is VALID [2022-02-21 03:02:52,220 INFO L290 TraceCheckUtils]: 46: Hoare triple {2581#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2565#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 715827882)} is VALID [2022-02-21 03:02:52,220 INFO L290 TraceCheckUtils]: 45: Hoare triple {2581#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} assume 3 * main_~y~0#1 <= 2147483647; {2581#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} is VALID [2022-02-21 03:02:52,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {2581#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2581#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} is VALID [2022-02-21 03:02:52,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {2581#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} assume 2 * main_~x~0#1 <= 2147483647; {2581#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} is VALID [2022-02-21 03:02:52,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {2581#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} assume !!(main_~x~0#1 >= 0); {2581#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} is VALID [2022-02-21 03:02:52,222 INFO L290 TraceCheckUtils]: 41: Hoare triple {2597#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2581#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 238609294)} is VALID [2022-02-21 03:02:52,222 INFO L290 TraceCheckUtils]: 40: Hoare triple {2597#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} assume 3 * main_~y~0#1 <= 2147483647; {2597#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} is VALID [2022-02-21 03:02:52,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {2597#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2597#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} is VALID [2022-02-21 03:02:52,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {2597#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} assume 2 * main_~x~0#1 <= 2147483647; {2597#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} is VALID [2022-02-21 03:02:52,223 INFO L290 TraceCheckUtils]: 37: Hoare triple {2597#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} assume !!(main_~x~0#1 >= 0); {2597#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} is VALID [2022-02-21 03:02:52,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {2613#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2597#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 79536431)} is VALID [2022-02-21 03:02:52,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {2613#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} assume 3 * main_~y~0#1 <= 2147483647; {2613#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} is VALID [2022-02-21 03:02:52,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {2613#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2613#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} is VALID [2022-02-21 03:02:52,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {2613#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} assume 2 * main_~x~0#1 <= 2147483647; {2613#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} is VALID [2022-02-21 03:02:52,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {2613#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} assume !!(main_~x~0#1 >= 0); {2613#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} is VALID [2022-02-21 03:02:52,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {2629#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 8837381)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2613#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 26512143)} is VALID [2022-02-21 03:02:52,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {2629#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 8837381)} assume 3 * main_~y~0#1 <= 2147483647; {2629#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 8837381)} is VALID [2022-02-21 03:02:52,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {2629#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 8837381)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2629#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 8837381)} is VALID [2022-02-21 03:02:52,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {2629#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 8837381)} assume 2 * main_~x~0#1 <= 2147483647; {2629#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 8837381)} is VALID [2022-02-21 03:02:52,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {2629#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 8837381)} assume !!(main_~x~0#1 >= 0); {2629#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 8837381)} is VALID [2022-02-21 03:02:52,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {2645#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2945793)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2629#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 8837381)} is VALID [2022-02-21 03:02:52,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {2645#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2945793)} assume 3 * main_~y~0#1 <= 2147483647; {2645#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2945793)} is VALID [2022-02-21 03:02:52,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {2645#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2945793)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2645#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2945793)} is VALID [2022-02-21 03:02:52,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {2645#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2945793)} assume 2 * main_~x~0#1 <= 2147483647; {2645#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2945793)} is VALID [2022-02-21 03:02:52,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {2645#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2945793)} assume !!(main_~x~0#1 >= 0); {2645#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2945793)} is VALID [2022-02-21 03:02:52,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {2661#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 981931)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2645#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 2945793)} is VALID [2022-02-21 03:02:52,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {2661#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 981931)} assume 3 * main_~y~0#1 <= 2147483647; {2661#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 981931)} is VALID [2022-02-21 03:02:52,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {2661#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 981931)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2661#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 981931)} is VALID [2022-02-21 03:02:52,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {2661#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 981931)} assume 2 * main_~x~0#1 <= 2147483647; {2661#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 981931)} is VALID [2022-02-21 03:02:52,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {2661#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 981931)} assume !!(main_~x~0#1 >= 0); {2661#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 981931)} is VALID [2022-02-21 03:02:52,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {2677#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 327310)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2661#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 981931)} is VALID [2022-02-21 03:02:52,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {2677#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 327310)} assume 3 * main_~y~0#1 <= 2147483647; {2677#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 327310)} is VALID [2022-02-21 03:02:52,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {2677#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 327310)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2677#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 327310)} is VALID [2022-02-21 03:02:52,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {2677#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 327310)} assume 2 * main_~x~0#1 <= 2147483647; {2677#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 327310)} is VALID [2022-02-21 03:02:52,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {2677#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 327310)} assume !!(main_~x~0#1 >= 0); {2677#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 327310)} is VALID [2022-02-21 03:02:52,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {2693#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 109103)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2677#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 327310)} is VALID [2022-02-21 03:02:52,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {2693#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 109103)} assume 3 * main_~y~0#1 <= 2147483647; {2693#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 109103)} is VALID [2022-02-21 03:02:52,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {2693#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 109103)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2693#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 109103)} is VALID [2022-02-21 03:02:52,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {2693#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 109103)} assume 2 * main_~x~0#1 <= 2147483647; {2693#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 109103)} is VALID [2022-02-21 03:02:52,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {2693#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 109103)} assume !!(main_~x~0#1 >= 0); {2693#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 109103)} is VALID [2022-02-21 03:02:52,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {2709#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 36367)} assume 3 * main_~y~0#1 >= -2147483648;main_~y~0#1 := 3 * main_~y~0#1; {2693#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 109103)} is VALID [2022-02-21 03:02:52,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {2709#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 36367)} assume 3 * main_~y~0#1 <= 2147483647; {2709#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 36367)} is VALID [2022-02-21 03:02:52,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {2709#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 36367)} assume 2 * main_~x~0#1 >= -2147483648;main_~x~0#1 := 2 * main_~x~0#1; {2709#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 36367)} is VALID [2022-02-21 03:02:52,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {2709#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 36367)} assume 2 * main_~x~0#1 <= 2147483647; {2709#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 36367)} is VALID [2022-02-21 03:02:52,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {2709#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 36367)} assume !!(main_~x~0#1 >= 0); {2709#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 36367)} is VALID [2022-02-21 03:02:52,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {2371#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 1;main_~y~0#1 := 1; {2709#(<= (* 3 |ULTIMATE.start_main_~y~0#1|) 36367)} is VALID [2022-02-21 03:02:52,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {2371#true} assume { :begin_inline_ULTIMATE.init } true; {2371#true} is VALID [2022-02-21 03:02:52,236 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:52,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75737614] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:52,236 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:52,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-02-21 03:02:52,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377658759] [2022-02-21 03:02:52,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:52,237 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 24 states have internal predecessors, (111), 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 56 [2022-02-21 03:02:52,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:52,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 24 states have internal predecessors, (111), 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:02:52,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:52,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-21 03:02:52,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:52,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-21 03:02:52,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-02-21 03:02:52,312 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 24 states have internal predecessors, (111), 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:02:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:52,460 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2022-02-21 03:02:52,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-21 03:02:52,460 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 24 states have internal predecessors, (111), 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 56 [2022-02-21 03:02:52,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 24 states have internal predecessors, (111), 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:02:52,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 112 transitions. [2022-02-21 03:02:52,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 24 states have internal predecessors, (111), 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:02:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 112 transitions. [2022-02-21 03:02:52,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 112 transitions. [2022-02-21 03:02:52,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:52,530 INFO L225 Difference]: With dead ends: 117 [2022-02-21 03:02:52,530 INFO L226 Difference]: Without dead ends: 116 [2022-02-21 03:02:52,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 90 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-02-21 03:02:52,531 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:52,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 88 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:52,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-02-21 03:02:52,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-02-21 03:02:52,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:52,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 115 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:52,588 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 115 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:52,588 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 115 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:52,589 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-02-21 03:02:52,589 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-02-21 03:02:52,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:52,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:52,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 115 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 116 states. [2022-02-21 03:02:52,590 INFO L87 Difference]: Start difference. First operand has 116 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 115 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 116 states. [2022-02-21 03:02:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:52,591 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-02-21 03:02:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-02-21 03:02:52,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:52,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:52,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:52,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 115 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2022-02-21 03:02:52,604 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 56 [2022-02-21 03:02:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:52,604 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2022-02-21 03:02:52,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 24 states have internal predecessors, (111), 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:02:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-02-21 03:02:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-21 03:02:52,605 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:52,605 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1] [2022-02-21 03:02:52,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:02:52,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:52,808 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:02:52,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:52,808 INFO L85 PathProgramCache]: Analyzing trace with hash 731952655, now seen corresponding path program 4 times [2022-02-21 03:02:52,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:52,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868196228] [2022-02-21 03:02:52,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:52,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:02:52,863 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:02:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:02:52,891 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:02:52,891 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 03:02:52,892 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-02-21 03:02:52,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-02-21 03:02:52,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-02-21 03:02:52,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-02-21 03:02:52,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-21 03:02:52,896 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2022-02-21 03:02:52,898 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:02:52,931 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:02:52,932 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:02:52,932 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-21 03:02:52,932 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-21 03:02:52,932 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-21 03:02:52,932 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-21 03:02:52,932 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:02:52,932 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:02:52,932 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:02:52,932 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-21 03:02:52,932 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-21 03:02:52,932 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:02:52,932 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:02:52,932 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:02:52,932 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:02:52,932 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:02:52,932 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:02:52,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:02:52 BoogieIcfgContainer [2022-02-21 03:02:52,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:02:52,933 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:02:52,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:02:52,933 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:02:52,933 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:02:46" (3/4) ... [2022-02-21 03:02:52,934 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 03:02:52,980 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:02:52,980 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:02:52,981 INFO L158 Benchmark]: Toolchain (without parser) took 7301.18ms. Allocated memory was 94.4MB in the beginning and 138.4MB in the end (delta: 44.0MB). Free memory was 62.6MB in the beginning and 92.5MB in the end (delta: -30.0MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2022-02-21 03:02:52,982 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:02:52,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.86ms. Allocated memory is still 94.4MB. Free memory was 62.4MB in the beginning and 72.4MB in the end (delta: -10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:02:52,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.61ms. Allocated memory is still 94.4MB. Free memory was 72.4MB in the beginning and 71.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:02:52,985 INFO L158 Benchmark]: Boogie Preprocessor took 10.17ms. Allocated memory is still 94.4MB. Free memory was 71.2MB in the beginning and 70.3MB in the end (delta: 943.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:02:52,985 INFO L158 Benchmark]: RCFGBuilder took 189.06ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 61.6MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:02:52,985 INFO L158 Benchmark]: TraceAbstraction took 6849.98ms. Allocated memory was 94.4MB in the beginning and 138.4MB in the end (delta: 44.0MB). Free memory was 60.9MB in the beginning and 96.7MB in the end (delta: -35.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-02-21 03:02:52,986 INFO L158 Benchmark]: Witness Printer took 47.62ms. Allocated memory is still 138.4MB. Free memory was 96.7MB in the beginning and 93.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:02:52,986 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.14ms. Allocated memory is still 94.4MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.86ms. Allocated memory is still 94.4MB. Free memory was 62.4MB in the beginning and 72.4MB in the end (delta: -10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.61ms. Allocated memory is still 94.4MB. Free memory was 72.4MB in the beginning and 71.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 10.17ms. Allocated memory is still 94.4MB. Free memory was 71.2MB in the beginning and 70.3MB in the end (delta: 943.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 189.06ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 61.6MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6849.98ms. Allocated memory was 94.4MB in the beginning and 138.4MB in the end (delta: 44.0MB). Free memory was 60.9MB in the beginning and 96.7MB in the end (delta: -35.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Witness Printer took 47.62ms. Allocated memory is still 138.4MB. Free memory was 96.7MB in the beginning and 93.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 20]: integer overflow possible integer overflow possible We found a FailurePath: [L15] int x, y; [L16] x = 1 [L17] y = 1 VAL [x=1, y=1] [L18] COND TRUE x >= 0 VAL [x=1, y=1] [L19] EXPR 2*x [L19] x = 2*x VAL [x=2, y=1] [L20] EXPR 3*y [L20] y = 3*y VAL [x=2, y=3] [L18] COND TRUE x >= 0 VAL [x=2, y=3] [L19] EXPR 2*x [L19] x = 2*x VAL [x=4, y=3] [L20] EXPR 3*y [L20] y = 3*y VAL [x=4, y=9] [L18] COND TRUE x >= 0 VAL [x=4, y=9] [L19] EXPR 2*x [L19] x = 2*x VAL [x=8, y=9] [L20] EXPR 3*y [L20] y = 3*y VAL [x=8, y=27] [L18] COND TRUE x >= 0 VAL [x=8, y=27] [L19] EXPR 2*x [L19] x = 2*x VAL [x=16, y=27] [L20] EXPR 3*y [L20] y = 3*y VAL [x=16, y=81] [L18] COND TRUE x >= 0 VAL [x=16, y=81] [L19] EXPR 2*x [L19] x = 2*x VAL [x=32, y=81] [L20] EXPR 3*y [L20] y = 3*y VAL [x=32, y=243] [L18] COND TRUE x >= 0 VAL [x=32, y=243] [L19] EXPR 2*x [L19] x = 2*x VAL [x=64, y=243] [L20] EXPR 3*y [L20] y = 3*y VAL [x=64, y=729] [L18] COND TRUE x >= 0 VAL [x=64, y=729] [L19] EXPR 2*x [L19] x = 2*x VAL [x=128, y=729] [L20] EXPR 3*y [L20] y = 3*y VAL [x=128, y=2187] [L18] COND TRUE x >= 0 VAL [x=128, y=2187] [L19] EXPR 2*x [L19] x = 2*x VAL [x=256, y=2187] [L20] EXPR 3*y [L20] y = 3*y VAL [x=256, y=6561] [L18] COND TRUE x >= 0 VAL [x=256, y=6561] [L19] EXPR 2*x [L19] x = 2*x VAL [x=512, y=6561] [L20] EXPR 3*y [L20] y = 3*y VAL [x=512, y=19683] [L18] COND TRUE x >= 0 VAL [x=512, y=19683] [L19] EXPR 2*x [L19] x = 2*x VAL [x=1024, y=19683] [L20] EXPR 3*y [L20] y = 3*y VAL [x=1024, y=59049] [L18] COND TRUE x >= 0 VAL [x=1024, y=59049] [L19] EXPR 2*x [L19] x = 2*x VAL [x=2048, y=59049] [L20] EXPR 3*y [L20] y = 3*y VAL [x=2048, y=177147] [L18] COND TRUE x >= 0 VAL [x=2048, y=177147] [L19] EXPR 2*x [L19] x = 2*x VAL [x=4096, y=177147] [L20] EXPR 3*y [L20] y = 3*y VAL [x=4096, y=531441] [L18] COND TRUE x >= 0 VAL [x=4096, y=531441] [L19] EXPR 2*x [L19] x = 2*x VAL [x=8192, y=531441] [L20] EXPR 3*y [L20] y = 3*y VAL [x=8192, y=1594323] [L18] COND TRUE x >= 0 VAL [x=8192, y=1594323] [L19] EXPR 2*x [L19] x = 2*x VAL [x=16384, y=1594323] [L20] EXPR 3*y [L20] y = 3*y VAL [x=16384, y=4782969] [L18] COND TRUE x >= 0 VAL [x=16384, y=4782969] [L19] EXPR 2*x [L19] x = 2*x VAL [x=32768, y=4782969] [L20] EXPR 3*y [L20] y = 3*y VAL [x=32768, y=14348907] [L18] COND TRUE x >= 0 VAL [x=32768, y=14348907] [L19] EXPR 2*x [L19] x = 2*x VAL [x=65536, y=14348907] [L20] EXPR 3*y [L20] y = 3*y VAL [x=65536, y=43046721] [L18] COND TRUE x >= 0 VAL [x=65536, y=43046721] [L19] EXPR 2*x [L19] x = 2*x VAL [x=131072, y=43046721] [L20] EXPR 3*y [L20] y = 3*y VAL [x=131072, y=129140163] [L18] COND TRUE x >= 0 VAL [x=131072, y=129140163] [L19] EXPR 2*x [L19] x = 2*x VAL [x=262144, y=129140163] [L20] EXPR 3*y [L20] y = 3*y VAL [x=262144, y=387420489] [L18] COND TRUE x >= 0 VAL [x=262144, y=387420489] [L19] EXPR 2*x [L19] x = 2*x VAL [x=524288, y=387420489] [L20] EXPR 3*y [L20] y = 3*y VAL [x=524288, y=1162261467] [L18] COND TRUE x >= 0 VAL [x=524288, y=1162261467] [L19] EXPR 2*x [L19] x = 2*x VAL [x=1048576, y=1162261467] [L20] 3*y VAL [x=1048576, y=1162261467] - UnprovableResult [Line: 19]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 11, TraceHistogramMax: 20, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 328 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 260 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 237 IncrementalHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 68 mSDtfsCounter, 237 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 292 SyntacticMatches, 30 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=9, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 20 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 540 ConstructedInterpolants, 0 QuantifiedInterpolants, 1912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 336 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 0/1800 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 RESULT: Ultimate proved your program to be incorrect! [2022-02-21 03:02:53,007 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)