./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/theatreSquare.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/loops-crafted-1/theatreSquare.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 90f363148c6ea94b18bb0ae0702d2476b109719554576ef0704192e7e62145c3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:08:57,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:08:57,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:08:57,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:08:57,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:08:57,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:08:57,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:08:57,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:08:57,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:08:57,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:08:57,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:08:57,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:08:57,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:08:58,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:08:58,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:08:58,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:08:58,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:08:58,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:08:58,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:08:58,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:08:58,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:08:58,015 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:08:58,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:08:58,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:08:58,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:08:58,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:08:58,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:08:58,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:08:58,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:08:58,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:08:58,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:08:58,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:08:58,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:08:58,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:08:58,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:08:58,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:08:58,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:08:58,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:08:58,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:08:58,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:08:58,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:08:58,034 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:08:58,061 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:08:58,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:08:58,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:08:58,062 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:08:58,063 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:08:58,063 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:08:58,063 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:08:58,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:08:58,064 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:08:58,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:08:58,065 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:08:58,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:08:58,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:08:58,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:08:58,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:08:58,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:08:58,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:08:58,066 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:08:58,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:08:58,066 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:08:58,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:08:58,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:08:58,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:08:58,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:08:58,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:08:58,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:08:58,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:08:58,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:08:58,068 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:08:58,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:08:58,068 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:08:58,068 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:08:58,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:08:58,069 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 90f363148c6ea94b18bb0ae0702d2476b109719554576ef0704192e7e62145c3 [2022-02-20 17:08:58,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:08:58,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:08:58,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:08:58,297 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:08:58,297 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:08:58,298 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/theatreSquare.c [2022-02-20 17:08:58,345 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a855718e9/b8c826cdd1454f28b68549495e4edf25/FLAGf751012dc [2022-02-20 17:08:58,714 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:08:58,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/theatreSquare.c [2022-02-20 17:08:58,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a855718e9/b8c826cdd1454f28b68549495e4edf25/FLAGf751012dc [2022-02-20 17:08:58,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a855718e9/b8c826cdd1454f28b68549495e4edf25 [2022-02-20 17:08:58,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:08:58,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:08:58,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:08:58,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:08:58,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:08:58,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:08:58" (1/1) ... [2022-02-20 17:08:58,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@703f0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:08:58, skipping insertion in model container [2022-02-20 17:08:58,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:08:58" (1/1) ... [2022-02-20 17:08:58,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:08:58,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:08:58,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/theatreSquare.c[370,383] [2022-02-20 17:08:58,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:08:58,984 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:08:58,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/theatreSquare.c[370,383] [2022-02-20 17:08:59,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:08:59,032 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:08:59,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:08:59 WrapperNode [2022-02-20 17:08:59,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:08:59,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:08:59,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:08:59,036 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:08:59,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:08:59" (1/1) ... [2022-02-20 17:08:59,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:08:59" (1/1) ... [2022-02-20 17:08:59,075 INFO L137 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 100 [2022-02-20 17:08:59,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:08:59,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:08:59,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:08:59,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:08:59,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:08:59" (1/1) ... [2022-02-20 17:08:59,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:08:59" (1/1) ... [2022-02-20 17:08:59,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:08:59" (1/1) ... [2022-02-20 17:08:59,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:08:59" (1/1) ... [2022-02-20 17:08:59,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:08:59" (1/1) ... [2022-02-20 17:08:59,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:08:59" (1/1) ... [2022-02-20 17:08:59,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:08:59" (1/1) ... [2022-02-20 17:08:59,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:08:59,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:08:59,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:08:59,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:08:59,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:08:59" (1/1) ... [2022-02-20 17:08:59,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:08:59,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:08:59,132 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-20 17:08:59,138 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-20 17:08:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:08:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:08:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:08:59,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:08:59,229 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:08:59,230 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:08:59,488 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:08:59,491 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:08:59,492 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 17:08:59,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:08:59 BoogieIcfgContainer [2022-02-20 17:08:59,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:08:59,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:08:59,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:08:59,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:08:59,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:08:58" (1/3) ... [2022-02-20 17:08:59,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5666cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:08:59, skipping insertion in model container [2022-02-20 17:08:59,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:08:59" (2/3) ... [2022-02-20 17:08:59,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5666cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:08:59, skipping insertion in model container [2022-02-20 17:08:59,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:08:59" (3/3) ... [2022-02-20 17:08:59,499 INFO L111 eAbstractionObserver]: Analyzing ICFG theatreSquare.c [2022-02-20 17:08:59,503 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:08:59,503 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:08:59,535 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:08:59,540 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=PETRI_NET, 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-20 17:08:59,540 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:08:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:08:59,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 17:08:59,554 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:08:59,555 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 17:08:59,555 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:08:59,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:08:59,559 INFO L85 PathProgramCache]: Analyzing trace with hash 891969447, now seen corresponding path program 1 times [2022-02-20 17:08:59,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:08:59,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199048708] [2022-02-20 17:08:59,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:08:59,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:08:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:08:59,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-02-20 17:08:59,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {28#(= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|)} is VALID [2022-02-20 17:08:59,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#(= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|)} assume !(((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109); {28#(= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|)} is VALID [2022-02-20 17:08:59,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#(= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {29#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:08:59,751 INFO L290 TraceCheckUtils]: 4: Hoare triple {29#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {27#false} is VALID [2022-02-20 17:08:59,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-02-20 17:08:59,752 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-20 17:08:59,752 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:08:59,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199048708] [2022-02-20 17:08:59,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199048708] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:08:59,753 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:08:59,753 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:08:59,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218967452] [2022-02-20 17:08:59,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:08:59,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-20 17:08:59,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:08:59,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-20 17:08:59,771 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-20 17:08:59,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:08:59,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:08:59,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:08:59,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:08:59,792 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-20 17:08:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:08:59,923 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2022-02-20 17:08:59,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:08:59,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-20 17:08:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:08:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-20 17:08:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-02-20 17:08:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-20 17:08:59,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-02-20 17:08:59,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-02-20 17:09:00,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:00,014 INFO L225 Difference]: With dead ends: 48 [2022-02-20 17:09:00,014 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 17:09:00,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:09:00,018 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:00,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 65 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 17:09:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 17:09:00,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:00,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 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-20 17:09:00,042 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 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-20 17:09:00,042 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 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-20 17:09:00,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:00,048 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-20 17:09:00,048 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 17:09:00,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:00,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:00,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 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 19 states. [2022-02-20 17:09:00,049 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 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 19 states. [2022-02-20 17:09:00,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:00,053 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-20 17:09:00,053 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 17:09:00,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:00,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:00,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:00,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 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-20 17:09:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-02-20 17:09:00,058 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 6 [2022-02-20 17:09:00,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:00,058 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-02-20 17:09:00,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-20 17:09:00,060 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 17:09:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:09:00,061 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:00,061 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:00,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:09:00,062 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:00,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:00,065 INFO L85 PathProgramCache]: Analyzing trace with hash 535820783, now seen corresponding path program 1 times [2022-02-20 17:09:00,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:00,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862651155] [2022-02-20 17:09:00,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:00,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:00,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {162#true} is VALID [2022-02-20 17:09:00,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {162#true} is VALID [2022-02-20 17:09:00,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {162#true} is VALID [2022-02-20 17:09:00,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {162#true} assume !(correct_version_~b~0#1 < correct_version_~n#1); {162#true} is VALID [2022-02-20 17:09:00,167 INFO L290 TraceCheckUtils]: 4: Hoare triple {162#true} assume !(correct_version_~l~0#1 < correct_version_~m#1); {162#true} is VALID [2022-02-20 17:09:00,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#true} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {164#(= |ULTIMATE.start_correct_version_~y~0#1| 0)} is VALID [2022-02-20 17:09:00,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {164#(= |ULTIMATE.start_correct_version_~y~0#1| 0)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {164#(= |ULTIMATE.start_correct_version_~y~0#1| 0)} is VALID [2022-02-20 17:09:00,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {164#(= |ULTIMATE.start_correct_version_~y~0#1| 0)} correct_version_#res#1 := correct_version_~y~0#1; {165#(= |ULTIMATE.start_correct_version_#res#1| 0)} is VALID [2022-02-20 17:09:00,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {165#(= |ULTIMATE.start_correct_version_#res#1| 0)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {166#(= |ULTIMATE.start_main_~n_stones1~0#1| 0)} is VALID [2022-02-20 17:09:00,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(= |ULTIMATE.start_main_~n_stones1~0#1| 0)} assume !(student_version_~b~1#1 < student_version_~n#1); {166#(= |ULTIMATE.start_main_~n_stones1~0#1| 0)} is VALID [2022-02-20 17:09:00,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(= |ULTIMATE.start_main_~n_stones1~0#1| 0)} assume !(student_version_~l~1#1 < student_version_~m#1); {166#(= |ULTIMATE.start_main_~n_stones1~0#1| 0)} is VALID [2022-02-20 17:09:00,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(= |ULTIMATE.start_main_~n_stones1~0#1| 0)} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {167#(= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|)} is VALID [2022-02-20 17:09:00,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#(= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|)} assume !(student_version_~x~1#1 < student_version_~i~1#1); {167#(= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|)} is VALID [2022-02-20 17:09:00,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {167#(= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|)} student_version_#res#1 := student_version_~y~1#1; {168#(= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|)} is VALID [2022-02-20 17:09:00,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {168#(= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|)} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {169#(= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|)} is VALID [2022-02-20 17:09:00,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {169#(= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {170#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:09:00,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {170#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {163#false} is VALID [2022-02-20 17:09:00,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {163#false} assume !false; {163#false} is VALID [2022-02-20 17:09:00,174 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-20 17:09:00,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:00,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862651155] [2022-02-20 17:09:00,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862651155] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:09:00,174 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:09:00,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 17:09:00,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126702759] [2022-02-20 17:09:00,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:09:00,176 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 17:09:00,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:00,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:00,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:09:00,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:00,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:09:00,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:09:00,192 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:00,435 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-02-20 17:09:00,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:09:00,435 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 17:09:00,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-02-20 17:09:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-02-20 17:09:00,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2022-02-20 17:09:00,468 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-20 17:09:00,470 INFO L225 Difference]: With dead ends: 39 [2022-02-20 17:09:00,470 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 17:09:00,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:09:00,471 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 64 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:00,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 133 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 17:09:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2022-02-20 17:09:00,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:00,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,476 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,476 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:00,477 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 17:09:00,477 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-02-20 17:09:00,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:00,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:00,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-20 17:09:00,478 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-20 17:09:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:00,480 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 17:09:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-02-20 17:09:00,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:00,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:00,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:00,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-02-20 17:09:00,482 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 18 [2022-02-20 17:09:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:00,483 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-02-20 17:09:00,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-02-20 17:09:00,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:09:00,483 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:00,484 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:00,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:09:00,484 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:00,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:00,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1031838486, now seen corresponding path program 1 times [2022-02-20 17:09:00,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:00,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973002677] [2022-02-20 17:09:00,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:00,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:00,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {341#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {341#true} is VALID [2022-02-20 17:09:00,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {341#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {341#true} is VALID [2022-02-20 17:09:00,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {341#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {341#true} is VALID [2022-02-20 17:09:00,557 INFO L290 TraceCheckUtils]: 3: Hoare triple {341#true} assume !(correct_version_~b~0#1 < correct_version_~n#1); {341#true} is VALID [2022-02-20 17:09:00,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {341#true} assume !(correct_version_~l~0#1 < correct_version_~m#1); {341#true} is VALID [2022-02-20 17:09:00,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {341#true} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {341#true} is VALID [2022-02-20 17:09:00,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {341#true} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {341#true} is VALID [2022-02-20 17:09:00,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {341#true} correct_version_#res#1 := correct_version_~y~0#1; {341#true} is VALID [2022-02-20 17:09:00,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {341#true} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {343#(= |ULTIMATE.start_student_version_~i~1#1| 0)} is VALID [2022-02-20 17:09:00,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {343#(= |ULTIMATE.start_student_version_~i~1#1| 0)} assume !(student_version_~b~1#1 < student_version_~n#1); {343#(= |ULTIMATE.start_student_version_~i~1#1| 0)} is VALID [2022-02-20 17:09:00,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {343#(= |ULTIMATE.start_student_version_~i~1#1| 0)} assume !(student_version_~l~1#1 < student_version_~m#1); {343#(= |ULTIMATE.start_student_version_~i~1#1| 0)} is VALID [2022-02-20 17:09:00,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {343#(= |ULTIMATE.start_student_version_~i~1#1| 0)} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {344#(and (= |ULTIMATE.start_student_version_~i~1#1| 0) (= |ULTIMATE.start_student_version_~x~1#1| 0))} is VALID [2022-02-20 17:09:00,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {344#(and (= |ULTIMATE.start_student_version_~i~1#1| 0) (= |ULTIMATE.start_student_version_~x~1#1| 0))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {342#false} is VALID [2022-02-20 17:09:00,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {342#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {342#false} is VALID [2022-02-20 17:09:00,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {342#false} student_version_#res#1 := student_version_~y~1#1; {342#false} is VALID [2022-02-20 17:09:00,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {342#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {342#false} is VALID [2022-02-20 17:09:00,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {342#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {342#false} is VALID [2022-02-20 17:09:00,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {342#false} assume 0 == __VERIFIER_assert_~cond#1; {342#false} is VALID [2022-02-20 17:09:00,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {342#false} assume !false; {342#false} is VALID [2022-02-20 17:09:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:00,565 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:00,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973002677] [2022-02-20 17:09:00,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973002677] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:09:00,566 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:09:00,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:09:00,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716079518] [2022-02-20 17:09:00,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:09:00,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 17:09:00,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:00,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-20 17:09:00,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:00,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:09:00,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:00,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:09:00,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:09:00,583 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-20 17:09:00,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:00,634 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-02-20 17:09:00,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:09:00,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 17:09:00,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-20 17:09:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-02-20 17:09:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-20 17:09:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-02-20 17:09:00,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2022-02-20 17:09:00,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:00,674 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:09:00,674 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 17:09:00,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:09:00,675 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:00,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 61 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 17:09:00,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-02-20 17:09:00,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:00,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,679 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,680 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:00,681 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 17:09:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-02-20 17:09:00,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:00,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:00,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 17:09:00,682 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 17:09:00,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:00,684 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 17:09:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-02-20 17:09:00,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:00,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:00,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:00,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-02-20 17:09:00,686 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 19 [2022-02-20 17:09:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:00,686 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-02-20 17:09:00,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-20 17:09:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-02-20 17:09:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:09:00,687 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:00,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:00,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:09:00,688 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:00,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1782670069, now seen corresponding path program 1 times [2022-02-20 17:09:00,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:00,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284029809] [2022-02-20 17:09:00,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:00,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:00,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {529#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {529#true} is VALID [2022-02-20 17:09:00,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {529#true} is VALID [2022-02-20 17:09:00,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {529#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {531#(= |ULTIMATE.start_correct_version_~i~0#1| 0)} is VALID [2022-02-20 17:09:00,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {531#(= |ULTIMATE.start_correct_version_~i~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {531#(= |ULTIMATE.start_correct_version_~i~0#1| 0)} is VALID [2022-02-20 17:09:00,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {531#(= |ULTIMATE.start_correct_version_~i~0#1| 0)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {531#(= |ULTIMATE.start_correct_version_~i~0#1| 0)} is VALID [2022-02-20 17:09:00,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {531#(= |ULTIMATE.start_correct_version_~i~0#1| 0)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {532#(and (= |ULTIMATE.start_correct_version_~x~0#1| 0) (= |ULTIMATE.start_correct_version_~i~0#1| 0))} is VALID [2022-02-20 17:09:00,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {532#(and (= |ULTIMATE.start_correct_version_~x~0#1| 0) (= |ULTIMATE.start_correct_version_~i~0#1| 0))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {530#false} is VALID [2022-02-20 17:09:00,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {530#false} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {530#false} is VALID [2022-02-20 17:09:00,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {530#false} correct_version_#res#1 := correct_version_~y~0#1; {530#false} is VALID [2022-02-20 17:09:00,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {530#false} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {530#false} is VALID [2022-02-20 17:09:00,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {530#false} assume !(student_version_~b~1#1 < student_version_~n#1); {530#false} is VALID [2022-02-20 17:09:00,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {530#false} assume !(student_version_~l~1#1 < student_version_~m#1); {530#false} is VALID [2022-02-20 17:09:00,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {530#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {530#false} is VALID [2022-02-20 17:09:00,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {530#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {530#false} is VALID [2022-02-20 17:09:00,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {530#false} student_version_#res#1 := student_version_~y~1#1; {530#false} is VALID [2022-02-20 17:09:00,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {530#false} is VALID [2022-02-20 17:09:00,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {530#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {530#false} is VALID [2022-02-20 17:09:00,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {530#false} assume 0 == __VERIFIER_assert_~cond#1; {530#false} is VALID [2022-02-20 17:09:00,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {530#false} assume !false; {530#false} is VALID [2022-02-20 17:09:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:00,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:00,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284029809] [2022-02-20 17:09:00,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284029809] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:09:00,742 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:09:00,742 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:09:00,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713744497] [2022-02-20 17:09:00,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:09:00,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 17:09:00,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:00,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-20 17:09:00,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:00,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:09:00,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:00,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:09:00,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:09:00,760 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-20 17:09:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:00,811 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2022-02-20 17:09:00,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:09:00,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 17:09:00,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-20 17:09:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-02-20 17:09:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-20 17:09:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-02-20 17:09:00,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-02-20 17:09:00,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:00,857 INFO L225 Difference]: With dead ends: 66 [2022-02-20 17:09:00,857 INFO L226 Difference]: Without dead ends: 49 [2022-02-20 17:09:00,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:09:00,859 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:00,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 61 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:00,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-20 17:09:00,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-02-20 17:09:00,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:00,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 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-20 17:09:00,863 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 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-20 17:09:00,864 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 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-20 17:09:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:00,865 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2022-02-20 17:09:00,865 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-02-20 17:09:00,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:00,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:00,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 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) Second operand 49 states. [2022-02-20 17:09:00,866 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 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) Second operand 49 states. [2022-02-20 17:09:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:00,867 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2022-02-20 17:09:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-02-20 17:09:00,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:00,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:00,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:00,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 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-20 17:09:00,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-02-20 17:09:00,870 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 19 [2022-02-20 17:09:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:00,870 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-02-20 17:09:00,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-20 17:09:00,870 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-02-20 17:09:00,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:09:00,871 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:00,871 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:00,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:09:00,871 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:00,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1545632287, now seen corresponding path program 1 times [2022-02-20 17:09:00,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:00,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182452403] [2022-02-20 17:09:00,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:00,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:00,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {777#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {777#true} is VALID [2022-02-20 17:09:00,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {777#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {777#true} is VALID [2022-02-20 17:09:00,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {777#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {779#(and (<= 1 |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_correct_version_~l~0#1| 0))} is VALID [2022-02-20 17:09:00,915 INFO L290 TraceCheckUtils]: 3: Hoare triple {779#(and (<= 1 |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_correct_version_~l~0#1| 0))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {779#(and (<= 1 |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_correct_version_~l~0#1| 0))} is VALID [2022-02-20 17:09:00,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {779#(and (<= 1 |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_correct_version_~l~0#1| 0))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {778#false} is VALID [2022-02-20 17:09:00,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {778#false} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {778#false} is VALID [2022-02-20 17:09:00,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {778#false} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {778#false} is VALID [2022-02-20 17:09:00,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {778#false} correct_version_#res#1 := correct_version_~y~0#1; {778#false} is VALID [2022-02-20 17:09:00,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {778#false} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {778#false} is VALID [2022-02-20 17:09:00,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {778#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {778#false} is VALID [2022-02-20 17:09:00,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {778#false} assume !(student_version_~b~1#1 < student_version_~n#1); {778#false} is VALID [2022-02-20 17:09:00,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {778#false} assume !(student_version_~l~1#1 < student_version_~m#1); {778#false} is VALID [2022-02-20 17:09:00,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {778#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {778#false} is VALID [2022-02-20 17:09:00,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {778#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {778#false} is VALID [2022-02-20 17:09:00,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {778#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {778#false} is VALID [2022-02-20 17:09:00,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {778#false} student_version_#res#1 := student_version_~y~1#1; {778#false} is VALID [2022-02-20 17:09:00,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {778#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {778#false} is VALID [2022-02-20 17:09:00,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {778#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {778#false} is VALID [2022-02-20 17:09:00,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {778#false} assume 0 == __VERIFIER_assert_~cond#1; {778#false} is VALID [2022-02-20 17:09:00,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {778#false} assume !false; {778#false} is VALID [2022-02-20 17:09:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:09:00,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:00,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182452403] [2022-02-20 17:09:00,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182452403] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:09:00,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:09:00,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:09:00,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870108429] [2022-02-20 17:09:00,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:09:00,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 17:09:00,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:00,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:00,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:09:00,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:00,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:09:00,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:09:00,933 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:00,956 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-02-20 17:09:00,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:09:00,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 17:09:00,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-02-20 17:09:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-02-20 17:09:00,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2022-02-20 17:09:00,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:00,983 INFO L225 Difference]: With dead ends: 65 [2022-02-20 17:09:00,983 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 17:09:00,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:09:00,984 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:00,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:00,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 17:09:00,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-20 17:09:00,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:00,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,991 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,991 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:00,992 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-02-20 17:09:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-02-20 17:09:00,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:00,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:00,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 17:09:00,993 INFO L87 Difference]: Start difference. First operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 17:09:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:00,994 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-02-20 17:09:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-02-20 17:09:00,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:00,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:00,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:00,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-02-20 17:09:00,996 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 20 [2022-02-20 17:09:00,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:00,996 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-02-20 17:09:00,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-02-20 17:09:00,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 17:09:00,997 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:00,997 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:00,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 17:09:00,998 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:00,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:00,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2031253980, now seen corresponding path program 1 times [2022-02-20 17:09:00,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:00,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744669652] [2022-02-20 17:09:00,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:00,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:01,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {1001#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1001#true} is VALID [2022-02-20 17:09:01,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {1001#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {1001#true} is VALID [2022-02-20 17:09:01,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {1001#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {1003#(and (<= 1 |ULTIMATE.start_correct_version_~n#1|) (= |ULTIMATE.start_correct_version_~b~0#1| 0))} is VALID [2022-02-20 17:09:01,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {1003#(and (<= 1 |ULTIMATE.start_correct_version_~n#1|) (= |ULTIMATE.start_correct_version_~b~0#1| 0))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {1002#false} is VALID [2022-02-20 17:09:01,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {1002#false} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {1002#false} is VALID [2022-02-20 17:09:01,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {1002#false} assume !(correct_version_~l~0#1 < correct_version_~m#1); {1002#false} is VALID [2022-02-20 17:09:01,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {1002#false} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {1002#false} is VALID [2022-02-20 17:09:01,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {1002#false} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {1002#false} is VALID [2022-02-20 17:09:01,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {1002#false} correct_version_#res#1 := correct_version_~y~0#1; {1002#false} is VALID [2022-02-20 17:09:01,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {1002#false} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {1002#false} is VALID [2022-02-20 17:09:01,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {1002#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {1002#false} is VALID [2022-02-20 17:09:01,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {1002#false} assume !(student_version_~b~1#1 < student_version_~n#1); {1002#false} is VALID [2022-02-20 17:09:01,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {1002#false} assume !(student_version_~l~1#1 < student_version_~m#1); {1002#false} is VALID [2022-02-20 17:09:01,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {1002#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {1002#false} is VALID [2022-02-20 17:09:01,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {1002#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {1002#false} is VALID [2022-02-20 17:09:01,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {1002#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {1002#false} is VALID [2022-02-20 17:09:01,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {1002#false} student_version_#res#1 := student_version_~y~1#1; {1002#false} is VALID [2022-02-20 17:09:01,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {1002#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {1002#false} is VALID [2022-02-20 17:09:01,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {1002#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1002#false} is VALID [2022-02-20 17:09:01,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {1002#false} assume 0 == __VERIFIER_assert_~cond#1; {1002#false} is VALID [2022-02-20 17:09:01,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {1002#false} assume !false; {1002#false} is VALID [2022-02-20 17:09:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 17:09:01,044 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:01,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744669652] [2022-02-20 17:09:01,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744669652] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:09:01,044 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:09:01,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:09:01,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561164441] [2022-02-20 17:09:01,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:09:01,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 21 [2022-02-20 17:09:01,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:01,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-20 17:09:01,056 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-20 17:09:01,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:09:01,057 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:01,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:09:01,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:09:01,058 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-20 17:09:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:01,081 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-02-20 17:09:01,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:09:01,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 21 [2022-02-20 17:09:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-20 17:09:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-02-20 17:09:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-20 17:09:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-02-20 17:09:01,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 44 transitions. [2022-02-20 17:09:01,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:01,121 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:09:01,121 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 17:09:01,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:09:01,122 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:01,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 17:09:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 17:09:01,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:01,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 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-20 17:09:01,131 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 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-20 17:09:01,131 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 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-20 17:09:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:01,132 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-02-20 17:09:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-20 17:09:01,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:01,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:01,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 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 33 states. [2022-02-20 17:09:01,133 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 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 33 states. [2022-02-20 17:09:01,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:01,134 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-02-20 17:09:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-20 17:09:01,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:01,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:01,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:01,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:01,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 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-20 17:09:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-02-20 17:09:01,136 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 21 [2022-02-20 17:09:01,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:01,136 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-02-20 17:09:01,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-20 17:09:01,136 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-20 17:09:01,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 17:09:01,137 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:01,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:01,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 17:09:01,137 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:01,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:01,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1130312570, now seen corresponding path program 1 times [2022-02-20 17:09:01,138 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:01,138 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397533481] [2022-02-20 17:09:01,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:01,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:01,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {1191#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1191#true} is VALID [2022-02-20 17:09:01,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {1191#true} is VALID [2022-02-20 17:09:01,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:01,181 INFO L290 TraceCheckUtils]: 3: Hoare triple {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:01,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:01,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:01,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:01,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:01,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:01,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:01,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:01,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {1193#(<= 1 |ULTIMATE.start_main_~n~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {1194#(and (<= 1 |ULTIMATE.start_student_version_~n#1|) (= |ULTIMATE.start_student_version_~b~1#1| 0))} is VALID [2022-02-20 17:09:01,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {1194#(and (<= 1 |ULTIMATE.start_student_version_~n#1|) (= |ULTIMATE.start_student_version_~b~1#1| 0))} assume !(student_version_~b~1#1 < student_version_~n#1); {1192#false} is VALID [2022-02-20 17:09:01,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {1192#false} assume !(student_version_~l~1#1 < student_version_~m#1); {1192#false} is VALID [2022-02-20 17:09:01,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {1192#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {1192#false} is VALID [2022-02-20 17:09:01,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {1192#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {1192#false} is VALID [2022-02-20 17:09:01,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#false} student_version_#res#1 := student_version_~y~1#1; {1192#false} is VALID [2022-02-20 17:09:01,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {1192#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {1192#false} is VALID [2022-02-20 17:09:01,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {1192#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1192#false} is VALID [2022-02-20 17:09:01,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {1192#false} assume 0 == __VERIFIER_assert_~cond#1; {1192#false} is VALID [2022-02-20 17:09:01,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-02-20 17:09:01,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 17:09:01,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:01,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397533481] [2022-02-20 17:09:01,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397533481] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:09:01,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:09:01,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:09:01,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657406902] [2022-02-20 17:09:01,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:09:01,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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 21 [2022-02-20 17:09:01,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:01,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-20 17:09:01,199 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-20 17:09:01,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:09:01,200 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:01,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:09:01,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:09:01,200 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-20 17:09:01,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:01,244 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-02-20 17:09:01,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:09:01,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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 21 [2022-02-20 17:09:01,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:01,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-20 17:09:01,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-02-20 17:09:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-20 17:09:01,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-02-20 17:09:01,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2022-02-20 17:09:01,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:01,268 INFO L225 Difference]: With dead ends: 39 [2022-02-20 17:09:01,268 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:09:01,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:09:01,269 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:01,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 44 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:09:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 17:09:01,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:01,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:01,286 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:01,286 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:01,287 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-02-20 17:09:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-02-20 17:09:01,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:01,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:01,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 17:09:01,288 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 17:09:01,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:01,289 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-02-20 17:09:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-02-20 17:09:01,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:01,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:01,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:01,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-02-20 17:09:01,290 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 21 [2022-02-20 17:09:01,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:01,290 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-02-20 17:09:01,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-20 17:09:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-02-20 17:09:01,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 17:09:01,291 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:01,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:01,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 17:09:01,292 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:01,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1437483694, now seen corresponding path program 1 times [2022-02-20 17:09:01,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:01,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543909112] [2022-02-20 17:09:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:01,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:01,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1356#true} is VALID [2022-02-20 17:09:01,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {1356#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {1356#true} is VALID [2022-02-20 17:09:01,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {1356#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {1358#(= |ULTIMATE.start_correct_version_~i~0#1| 0)} is VALID [2022-02-20 17:09:01,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {1358#(= |ULTIMATE.start_correct_version_~i~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {1359#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:01,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {1359#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {1359#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:01,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {1359#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {1359#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:01,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {1359#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {1359#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:01,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {1359#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {1360#(and (<= 1 |ULTIMATE.start_correct_version_~i~0#1|) (= |ULTIMATE.start_correct_version_~x~0#1| 0))} is VALID [2022-02-20 17:09:01,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {1360#(and (<= 1 |ULTIMATE.start_correct_version_~i~0#1|) (= |ULTIMATE.start_correct_version_~x~0#1| 0))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {1357#false} is VALID [2022-02-20 17:09:01,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {1357#false} correct_version_#res#1 := correct_version_~y~0#1; {1357#false} is VALID [2022-02-20 17:09:01,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {1357#false} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {1357#false} is VALID [2022-02-20 17:09:01,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {1357#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {1357#false} is VALID [2022-02-20 17:09:01,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {1357#false} assume !(student_version_~b~1#1 < student_version_~n#1); {1357#false} is VALID [2022-02-20 17:09:01,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {1357#false} assume !(student_version_~l~1#1 < student_version_~m#1); {1357#false} is VALID [2022-02-20 17:09:01,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {1357#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {1357#false} is VALID [2022-02-20 17:09:01,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {1357#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {1357#false} is VALID [2022-02-20 17:09:01,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {1357#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {1357#false} is VALID [2022-02-20 17:09:01,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {1357#false} student_version_#res#1 := student_version_~y~1#1; {1357#false} is VALID [2022-02-20 17:09:01,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {1357#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {1357#false} is VALID [2022-02-20 17:09:01,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {1357#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1357#false} is VALID [2022-02-20 17:09:01,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {1357#false} assume 0 == __VERIFIER_assert_~cond#1; {1357#false} is VALID [2022-02-20 17:09:01,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {1357#false} assume !false; {1357#false} is VALID [2022-02-20 17:09:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 17:09:01,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:01,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543909112] [2022-02-20 17:09:01,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543909112] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:01,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133988507] [2022-02-20 17:09:01,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:01,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:01,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:01,347 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-20 17:09:01,348 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-20 17:09:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:01,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 17:09:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:01,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:01,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1356#true} is VALID [2022-02-20 17:09:01,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {1356#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {1356#true} is VALID [2022-02-20 17:09:01,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {1356#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {1370#(<= 0 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:01,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {1370#(<= 0 |ULTIMATE.start_correct_version_~i~0#1|)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {1359#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:01,562 INFO L290 TraceCheckUtils]: 4: Hoare triple {1359#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {1359#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:01,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {1359#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {1359#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:01,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {1359#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {1359#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:01,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {1359#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {1386#(and (<= |ULTIMATE.start_correct_version_~x~0#1| 0) (<= 1 |ULTIMATE.start_correct_version_~i~0#1|))} is VALID [2022-02-20 17:09:01,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {1386#(and (<= |ULTIMATE.start_correct_version_~x~0#1| 0) (<= 1 |ULTIMATE.start_correct_version_~i~0#1|))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {1357#false} is VALID [2022-02-20 17:09:01,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {1357#false} correct_version_#res#1 := correct_version_~y~0#1; {1357#false} is VALID [2022-02-20 17:09:01,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {1357#false} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {1357#false} is VALID [2022-02-20 17:09:01,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {1357#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {1357#false} is VALID [2022-02-20 17:09:01,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {1357#false} assume !(student_version_~b~1#1 < student_version_~n#1); {1357#false} is VALID [2022-02-20 17:09:01,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {1357#false} assume !(student_version_~l~1#1 < student_version_~m#1); {1357#false} is VALID [2022-02-20 17:09:01,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {1357#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {1357#false} is VALID [2022-02-20 17:09:01,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {1357#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {1357#false} is VALID [2022-02-20 17:09:01,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {1357#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {1357#false} is VALID [2022-02-20 17:09:01,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {1357#false} student_version_#res#1 := student_version_~y~1#1; {1357#false} is VALID [2022-02-20 17:09:01,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {1357#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {1357#false} is VALID [2022-02-20 17:09:01,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {1357#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1357#false} is VALID [2022-02-20 17:09:01,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {1357#false} assume 0 == __VERIFIER_assert_~cond#1; {1357#false} is VALID [2022-02-20 17:09:01,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {1357#false} assume !false; {1357#false} is VALID [2022-02-20 17:09:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 17:09:01,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:09:01,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133988507] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:09:01,565 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:09:01,565 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-02-20 17:09:01,565 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151611257] [2022-02-20 17:09:01,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:09:01,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 17:09:01,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:01,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:01,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:01,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:09:01,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:01,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:09:01,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:09:01,581 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:01,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:01,637 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-02-20 17:09:01,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:09:01,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 17:09:01,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 17:09:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 17:09:01,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 17:09:01,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:01,665 INFO L225 Difference]: With dead ends: 37 [2022-02-20 17:09:01,665 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:09:01,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:09:01,666 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:01,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 42 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:09:01,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 17:09:01,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:01,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 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-20 17:09:01,681 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 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-20 17:09:01,682 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 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-20 17:09:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:01,682 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-02-20 17:09:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-20 17:09:01,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:01,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:01,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 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 23 states. [2022-02-20 17:09:01,683 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 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 23 states. [2022-02-20 17:09:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:01,684 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-02-20 17:09:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-20 17:09:01,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:01,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:01,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:01,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 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-20 17:09:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-02-20 17:09:01,685 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 22 [2022-02-20 17:09:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:01,685 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-02-20 17:09:01,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:01,686 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-20 17:09:01,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 17:09:01,686 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:01,686 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:01,706 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-20 17:09:01,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:01,900 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:01,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1965889039, now seen corresponding path program 1 times [2022-02-20 17:09:01,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:01,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679662936] [2022-02-20 17:09:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:01,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:01,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {1558#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1558#true} is VALID [2022-02-20 17:09:01,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {1558#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {1558#true} is VALID [2022-02-20 17:09:01,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {1558#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {1558#true} is VALID [2022-02-20 17:09:01,950 INFO L290 TraceCheckUtils]: 3: Hoare triple {1558#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {1558#true} is VALID [2022-02-20 17:09:01,951 INFO L290 TraceCheckUtils]: 4: Hoare triple {1558#true} assume !(correct_version_~b~0#1 < correct_version_~n#1); {1558#true} is VALID [2022-02-20 17:09:01,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {1558#true} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {1558#true} is VALID [2022-02-20 17:09:01,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {1558#true} assume !(correct_version_~l~0#1 < correct_version_~m#1); {1558#true} is VALID [2022-02-20 17:09:01,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {1558#true} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {1558#true} is VALID [2022-02-20 17:09:01,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {1558#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {1558#true} is VALID [2022-02-20 17:09:01,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {1558#true} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {1558#true} is VALID [2022-02-20 17:09:01,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {1558#true} correct_version_#res#1 := correct_version_~y~0#1; {1558#true} is VALID [2022-02-20 17:09:01,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {1558#true} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {1560#(= |ULTIMATE.start_student_version_~i~1#1| 0)} is VALID [2022-02-20 17:09:01,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {1560#(= |ULTIMATE.start_student_version_~i~1#1| 0)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {1561#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:01,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {1561#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} assume !(student_version_~b~1#1 < student_version_~n#1); {1561#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:01,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {1561#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} assume !(student_version_~l~1#1 < student_version_~m#1); {1561#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:01,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {1561#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {1562#(and (<= 1 |ULTIMATE.start_student_version_~i~1#1|) (= |ULTIMATE.start_student_version_~x~1#1| 0))} is VALID [2022-02-20 17:09:01,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {1562#(and (<= 1 |ULTIMATE.start_student_version_~i~1#1|) (= |ULTIMATE.start_student_version_~x~1#1| 0))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {1559#false} is VALID [2022-02-20 17:09:01,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {1559#false} student_version_#res#1 := student_version_~y~1#1; {1559#false} is VALID [2022-02-20 17:09:01,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {1559#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {1559#false} is VALID [2022-02-20 17:09:01,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {1559#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1559#false} is VALID [2022-02-20 17:09:01,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {1559#false} assume 0 == __VERIFIER_assert_~cond#1; {1559#false} is VALID [2022-02-20 17:09:01,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {1559#false} assume !false; {1559#false} is VALID [2022-02-20 17:09:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 17:09:01,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:01,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679662936] [2022-02-20 17:09:01,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679662936] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:01,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952240139] [2022-02-20 17:09:01,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:01,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:01,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:01,960 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-20 17:09:01,961 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-20 17:09:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:02,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:09:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:02,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:02,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {1558#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1558#true} is VALID [2022-02-20 17:09:02,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {1558#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {1558#true} is VALID [2022-02-20 17:09:02,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {1558#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:02,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:02,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:02,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:02,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:02,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:02,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:02,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:02,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:02,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {1572#(<= 1 |ULTIMATE.start_main_~m~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {1600#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= 1 |ULTIMATE.start_student_version_~m#1|))} is VALID [2022-02-20 17:09:02,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {1600#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= 1 |ULTIMATE.start_student_version_~m#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {1600#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= 1 |ULTIMATE.start_student_version_~m#1|))} is VALID [2022-02-20 17:09:02,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {1600#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= 1 |ULTIMATE.start_student_version_~m#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {1600#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= 1 |ULTIMATE.start_student_version_~m#1|))} is VALID [2022-02-20 17:09:02,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {1600#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= 1 |ULTIMATE.start_student_version_~m#1|))} assume !(student_version_~l~1#1 < student_version_~m#1); {1559#false} is VALID [2022-02-20 17:09:02,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {1559#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {1559#false} is VALID [2022-02-20 17:09:02,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {1559#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {1559#false} is VALID [2022-02-20 17:09:02,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {1559#false} student_version_#res#1 := student_version_~y~1#1; {1559#false} is VALID [2022-02-20 17:09:02,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {1559#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {1559#false} is VALID [2022-02-20 17:09:02,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {1559#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1559#false} is VALID [2022-02-20 17:09:02,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {1559#false} assume 0 == __VERIFIER_assert_~cond#1; {1559#false} is VALID [2022-02-20 17:09:02,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {1559#false} assume !false; {1559#false} is VALID [2022-02-20 17:09:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:02,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:09:02,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952240139] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:09:02,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:09:02,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-02-20 17:09:02,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446187670] [2022-02-20 17:09:02,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:09:02,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 17:09:02,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:02,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:02,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:02,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:09:02,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:02,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:09:02,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:09:02,207 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:02,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:02,253 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 17:09:02,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:09:02,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 17:09:02,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-20 17:09:02,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-20 17:09:02,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-02-20 17:09:02,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:02,276 INFO L225 Difference]: With dead ends: 32 [2022-02-20 17:09:02,276 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:09:02,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:09:02,278 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:02,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:02,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:09:02,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:09:02,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:02,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:02,304 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:02,304 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:02,308 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-02-20 17:09:02,308 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-20 17:09:02,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:02,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:02,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states. [2022-02-20 17:09:02,309 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states. [2022-02-20 17:09:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:02,310 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-02-20 17:09:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-20 17:09:02,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:02,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:02,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:02,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-02-20 17:09:02,311 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 22 [2022-02-20 17:09:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:02,312 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-02-20 17:09:02,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-20 17:09:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 17:09:02,313 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:02,313 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:02,332 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-20 17:09:02,517 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,SelfDestructingSolverStorable8 [2022-02-20 17:09:02,517 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:02,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:02,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1829813877, now seen corresponding path program 1 times [2022-02-20 17:09:02,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:02,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618166009] [2022-02-20 17:09:02,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:02,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {1756#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1756#true} is VALID [2022-02-20 17:09:02,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {1756#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {1756#true} is VALID [2022-02-20 17:09:02,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {1756#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {1756#true} is VALID [2022-02-20 17:09:02,570 INFO L290 TraceCheckUtils]: 3: Hoare triple {1756#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {1756#true} is VALID [2022-02-20 17:09:02,570 INFO L290 TraceCheckUtils]: 4: Hoare triple {1756#true} assume !(correct_version_~b~0#1 < correct_version_~n#1); {1756#true} is VALID [2022-02-20 17:09:02,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {1756#true} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {1756#true} is VALID [2022-02-20 17:09:02,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {1756#true} assume !(correct_version_~l~0#1 < correct_version_~m#1); {1756#true} is VALID [2022-02-20 17:09:02,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {1756#true} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {1756#true} is VALID [2022-02-20 17:09:02,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {1756#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {1756#true} is VALID [2022-02-20 17:09:02,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {1756#true} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {1756#true} is VALID [2022-02-20 17:09:02,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {1756#true} correct_version_#res#1 := correct_version_~y~0#1; {1756#true} is VALID [2022-02-20 17:09:02,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {1756#true} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {1758#(= |ULTIMATE.start_student_version_~i~1#1| 0)} is VALID [2022-02-20 17:09:02,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {1758#(= |ULTIMATE.start_student_version_~i~1#1| 0)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {1759#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:02,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {1759#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} assume !(student_version_~b~1#1 < student_version_~n#1); {1759#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:02,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {1759#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {1759#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:02,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {1759#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} assume !(student_version_~l~1#1 < student_version_~m#1); {1759#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:02,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {1759#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {1760#(and (<= 1 |ULTIMATE.start_student_version_~i~1#1|) (= |ULTIMATE.start_student_version_~x~1#1| 0))} is VALID [2022-02-20 17:09:02,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {1760#(and (<= 1 |ULTIMATE.start_student_version_~i~1#1|) (= |ULTIMATE.start_student_version_~x~1#1| 0))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {1757#false} is VALID [2022-02-20 17:09:02,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {1757#false} student_version_#res#1 := student_version_~y~1#1; {1757#false} is VALID [2022-02-20 17:09:02,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {1757#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {1757#false} is VALID [2022-02-20 17:09:02,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {1757#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1757#false} is VALID [2022-02-20 17:09:02,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {1757#false} assume 0 == __VERIFIER_assert_~cond#1; {1757#false} is VALID [2022-02-20 17:09:02,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {1757#false} assume !false; {1757#false} is VALID [2022-02-20 17:09:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:02,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:02,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618166009] [2022-02-20 17:09:02,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618166009] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:02,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723086037] [2022-02-20 17:09:02,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:02,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:02,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:02,583 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-20 17:09:02,584 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-20 17:09:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:02,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 17:09:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:02,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:02,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {1756#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1756#true} is VALID [2022-02-20 17:09:02,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {1756#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {1756#true} is VALID [2022-02-20 17:09:02,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {1756#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {1756#true} is VALID [2022-02-20 17:09:02,770 INFO L290 TraceCheckUtils]: 3: Hoare triple {1756#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {1756#true} is VALID [2022-02-20 17:09:02,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {1756#true} assume !(correct_version_~b~0#1 < correct_version_~n#1); {1756#true} is VALID [2022-02-20 17:09:02,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {1756#true} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {1756#true} is VALID [2022-02-20 17:09:02,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {1756#true} assume !(correct_version_~l~0#1 < correct_version_~m#1); {1756#true} is VALID [2022-02-20 17:09:02,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {1756#true} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {1756#true} is VALID [2022-02-20 17:09:02,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {1756#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {1756#true} is VALID [2022-02-20 17:09:02,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {1756#true} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {1756#true} is VALID [2022-02-20 17:09:02,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {1756#true} correct_version_#res#1 := correct_version_~y~0#1; {1756#true} is VALID [2022-02-20 17:09:02,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {1756#true} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {1797#(<= 0 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:02,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {1797#(<= 0 |ULTIMATE.start_student_version_~i~1#1|)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {1759#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:02,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {1759#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} assume !(student_version_~b~1#1 < student_version_~n#1); {1759#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:02,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {1759#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {1759#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:02,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {1759#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} assume !(student_version_~l~1#1 < student_version_~m#1); {1759#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:02,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {1759#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {1813#(and (<= 1 |ULTIMATE.start_student_version_~i~1#1|) (<= |ULTIMATE.start_student_version_~x~1#1| 0))} is VALID [2022-02-20 17:09:02,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {1813#(and (<= 1 |ULTIMATE.start_student_version_~i~1#1|) (<= |ULTIMATE.start_student_version_~x~1#1| 0))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {1757#false} is VALID [2022-02-20 17:09:02,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {1757#false} student_version_#res#1 := student_version_~y~1#1; {1757#false} is VALID [2022-02-20 17:09:02,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {1757#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {1757#false} is VALID [2022-02-20 17:09:02,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {1757#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1757#false} is VALID [2022-02-20 17:09:02,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {1757#false} assume 0 == __VERIFIER_assert_~cond#1; {1757#false} is VALID [2022-02-20 17:09:02,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {1757#false} assume !false; {1757#false} is VALID [2022-02-20 17:09:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:02,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:09:02,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723086037] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:09:02,776 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:09:02,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-02-20 17:09:02,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436255649] [2022-02-20 17:09:02,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:09:02,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-20 17:09:02,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:02,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-20 17:09:02,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:02,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:09:02,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:02,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:09:02,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:09:02,791 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-20 17:09:02,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:02,844 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-20 17:09:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:09:02,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-20 17:09:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-20 17:09:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-02-20 17:09:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-20 17:09:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-02-20 17:09:02,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-02-20 17:09:02,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:02,863 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:09:02,863 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 17:09:02,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:09:02,863 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 51 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-20 17:09:02,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 51 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 17:09:02,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 17:09:02,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:02,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 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-20 17:09:02,897 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 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-20 17:09:02,897 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 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-20 17:09:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:02,898 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-20 17:09:02,898 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-02-20 17:09:02,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:02,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:02,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 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 25 states. [2022-02-20 17:09:02,899 INFO L87 Difference]: Start difference. First operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 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 25 states. [2022-02-20 17:09:02,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:02,899 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-20 17:09:02,899 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-02-20 17:09:02,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:02,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:02,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:02,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:02,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 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-20 17:09:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-02-20 17:09:02,901 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 23 [2022-02-20 17:09:02,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:02,901 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-02-20 17:09:02,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-20 17:09:02,901 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-02-20 17:09:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:09:02,902 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:02,902 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:02,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 17:09:03,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:03,118 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:03,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:03,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1804048560, now seen corresponding path program 1 times [2022-02-20 17:09:03,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:03,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906954471] [2022-02-20 17:09:03,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:03,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:03,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {1958#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1958#true} is VALID [2022-02-20 17:09:03,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {1958#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {1958#true} is VALID [2022-02-20 17:09:03,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {1958#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:03,328 INFO L290 TraceCheckUtils]: 3: Hoare triple {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:03,329 INFO L290 TraceCheckUtils]: 4: Hoare triple {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:03,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {1961#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:03,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {1961#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {1961#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:03,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {1961#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {1962#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1) (= |ULTIMATE.start_correct_version_~y~0#1| 0))} is VALID [2022-02-20 17:09:03,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {1962#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1) (= |ULTIMATE.start_correct_version_~y~0#1| 0))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {1963#(and (<= 1 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 1))} is VALID [2022-02-20 17:09:03,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {1963#(and (<= 1 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 1))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {1963#(and (<= 1 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 1))} is VALID [2022-02-20 17:09:03,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {1963#(and (<= 1 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 1))} correct_version_#res#1 := correct_version_~y~0#1; {1964#(and (<= |ULTIMATE.start_correct_version_#res#1| 1) (<= 1 |ULTIMATE.start_correct_version_#res#1|))} is VALID [2022-02-20 17:09:03,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {1964#(and (<= |ULTIMATE.start_correct_version_#res#1| 1) (<= 1 |ULTIMATE.start_correct_version_#res#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {1965#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:03,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {1965#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {1965#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:03,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {1965#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {1965#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:03,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {1965#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {1966#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:03,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {1966#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} assume !(student_version_~l~1#1 < student_version_~m#1); {1966#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:03,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {1966#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {1967#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~y~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:03,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~y~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {1968#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:03,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {1968#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {1968#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:03,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {1968#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_#res#1 := student_version_~y~1#1; {1969#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} is VALID [2022-02-20 17:09:03,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {1969#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {1970#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} is VALID [2022-02-20 17:09:03,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {1970#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1971#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:09:03,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {1971#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {1959#false} is VALID [2022-02-20 17:09:03,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {1959#false} assume !false; {1959#false} is VALID [2022-02-20 17:09:03,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:09:03,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:03,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906954471] [2022-02-20 17:09:03,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906954471] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:03,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834208314] [2022-02-20 17:09:03,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:03,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:03,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:03,342 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-20 17:09:03,343 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-20 17:09:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:03,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 17:09:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:03,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:03,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {1958#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1958#true} is VALID [2022-02-20 17:09:03,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {1958#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {1958#true} is VALID [2022-02-20 17:09:03,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {1958#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:03,813 INFO L290 TraceCheckUtils]: 3: Hoare triple {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:03,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:03,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {1961#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:03,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {1961#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {1961#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:03,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {1961#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {1962#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1) (= |ULTIMATE.start_correct_version_~y~0#1| 0))} is VALID [2022-02-20 17:09:03,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {1962#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1) (= |ULTIMATE.start_correct_version_~y~0#1| 0))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {1963#(and (<= 1 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 1))} is VALID [2022-02-20 17:09:03,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {1963#(and (<= 1 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 1))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {1963#(and (<= 1 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 1))} is VALID [2022-02-20 17:09:03,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {1963#(and (<= 1 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 1))} correct_version_#res#1 := correct_version_~y~0#1; {1964#(and (<= |ULTIMATE.start_correct_version_#res#1| 1) (<= 1 |ULTIMATE.start_correct_version_#res#1|))} is VALID [2022-02-20 17:09:03,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {1964#(and (<= |ULTIMATE.start_correct_version_#res#1| 1) (<= 1 |ULTIMATE.start_correct_version_#res#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {1965#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:03,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {1965#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {1965#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:03,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {1965#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {1965#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:03,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {1965#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {2017#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:03,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {2017#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~l~1#1 < student_version_~m#1); {2017#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:03,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {2017#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {2024#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (= |ULTIMATE.start_student_version_~y~1#1| 0) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:03,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {2024#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (= |ULTIMATE.start_student_version_~y~1#1| 0) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {2028#(and (= (+ (- 1) |ULTIMATE.start_student_version_~y~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:03,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {2028#(and (= (+ (- 1) |ULTIMATE.start_student_version_~y~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {2028#(and (= (+ (- 1) |ULTIMATE.start_student_version_~y~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:03,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {2028#(and (= (+ (- 1) |ULTIMATE.start_student_version_~y~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_#res#1 := student_version_~y~1#1; {2035#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (= (+ (- 1) |ULTIMATE.start_student_version_#res#1|) 0) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:03,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {2035#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (= (+ (- 1) |ULTIMATE.start_student_version_#res#1|) 0) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {2039#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (= |ULTIMATE.start_main_~n_stones2~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:03,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {2039#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 1) (= |ULTIMATE.start_main_~n_stones2~0#1| 1) (<= 1 |ULTIMATE.start_main_~n_stones1~0#1|))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2043#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:09:03,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {2043#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1959#false} is VALID [2022-02-20 17:09:03,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {1959#false} assume !false; {1959#false} is VALID [2022-02-20 17:09:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:09:03,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:04,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {1959#false} assume !false; {1959#false} is VALID [2022-02-20 17:09:04,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {2043#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1959#false} is VALID [2022-02-20 17:09:04,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {1970#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2043#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:09:04,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {1969#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {1970#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} is VALID [2022-02-20 17:09:04,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {1968#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_#res#1 := student_version_~y~1#1; {1969#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} is VALID [2022-02-20 17:09:04,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {1968#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {1968#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:04,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {2068#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|)))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {1968#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:04,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {1966#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {2068#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|)))} is VALID [2022-02-20 17:09:04,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {1966#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} assume !(student_version_~l~1#1 < student_version_~m#1); {1966#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:04,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {2078#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {1966#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:04,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {2078#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} assume !(student_version_~b~1#1 < student_version_~n#1); {2078#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} is VALID [2022-02-20 17:09:04,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {2078#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {2078#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} is VALID [2022-02-20 17:09:04,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {1964#(and (<= |ULTIMATE.start_correct_version_#res#1| 1) (<= 1 |ULTIMATE.start_correct_version_#res#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {2078#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} is VALID [2022-02-20 17:09:04,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {1963#(and (<= 1 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 1))} correct_version_#res#1 := correct_version_~y~0#1; {1964#(and (<= |ULTIMATE.start_correct_version_#res#1| 1) (<= 1 |ULTIMATE.start_correct_version_#res#1|))} is VALID [2022-02-20 17:09:04,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {1963#(and (<= 1 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 1))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {1963#(and (<= 1 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 1))} is VALID [2022-02-20 17:09:04,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {2097#(and (<= (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) 1) (<= 1 (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|)))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {1963#(and (<= 1 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 1))} is VALID [2022-02-20 17:09:04,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {1961#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {2097#(and (<= (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) 1) (<= 1 (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|)))} is VALID [2022-02-20 17:09:04,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {1961#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {1961#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:04,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {1961#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:04,108 INFO L290 TraceCheckUtils]: 4: Hoare triple {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:04,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:04,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {1958#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {1960#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:04,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {1958#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {1958#true} is VALID [2022-02-20 17:09:04,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {1958#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1958#true} is VALID [2022-02-20 17:09:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:09:04,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834208314] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:04,109 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:04,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 23 [2022-02-20 17:09:04,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296907948] [2022-02-20 17:09:04,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:04,110 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 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-20 17:09:04,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:04,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 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-20 17:09:04,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:04,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-20 17:09:04,138 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:04,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-20 17:09:04,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2022-02-20 17:09:04,139 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 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-20 17:09:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:04,979 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-02-20 17:09:04,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 17:09:04,979 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 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-20 17:09:04,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:04,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 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-20 17:09:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 80 transitions. [2022-02-20 17:09:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 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-20 17:09:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 80 transitions. [2022-02-20 17:09:04,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 80 transitions. [2022-02-20 17:09:05,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:05,040 INFO L225 Difference]: With dead ends: 77 [2022-02-20 17:09:05,040 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 17:09:05,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=1072, Unknown=0, NotChecked=0, Total=1260 [2022-02-20 17:09:05,041 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 124 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:05,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 236 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:09:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 17:09:05,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 37. [2022-02-20 17:09:05,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:05,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 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-20 17:09:05,111 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 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-20 17:09:05,111 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 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-20 17:09:05,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:05,112 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-02-20 17:09:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-02-20 17:09:05,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:05,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:05,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 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 71 states. [2022-02-20 17:09:05,113 INFO L87 Difference]: Start difference. First operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 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 71 states. [2022-02-20 17:09:05,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:05,114 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-02-20 17:09:05,114 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-02-20 17:09:05,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:05,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:05,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:05,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 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-20 17:09:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-02-20 17:09:05,115 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 24 [2022-02-20 17:09:05,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:05,115 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-02-20 17:09:05,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 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-20 17:09:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-02-20 17:09:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:09:05,116 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:05,116 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:05,136 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-20 17:09:05,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:05,326 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:05,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:05,326 INFO L85 PathProgramCache]: Analyzing trace with hash 571706934, now seen corresponding path program 2 times [2022-02-20 17:09:05,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:05,326 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200980133] [2022-02-20 17:09:05,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:05,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:05,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {2449#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2449#true} is VALID [2022-02-20 17:09:05,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {2449#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {2449#true} is VALID [2022-02-20 17:09:05,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {2449#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {2451#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:05,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {2451#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {2451#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:05,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {2451#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {2451#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:05,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {2451#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {2452#(<= (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|) (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:05,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {2452#(<= (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|) (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~m#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:05,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:05,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:05,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:05,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:05,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {2454#(and (<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~a#1|) (= |ULTIMATE.start_student_version_~l~1#1| 0))} is VALID [2022-02-20 17:09:05,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {2454#(and (<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~a#1|) (= |ULTIMATE.start_student_version_~l~1#1| 0))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {2454#(and (<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~a#1|) (= |ULTIMATE.start_student_version_~l~1#1| 0))} is VALID [2022-02-20 17:09:05,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {2454#(and (<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~a#1|) (= |ULTIMATE.start_student_version_~l~1#1| 0))} assume !(student_version_~b~1#1 < student_version_~n#1); {2454#(and (<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~a#1|) (= |ULTIMATE.start_student_version_~l~1#1| 0))} is VALID [2022-02-20 17:09:05,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {2454#(and (<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~a#1|) (= |ULTIMATE.start_student_version_~l~1#1| 0))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {2455#(<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~l~1#1|)} is VALID [2022-02-20 17:09:05,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {2455#(<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~l~1#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {2450#false} is VALID [2022-02-20 17:09:05,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {2450#false} assume !(student_version_~l~1#1 < student_version_~m#1); {2450#false} is VALID [2022-02-20 17:09:05,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {2450#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {2450#false} is VALID [2022-02-20 17:09:05,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {2450#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {2450#false} is VALID [2022-02-20 17:09:05,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {2450#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {2450#false} is VALID [2022-02-20 17:09:05,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {2450#false} student_version_#res#1 := student_version_~y~1#1; {2450#false} is VALID [2022-02-20 17:09:05,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {2450#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {2450#false} is VALID [2022-02-20 17:09:05,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {2450#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2450#false} is VALID [2022-02-20 17:09:05,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {2450#false} assume 0 == __VERIFIER_assert_~cond#1; {2450#false} is VALID [2022-02-20 17:09:05,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {2450#false} assume !false; {2450#false} is VALID [2022-02-20 17:09:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:05,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:05,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200980133] [2022-02-20 17:09:05,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200980133] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:05,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385379075] [2022-02-20 17:09:05,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:09:05,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:05,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:05,416 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-20 17:09:05,417 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-20 17:09:05,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:09:05,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:05,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 17:09:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:05,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:05,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {2449#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2449#true} is VALID [2022-02-20 17:09:05,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {2449#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {2449#true} is VALID [2022-02-20 17:09:05,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {2449#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {2465#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:05,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {2465#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {2465#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:05,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {2465#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {2465#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:05,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {2465#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {2475#(and (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:05,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {2475#(and (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:05,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:05,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:05,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:05,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:05,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {2494#(and (<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~a#1|) (<= 0 |ULTIMATE.start_student_version_~l~1#1|))} is VALID [2022-02-20 17:09:05,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {2494#(and (<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~a#1|) (<= 0 |ULTIMATE.start_student_version_~l~1#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {2494#(and (<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~a#1|) (<= 0 |ULTIMATE.start_student_version_~l~1#1|))} is VALID [2022-02-20 17:09:05,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~a#1|) (<= 0 |ULTIMATE.start_student_version_~l~1#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {2494#(and (<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~a#1|) (<= 0 |ULTIMATE.start_student_version_~l~1#1|))} is VALID [2022-02-20 17:09:05,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {2494#(and (<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~a#1|) (<= 0 |ULTIMATE.start_student_version_~l~1#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {2455#(<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~l~1#1|)} is VALID [2022-02-20 17:09:05,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {2455#(<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~l~1#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {2450#false} is VALID [2022-02-20 17:09:05,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {2450#false} assume !(student_version_~l~1#1 < student_version_~m#1); {2450#false} is VALID [2022-02-20 17:09:05,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {2450#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {2450#false} is VALID [2022-02-20 17:09:05,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {2450#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {2450#false} is VALID [2022-02-20 17:09:05,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {2450#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {2450#false} is VALID [2022-02-20 17:09:05,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {2450#false} student_version_#res#1 := student_version_~y~1#1; {2450#false} is VALID [2022-02-20 17:09:05,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {2450#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {2450#false} is VALID [2022-02-20 17:09:05,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {2450#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2450#false} is VALID [2022-02-20 17:09:05,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {2450#false} assume 0 == __VERIFIER_assert_~cond#1; {2450#false} is VALID [2022-02-20 17:09:05,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {2450#false} assume !false; {2450#false} is VALID [2022-02-20 17:09:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:05,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:05,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {2450#false} assume !false; {2450#false} is VALID [2022-02-20 17:09:05,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {2450#false} assume 0 == __VERIFIER_assert_~cond#1; {2450#false} is VALID [2022-02-20 17:09:05,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {2450#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2450#false} is VALID [2022-02-20 17:09:05,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {2450#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {2450#false} is VALID [2022-02-20 17:09:05,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {2450#false} student_version_#res#1 := student_version_~y~1#1; {2450#false} is VALID [2022-02-20 17:09:05,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {2450#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {2450#false} is VALID [2022-02-20 17:09:05,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {2450#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {2450#false} is VALID [2022-02-20 17:09:05,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {2450#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {2450#false} is VALID [2022-02-20 17:09:05,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {2450#false} assume !(student_version_~l~1#1 < student_version_~m#1); {2450#false} is VALID [2022-02-20 17:09:05,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {2455#(<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~l~1#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {2450#false} is VALID [2022-02-20 17:09:05,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {2564#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {2455#(<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~l~1#1|)} is VALID [2022-02-20 17:09:05,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {2564#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {2564#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|))} is VALID [2022-02-20 17:09:05,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {2564#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {2564#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|))} is VALID [2022-02-20 17:09:05,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {2564#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|))} is VALID [2022-02-20 17:09:05,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:05,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:05,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:05,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:05,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {2589#(or (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|) (< |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~m#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {2453#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:05,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {2593#(or (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|) (< (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {2589#(or (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|) (< |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:05,953 INFO L290 TraceCheckUtils]: 4: Hoare triple {2593#(or (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|) (< (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {2593#(or (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|) (< (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:05,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {2593#(or (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|) (< (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {2593#(or (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|) (< (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:05,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {2449#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {2593#(or (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~a~0#1|) (< (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:05,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {2449#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {2449#true} is VALID [2022-02-20 17:09:05,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {2449#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2449#true} is VALID [2022-02-20 17:09:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:05,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385379075] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:05,955 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:05,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 17:09:05,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255488107] [2022-02-20 17:09:05,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:05,956 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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 25 [2022-02-20 17:09:05,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:05,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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-20 17:09:05,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:05,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:09:05,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:05,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:09:05,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:09:05,985 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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-20 17:09:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:06,292 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-02-20 17:09:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:09:06,293 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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 25 [2022-02-20 17:09:06,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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-20 17:09:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-02-20 17:09:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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-20 17:09:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-02-20 17:09:06,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-02-20 17:09:06,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:06,330 INFO L225 Difference]: With dead ends: 63 [2022-02-20 17:09:06,330 INFO L226 Difference]: Without dead ends: 53 [2022-02-20 17:09:06,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:09:06,331 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 82 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:06,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 129 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:06,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-20 17:09:06,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-02-20 17:09:06,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:06,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 44 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 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-20 17:09:06,435 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 44 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 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-20 17:09:06,435 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 44 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 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-20 17:09:06,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:06,436 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-02-20 17:09:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-02-20 17:09:06,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:06,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:06,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 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 53 states. [2022-02-20 17:09:06,437 INFO L87 Difference]: Start difference. First operand has 44 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 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 53 states. [2022-02-20 17:09:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:06,438 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-02-20 17:09:06,438 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-02-20 17:09:06,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:06,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:06,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:06,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:06,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 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-20 17:09:06,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2022-02-20 17:09:06,439 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 25 [2022-02-20 17:09:06,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:06,439 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2022-02-20 17:09:06,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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-20 17:09:06,440 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-02-20 17:09:06,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:09:06,440 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:06,440 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:06,456 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-20 17:09:06,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 17:09:06,655 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:06,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:06,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1510332885, now seen corresponding path program 3 times [2022-02-20 17:09:06,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:06,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905289177] [2022-02-20 17:09:06,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:06,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:06,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {2875#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2875#true} is VALID [2022-02-20 17:09:06,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {2875#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {2875#true} is VALID [2022-02-20 17:09:06,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {2875#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {2875#true} is VALID [2022-02-20 17:09:06,733 INFO L290 TraceCheckUtils]: 3: Hoare triple {2875#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {2875#true} is VALID [2022-02-20 17:09:06,733 INFO L290 TraceCheckUtils]: 4: Hoare triple {2875#true} assume !(correct_version_~b~0#1 < correct_version_~n#1); {2875#true} is VALID [2022-02-20 17:09:06,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {2875#true} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {2875#true} is VALID [2022-02-20 17:09:06,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {2875#true} assume !(correct_version_~l~0#1 < correct_version_~m#1); {2875#true} is VALID [2022-02-20 17:09:06,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {2875#true} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {2875#true} is VALID [2022-02-20 17:09:06,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {2875#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {2875#true} is VALID [2022-02-20 17:09:06,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {2875#true} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {2875#true} is VALID [2022-02-20 17:09:06,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {2875#true} correct_version_#res#1 := correct_version_~y~0#1; {2875#true} is VALID [2022-02-20 17:09:06,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {2875#true} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {2877#(= |ULTIMATE.start_student_version_~i~1#1| 0)} is VALID [2022-02-20 17:09:06,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {2877#(= |ULTIMATE.start_student_version_~i~1#1| 0)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} is VALID [2022-02-20 17:09:06,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} assume !(student_version_~b~1#1 < student_version_~n#1); {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} is VALID [2022-02-20 17:09:06,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} is VALID [2022-02-20 17:09:06,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} assume !(student_version_~l~1#1 < student_version_~m#1); {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} is VALID [2022-02-20 17:09:06,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {2879#(and (<= |ULTIMATE.start_student_version_~i~1#1| 1) (= |ULTIMATE.start_student_version_~x~1#1| 0))} is VALID [2022-02-20 17:09:06,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {2879#(and (<= |ULTIMATE.start_student_version_~i~1#1| 1) (= |ULTIMATE.start_student_version_~x~1#1| 0))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {2880#(<= |ULTIMATE.start_student_version_~i~1#1| |ULTIMATE.start_student_version_~x~1#1|)} is VALID [2022-02-20 17:09:06,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {2880#(<= |ULTIMATE.start_student_version_~i~1#1| |ULTIMATE.start_student_version_~x~1#1|)} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {2876#false} is VALID [2022-02-20 17:09:06,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {2876#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {2876#false} is VALID [2022-02-20 17:09:06,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {2876#false} student_version_#res#1 := student_version_~y~1#1; {2876#false} is VALID [2022-02-20 17:09:06,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {2876#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {2876#false} is VALID [2022-02-20 17:09:06,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {2876#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2876#false} is VALID [2022-02-20 17:09:06,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {2876#false} assume 0 == __VERIFIER_assert_~cond#1; {2876#false} is VALID [2022-02-20 17:09:06,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {2876#false} assume !false; {2876#false} is VALID [2022-02-20 17:09:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:06,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:06,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905289177] [2022-02-20 17:09:06,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905289177] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:06,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067473276] [2022-02-20 17:09:06,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:09:06,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:06,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:06,739 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-20 17:09:06,740 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-20 17:09:06,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 17:09:06,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:06,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:09:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:06,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:06,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {2875#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2875#true} is VALID [2022-02-20 17:09:06,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {2875#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {2875#true} is VALID [2022-02-20 17:09:06,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {2875#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {2875#true} is VALID [2022-02-20 17:09:06,897 INFO L290 TraceCheckUtils]: 3: Hoare triple {2875#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {2875#true} is VALID [2022-02-20 17:09:06,897 INFO L290 TraceCheckUtils]: 4: Hoare triple {2875#true} assume !(correct_version_~b~0#1 < correct_version_~n#1); {2875#true} is VALID [2022-02-20 17:09:06,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {2875#true} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {2875#true} is VALID [2022-02-20 17:09:06,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {2875#true} assume !(correct_version_~l~0#1 < correct_version_~m#1); {2875#true} is VALID [2022-02-20 17:09:06,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {2875#true} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {2875#true} is VALID [2022-02-20 17:09:06,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {2875#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {2875#true} is VALID [2022-02-20 17:09:06,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {2875#true} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {2875#true} is VALID [2022-02-20 17:09:06,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {2875#true} correct_version_#res#1 := correct_version_~y~0#1; {2875#true} is VALID [2022-02-20 17:09:06,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {2875#true} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {2917#(<= |ULTIMATE.start_student_version_~i~1#1| 0)} is VALID [2022-02-20 17:09:06,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {2917#(<= |ULTIMATE.start_student_version_~i~1#1| 0)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} is VALID [2022-02-20 17:09:06,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} assume !(student_version_~b~1#1 < student_version_~n#1); {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} is VALID [2022-02-20 17:09:06,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} is VALID [2022-02-20 17:09:06,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} assume !(student_version_~l~1#1 < student_version_~m#1); {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} is VALID [2022-02-20 17:09:06,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {2933#(and (<= 0 |ULTIMATE.start_student_version_~x~1#1|) (<= |ULTIMATE.start_student_version_~i~1#1| 1))} is VALID [2022-02-20 17:09:06,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {2933#(and (<= 0 |ULTIMATE.start_student_version_~x~1#1|) (<= |ULTIMATE.start_student_version_~i~1#1| 1))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {2937#(and (<= 1 |ULTIMATE.start_student_version_~x~1#1|) (<= |ULTIMATE.start_student_version_~i~1#1| 1))} is VALID [2022-02-20 17:09:06,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {2937#(and (<= 1 |ULTIMATE.start_student_version_~x~1#1|) (<= |ULTIMATE.start_student_version_~i~1#1| 1))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {2876#false} is VALID [2022-02-20 17:09:06,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {2876#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {2876#false} is VALID [2022-02-20 17:09:06,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {2876#false} student_version_#res#1 := student_version_~y~1#1; {2876#false} is VALID [2022-02-20 17:09:06,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {2876#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {2876#false} is VALID [2022-02-20 17:09:06,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {2876#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2876#false} is VALID [2022-02-20 17:09:06,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {2876#false} assume 0 == __VERIFIER_assert_~cond#1; {2876#false} is VALID [2022-02-20 17:09:06,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {2876#false} assume !false; {2876#false} is VALID [2022-02-20 17:09:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:06,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:06,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {2876#false} assume !false; {2876#false} is VALID [2022-02-20 17:09:06,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {2876#false} assume 0 == __VERIFIER_assert_~cond#1; {2876#false} is VALID [2022-02-20 17:09:06,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {2876#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2876#false} is VALID [2022-02-20 17:09:06,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {2876#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {2876#false} is VALID [2022-02-20 17:09:06,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {2876#false} student_version_#res#1 := student_version_~y~1#1; {2876#false} is VALID [2022-02-20 17:09:06,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {2876#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {2876#false} is VALID [2022-02-20 17:09:06,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {2880#(<= |ULTIMATE.start_student_version_~i~1#1| |ULTIMATE.start_student_version_~x~1#1|)} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {2876#false} is VALID [2022-02-20 17:09:06,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {2980#(<= |ULTIMATE.start_student_version_~i~1#1| (+ |ULTIMATE.start_student_version_~x~1#1| 1))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {2880#(<= |ULTIMATE.start_student_version_~i~1#1| |ULTIMATE.start_student_version_~x~1#1|)} is VALID [2022-02-20 17:09:06,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {2980#(<= |ULTIMATE.start_student_version_~i~1#1| (+ |ULTIMATE.start_student_version_~x~1#1| 1))} is VALID [2022-02-20 17:09:06,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} assume !(student_version_~l~1#1 < student_version_~m#1); {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} is VALID [2022-02-20 17:09:06,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} is VALID [2022-02-20 17:09:06,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} assume !(student_version_~b~1#1 < student_version_~n#1); {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} is VALID [2022-02-20 17:09:06,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {2917#(<= |ULTIMATE.start_student_version_~i~1#1| 0)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {2878#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} is VALID [2022-02-20 17:09:06,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {2875#true} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {2917#(<= |ULTIMATE.start_student_version_~i~1#1| 0)} is VALID [2022-02-20 17:09:06,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {2875#true} correct_version_#res#1 := correct_version_~y~0#1; {2875#true} is VALID [2022-02-20 17:09:06,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {2875#true} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {2875#true} is VALID [2022-02-20 17:09:06,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {2875#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {2875#true} is VALID [2022-02-20 17:09:06,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {2875#true} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {2875#true} is VALID [2022-02-20 17:09:06,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {2875#true} assume !(correct_version_~l~0#1 < correct_version_~m#1); {2875#true} is VALID [2022-02-20 17:09:06,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {2875#true} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {2875#true} is VALID [2022-02-20 17:09:06,985 INFO L290 TraceCheckUtils]: 4: Hoare triple {2875#true} assume !(correct_version_~b~0#1 < correct_version_~n#1); {2875#true} is VALID [2022-02-20 17:09:06,985 INFO L290 TraceCheckUtils]: 3: Hoare triple {2875#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {2875#true} is VALID [2022-02-20 17:09:06,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {2875#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {2875#true} is VALID [2022-02-20 17:09:06,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {2875#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {2875#true} is VALID [2022-02-20 17:09:06,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {2875#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2875#true} is VALID [2022-02-20 17:09:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:06,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067473276] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:06,986 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:06,986 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-02-20 17:09:06,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411605114] [2022-02-20 17:09:06,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:06,987 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 17:09:06,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:06,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:07,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:07,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:09:07,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:07,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:09:07,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:09:07,004 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:07,278 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-02-20 17:09:07,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:09:07,278 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 17:09:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-02-20 17:09:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-02-20 17:09:07,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-02-20 17:09:07,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:07,315 INFO L225 Difference]: With dead ends: 72 [2022-02-20 17:09:07,315 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 17:09:07,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:09:07,316 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:07,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 155 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 17:09:07,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-02-20 17:09:07,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:07,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 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-20 17:09:07,456 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 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-20 17:09:07,456 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 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-20 17:09:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:07,457 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-02-20 17:09:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2022-02-20 17:09:07,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:07,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:07,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 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 60 states. [2022-02-20 17:09:07,457 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 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 60 states. [2022-02-20 17:09:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:07,458 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-02-20 17:09:07,458 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2022-02-20 17:09:07,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:07,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:07,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:07,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 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-20 17:09:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2022-02-20 17:09:07,459 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 25 [2022-02-20 17:09:07,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:07,459 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2022-02-20 17:09:07,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:07,459 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2022-02-20 17:09:07,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:09:07,459 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:07,459 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:07,478 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-20 17:09:07,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:07,678 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:07,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:07,678 INFO L85 PathProgramCache]: Analyzing trace with hash 595735960, now seen corresponding path program 4 times [2022-02-20 17:09:07,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:07,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286255806] [2022-02-20 17:09:07,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:07,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:07,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {3332#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3332#true} is VALID [2022-02-20 17:09:07,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {3332#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {3332#true} is VALID [2022-02-20 17:09:07,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {3332#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {3334#(= |ULTIMATE.start_correct_version_~i~0#1| 0)} is VALID [2022-02-20 17:09:07,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {3334#(= |ULTIMATE.start_correct_version_~i~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} is VALID [2022-02-20 17:09:07,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} is VALID [2022-02-20 17:09:07,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} is VALID [2022-02-20 17:09:07,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} is VALID [2022-02-20 17:09:07,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {3336#(and (<= |ULTIMATE.start_correct_version_~i~0#1| 1) (= |ULTIMATE.start_correct_version_~x~0#1| 0))} is VALID [2022-02-20 17:09:07,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {3336#(and (<= |ULTIMATE.start_correct_version_~i~0#1| 1) (= |ULTIMATE.start_correct_version_~x~0#1| 0))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {3337#(<= |ULTIMATE.start_correct_version_~i~0#1| |ULTIMATE.start_correct_version_~x~0#1|)} is VALID [2022-02-20 17:09:07,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {3337#(<= |ULTIMATE.start_correct_version_~i~0#1| |ULTIMATE.start_correct_version_~x~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {3333#false} is VALID [2022-02-20 17:09:07,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {3333#false} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {3333#false} is VALID [2022-02-20 17:09:07,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {3333#false} correct_version_#res#1 := correct_version_~y~0#1; {3333#false} is VALID [2022-02-20 17:09:07,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {3333#false} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {3333#false} is VALID [2022-02-20 17:09:07,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {3333#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {3333#false} is VALID [2022-02-20 17:09:07,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {3333#false} assume !(student_version_~b~1#1 < student_version_~n#1); {3333#false} is VALID [2022-02-20 17:09:07,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {3333#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {3333#false} is VALID [2022-02-20 17:09:07,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {3333#false} assume !(student_version_~l~1#1 < student_version_~m#1); {3333#false} is VALID [2022-02-20 17:09:07,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {3333#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {3333#false} is VALID [2022-02-20 17:09:07,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {3333#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {3333#false} is VALID [2022-02-20 17:09:07,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {3333#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {3333#false} is VALID [2022-02-20 17:09:07,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {3333#false} student_version_#res#1 := student_version_~y~1#1; {3333#false} is VALID [2022-02-20 17:09:07,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {3333#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {3333#false} is VALID [2022-02-20 17:09:07,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {3333#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3333#false} is VALID [2022-02-20 17:09:07,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {3333#false} assume 0 == __VERIFIER_assert_~cond#1; {3333#false} is VALID [2022-02-20 17:09:07,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {3333#false} assume !false; {3333#false} is VALID [2022-02-20 17:09:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:07,729 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:07,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286255806] [2022-02-20 17:09:07,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286255806] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:07,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413803017] [2022-02-20 17:09:07,729 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:09:07,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:07,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:07,730 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:07,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 17:09:07,775 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:09:07,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:07,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:09:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:07,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:07,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {3332#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3332#true} is VALID [2022-02-20 17:09:07,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {3332#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {3332#true} is VALID [2022-02-20 17:09:07,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {3332#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {3347#(<= |ULTIMATE.start_correct_version_~i~0#1| 0)} is VALID [2022-02-20 17:09:07,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {3347#(<= |ULTIMATE.start_correct_version_~i~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} is VALID [2022-02-20 17:09:07,856 INFO L290 TraceCheckUtils]: 4: Hoare triple {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} is VALID [2022-02-20 17:09:07,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} is VALID [2022-02-20 17:09:07,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} is VALID [2022-02-20 17:09:07,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {3363#(and (<= |ULTIMATE.start_correct_version_~i~0#1| 1) (<= 0 |ULTIMATE.start_correct_version_~x~0#1|))} is VALID [2022-02-20 17:09:07,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {3363#(and (<= |ULTIMATE.start_correct_version_~i~0#1| 1) (<= 0 |ULTIMATE.start_correct_version_~x~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {3367#(and (<= |ULTIMATE.start_correct_version_~i~0#1| 1) (<= 1 |ULTIMATE.start_correct_version_~x~0#1|))} is VALID [2022-02-20 17:09:07,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {3367#(and (<= |ULTIMATE.start_correct_version_~i~0#1| 1) (<= 1 |ULTIMATE.start_correct_version_~x~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {3333#false} is VALID [2022-02-20 17:09:07,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {3333#false} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {3333#false} is VALID [2022-02-20 17:09:07,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {3333#false} correct_version_#res#1 := correct_version_~y~0#1; {3333#false} is VALID [2022-02-20 17:09:07,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {3333#false} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {3333#false} is VALID [2022-02-20 17:09:07,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {3333#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {3333#false} is VALID [2022-02-20 17:09:07,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {3333#false} assume !(student_version_~b~1#1 < student_version_~n#1); {3333#false} is VALID [2022-02-20 17:09:07,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {3333#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {3333#false} is VALID [2022-02-20 17:09:07,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {3333#false} assume !(student_version_~l~1#1 < student_version_~m#1); {3333#false} is VALID [2022-02-20 17:09:07,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {3333#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {3333#false} is VALID [2022-02-20 17:09:07,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {3333#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {3333#false} is VALID [2022-02-20 17:09:07,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {3333#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {3333#false} is VALID [2022-02-20 17:09:07,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {3333#false} student_version_#res#1 := student_version_~y~1#1; {3333#false} is VALID [2022-02-20 17:09:07,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {3333#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {3333#false} is VALID [2022-02-20 17:09:07,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {3333#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3333#false} is VALID [2022-02-20 17:09:07,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {3333#false} assume 0 == __VERIFIER_assert_~cond#1; {3333#false} is VALID [2022-02-20 17:09:07,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {3333#false} assume !false; {3333#false} is VALID [2022-02-20 17:09:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:07,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:07,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {3333#false} assume !false; {3333#false} is VALID [2022-02-20 17:09:07,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {3333#false} assume 0 == __VERIFIER_assert_~cond#1; {3333#false} is VALID [2022-02-20 17:09:07,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {3333#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3333#false} is VALID [2022-02-20 17:09:07,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {3333#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {3333#false} is VALID [2022-02-20 17:09:07,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {3333#false} student_version_#res#1 := student_version_~y~1#1; {3333#false} is VALID [2022-02-20 17:09:07,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {3333#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {3333#false} is VALID [2022-02-20 17:09:07,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {3333#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {3333#false} is VALID [2022-02-20 17:09:07,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {3333#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {3333#false} is VALID [2022-02-20 17:09:07,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {3333#false} assume !(student_version_~l~1#1 < student_version_~m#1); {3333#false} is VALID [2022-02-20 17:09:07,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {3333#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {3333#false} is VALID [2022-02-20 17:09:07,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {3333#false} assume !(student_version_~b~1#1 < student_version_~n#1); {3333#false} is VALID [2022-02-20 17:09:07,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {3333#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {3333#false} is VALID [2022-02-20 17:09:07,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {3333#false} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {3333#false} is VALID [2022-02-20 17:09:07,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {3333#false} correct_version_#res#1 := correct_version_~y~0#1; {3333#false} is VALID [2022-02-20 17:09:07,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {3333#false} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {3333#false} is VALID [2022-02-20 17:09:07,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {3337#(<= |ULTIMATE.start_correct_version_~i~0#1| |ULTIMATE.start_correct_version_~x~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {3333#false} is VALID [2022-02-20 17:09:07,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {3464#(<= |ULTIMATE.start_correct_version_~i~0#1| (+ |ULTIMATE.start_correct_version_~x~0#1| 1))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {3337#(<= |ULTIMATE.start_correct_version_~i~0#1| |ULTIMATE.start_correct_version_~x~0#1|)} is VALID [2022-02-20 17:09:07,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {3464#(<= |ULTIMATE.start_correct_version_~i~0#1| (+ |ULTIMATE.start_correct_version_~x~0#1| 1))} is VALID [2022-02-20 17:09:07,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} is VALID [2022-02-20 17:09:07,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} is VALID [2022-02-20 17:09:07,965 INFO L290 TraceCheckUtils]: 4: Hoare triple {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} is VALID [2022-02-20 17:09:07,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {3347#(<= |ULTIMATE.start_correct_version_~i~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {3335#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} is VALID [2022-02-20 17:09:07,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {3332#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {3347#(<= |ULTIMATE.start_correct_version_~i~0#1| 0)} is VALID [2022-02-20 17:09:07,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {3332#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {3332#true} is VALID [2022-02-20 17:09:07,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {3332#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3332#true} is VALID [2022-02-20 17:09:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:07,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413803017] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:07,966 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:07,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-02-20 17:09:07,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542979320] [2022-02-20 17:09:07,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:07,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 17:09:07,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:07,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:07,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:07,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:09:07,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:07,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:09:07,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:09:07,990 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:08,345 INFO L93 Difference]: Finished difference Result 126 states and 157 transitions. [2022-02-20 17:09:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:09:08,345 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 17:09:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-02-20 17:09:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-02-20 17:09:08,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-02-20 17:09:08,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:08,384 INFO L225 Difference]: With dead ends: 126 [2022-02-20 17:09:08,384 INFO L226 Difference]: Without dead ends: 94 [2022-02-20 17:09:08,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:09:08,385 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:08,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 121 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:08,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-20 17:09:08,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 64. [2022-02-20 17:09:08,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:08,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 64 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 0 states have call successors, (0), 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-20 17:09:08,564 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 64 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 0 states have call successors, (0), 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-20 17:09:08,564 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 64 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 0 states have call successors, (0), 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-20 17:09:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:08,565 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-02-20 17:09:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-02-20 17:09:08,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:08,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:08,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 0 states have call successors, (0), 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 94 states. [2022-02-20 17:09:08,566 INFO L87 Difference]: Start difference. First operand has 64 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 0 states have call successors, (0), 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 94 states. [2022-02-20 17:09:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:08,567 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-02-20 17:09:08,567 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-02-20 17:09:08,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:08,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:08,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:08,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 0 states have call successors, (0), 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-20 17:09:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2022-02-20 17:09:08,569 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 25 [2022-02-20 17:09:08,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:08,569 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2022-02-20 17:09:08,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:08,569 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2022-02-20 17:09:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:09:08,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:08,570 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:08,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:08,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:08,786 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:08,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:08,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1299373655, now seen corresponding path program 5 times [2022-02-20 17:09:08,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:08,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824070469] [2022-02-20 17:09:08,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:08,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:08,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {3955#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3955#true} is VALID [2022-02-20 17:09:08,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {3955#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {3955#true} is VALID [2022-02-20 17:09:08,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {3955#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {3957#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:08,862 INFO L290 TraceCheckUtils]: 3: Hoare triple {3957#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {3957#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:08,863 INFO L290 TraceCheckUtils]: 4: Hoare triple {3957#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {3957#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:08,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {3957#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {3958#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= (+ |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~m#1|) (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|)))} is VALID [2022-02-20 17:09:08,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {3958#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= (+ |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~m#1|) (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|)))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:08,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:08,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:08,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:08,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:08,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:08,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {3960#(and (<= (+ |ULTIMATE.start_student_version_~a#1| 1) |ULTIMATE.start_student_version_~m#1|) (= |ULTIMATE.start_student_version_~l~1#1| 0))} is VALID [2022-02-20 17:09:08,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {3960#(and (<= (+ |ULTIMATE.start_student_version_~a#1| 1) |ULTIMATE.start_student_version_~m#1|) (= |ULTIMATE.start_student_version_~l~1#1| 0))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {3960#(and (<= (+ |ULTIMATE.start_student_version_~a#1| 1) |ULTIMATE.start_student_version_~m#1|) (= |ULTIMATE.start_student_version_~l~1#1| 0))} is VALID [2022-02-20 17:09:08,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {3960#(and (<= (+ |ULTIMATE.start_student_version_~a#1| 1) |ULTIMATE.start_student_version_~m#1|) (= |ULTIMATE.start_student_version_~l~1#1| 0))} assume !(student_version_~b~1#1 < student_version_~n#1); {3960#(and (<= (+ |ULTIMATE.start_student_version_~a#1| 1) |ULTIMATE.start_student_version_~m#1|) (= |ULTIMATE.start_student_version_~l~1#1| 0))} is VALID [2022-02-20 17:09:08,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {3960#(and (<= (+ |ULTIMATE.start_student_version_~a#1| 1) |ULTIMATE.start_student_version_~m#1|) (= |ULTIMATE.start_student_version_~l~1#1| 0))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {3961#(<= (+ |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:08,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {3961#(<= (+ |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !(student_version_~l~1#1 < student_version_~m#1); {3956#false} is VALID [2022-02-20 17:09:08,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {3956#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {3956#false} is VALID [2022-02-20 17:09:08,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {3956#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {3956#false} is VALID [2022-02-20 17:09:08,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {3956#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {3956#false} is VALID [2022-02-20 17:09:08,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {3956#false} student_version_#res#1 := student_version_~y~1#1; {3956#false} is VALID [2022-02-20 17:09:08,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {3956#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {3956#false} is VALID [2022-02-20 17:09:08,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {3956#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3956#false} is VALID [2022-02-20 17:09:08,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {3956#false} assume 0 == __VERIFIER_assert_~cond#1; {3956#false} is VALID [2022-02-20 17:09:08,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {3956#false} assume !false; {3956#false} is VALID [2022-02-20 17:09:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:08,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:08,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824070469] [2022-02-20 17:09:08,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824070469] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:08,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349051790] [2022-02-20 17:09:08,870 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:09:08,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:08,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:08,871 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:08,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 17:09:08,916 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:09:08,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:08,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 17:09:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:08,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:09,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {3955#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3955#true} is VALID [2022-02-20 17:09:09,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {3955#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {3955#true} is VALID [2022-02-20 17:09:09,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {3955#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {3971#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:09,157 INFO L290 TraceCheckUtils]: 3: Hoare triple {3971#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {3971#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:09,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {3971#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {3971#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:09,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {3971#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {3981#(and (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:09,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {3981#(and (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:09,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:09,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:09,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:09,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:09,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:09,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {4003#(and (<= (+ |ULTIMATE.start_student_version_~a#1| 1) |ULTIMATE.start_student_version_~m#1|) (<= |ULTIMATE.start_student_version_~l~1#1| 0))} is VALID [2022-02-20 17:09:09,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {4003#(and (<= (+ |ULTIMATE.start_student_version_~a#1| 1) |ULTIMATE.start_student_version_~m#1|) (<= |ULTIMATE.start_student_version_~l~1#1| 0))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {4003#(and (<= (+ |ULTIMATE.start_student_version_~a#1| 1) |ULTIMATE.start_student_version_~m#1|) (<= |ULTIMATE.start_student_version_~l~1#1| 0))} is VALID [2022-02-20 17:09:09,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {4003#(and (<= (+ |ULTIMATE.start_student_version_~a#1| 1) |ULTIMATE.start_student_version_~m#1|) (<= |ULTIMATE.start_student_version_~l~1#1| 0))} assume !(student_version_~b~1#1 < student_version_~n#1); {4003#(and (<= (+ |ULTIMATE.start_student_version_~a#1| 1) |ULTIMATE.start_student_version_~m#1|) (<= |ULTIMATE.start_student_version_~l~1#1| 0))} is VALID [2022-02-20 17:09:09,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {4003#(and (<= (+ |ULTIMATE.start_student_version_~a#1| 1) |ULTIMATE.start_student_version_~m#1|) (<= |ULTIMATE.start_student_version_~l~1#1| 0))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {3961#(<= (+ |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:09,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {3961#(<= (+ |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !(student_version_~l~1#1 < student_version_~m#1); {3956#false} is VALID [2022-02-20 17:09:09,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {3956#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {3956#false} is VALID [2022-02-20 17:09:09,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {3956#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {3956#false} is VALID [2022-02-20 17:09:09,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {3956#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {3956#false} is VALID [2022-02-20 17:09:09,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {3956#false} student_version_#res#1 := student_version_~y~1#1; {3956#false} is VALID [2022-02-20 17:09:09,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {3956#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {3956#false} is VALID [2022-02-20 17:09:09,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {3956#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3956#false} is VALID [2022-02-20 17:09:09,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {3956#false} assume 0 == __VERIFIER_assert_~cond#1; {3956#false} is VALID [2022-02-20 17:09:09,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {3956#false} assume !false; {3956#false} is VALID [2022-02-20 17:09:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:09,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:09,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {3956#false} assume !false; {3956#false} is VALID [2022-02-20 17:09:09,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {3956#false} assume 0 == __VERIFIER_assert_~cond#1; {3956#false} is VALID [2022-02-20 17:09:09,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {3956#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3956#false} is VALID [2022-02-20 17:09:09,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {3956#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {3956#false} is VALID [2022-02-20 17:09:09,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {3956#false} student_version_#res#1 := student_version_~y~1#1; {3956#false} is VALID [2022-02-20 17:09:09,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {3956#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {3956#false} is VALID [2022-02-20 17:09:09,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {3956#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {3956#false} is VALID [2022-02-20 17:09:09,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {3956#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {3956#false} is VALID [2022-02-20 17:09:09,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {3961#(<= (+ |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !(student_version_~l~1#1 < student_version_~m#1); {3956#false} is VALID [2022-02-20 17:09:09,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {4067#(<= (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {3961#(<= (+ |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:09,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {4067#(<= (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !(student_version_~b~1#1 < student_version_~n#1); {4067#(<= (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:09,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {4067#(<= (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {4067#(<= (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:09,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {4067#(<= (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:09,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:09,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:09,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:09,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:09,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:09,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {4095#(or (not (< |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~m#1|)) (<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {3959#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:09,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {4099#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|)) (<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {4095#(or (not (< |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~m#1|)) (<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:09,420 INFO L290 TraceCheckUtils]: 4: Hoare triple {4099#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|)) (<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {4099#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|)) (<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:09,420 INFO L290 TraceCheckUtils]: 3: Hoare triple {4099#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|)) (<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {4099#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|)) (<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:09,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {3955#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {4099#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|)) (<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:09,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {3955#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {3955#true} is VALID [2022-02-20 17:09:09,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {3955#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3955#true} is VALID [2022-02-20 17:09:09,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:09,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349051790] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:09,421 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:09,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 17:09:09,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784639899] [2022-02-20 17:09:09,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:09,422 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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 25 [2022-02-20 17:09:09,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:09,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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-20 17:09:09,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:09,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:09:09,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:09,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:09:09,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:09:09,447 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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-20 17:09:10,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:10,039 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2022-02-20 17:09:10,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:09:10,039 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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 25 [2022-02-20 17:09:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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-20 17:09:10,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-02-20 17:09:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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-20 17:09:10,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-02-20 17:09:10,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-02-20 17:09:10,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:10,076 INFO L225 Difference]: With dead ends: 90 [2022-02-20 17:09:10,077 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 17:09:10,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:09:10,077 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 96 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:10,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 271 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:09:10,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 17:09:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2022-02-20 17:09:10,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:10,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 65 states have internal predecessors, (82), 0 states have call successors, (0), 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-20 17:09:10,278 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 65 states have internal predecessors, (82), 0 states have call successors, (0), 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-20 17:09:10,278 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 65 states have internal predecessors, (82), 0 states have call successors, (0), 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-20 17:09:10,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:10,279 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2022-02-20 17:09:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2022-02-20 17:09:10,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:10,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:10,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 65 states have internal predecessors, (82), 0 states have call successors, (0), 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 78 states. [2022-02-20 17:09:10,280 INFO L87 Difference]: Start difference. First operand has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 65 states have internal predecessors, (82), 0 states have call successors, (0), 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 78 states. [2022-02-20 17:09:10,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:10,281 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2022-02-20 17:09:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2022-02-20 17:09:10,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:10,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:10,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:10,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 65 states have internal predecessors, (82), 0 states have call successors, (0), 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-20 17:09:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2022-02-20 17:09:10,282 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 25 [2022-02-20 17:09:10,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:10,282 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2022-02-20 17:09:10,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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-20 17:09:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2022-02-20 17:09:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:09:10,283 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:10,283 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:10,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:10,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-20 17:09:10,487 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:10,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash -120572194, now seen corresponding path program 6 times [2022-02-20 17:09:10,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:10,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170918801] [2022-02-20 17:09:10,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:10,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:10,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {4502#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4502#true} is VALID [2022-02-20 17:09:10,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {4502#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {4502#true} is VALID [2022-02-20 17:09:10,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {4502#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {4504#(and (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~n#1|) (= |ULTIMATE.start_correct_version_~b~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:10,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {4504#(and (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~n#1|) (= |ULTIMATE.start_correct_version_~b~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {4505#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~b~0#1|) (+ |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~n#1|)))} is VALID [2022-02-20 17:09:10,573 INFO L290 TraceCheckUtils]: 4: Hoare triple {4505#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~b~0#1|) (+ |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~n#1|)))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {4506#(and (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~a#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:10,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {4506#(and (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~a#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:10,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:10,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:10,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:10,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:10,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:10,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {4508#(and (<= |ULTIMATE.start_student_version_~n#1| |ULTIMATE.start_student_version_~a#1|) (= |ULTIMATE.start_student_version_~b~1#1| 0))} is VALID [2022-02-20 17:09:10,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {4508#(and (<= |ULTIMATE.start_student_version_~n#1| |ULTIMATE.start_student_version_~a#1|) (= |ULTIMATE.start_student_version_~b~1#1| 0))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {4509#(<= |ULTIMATE.start_student_version_~n#1| |ULTIMATE.start_student_version_~b~1#1|)} is VALID [2022-02-20 17:09:10,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {4509#(<= |ULTIMATE.start_student_version_~n#1| |ULTIMATE.start_student_version_~b~1#1|)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {4503#false} is VALID [2022-02-20 17:09:10,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {4503#false} assume !(student_version_~b~1#1 < student_version_~n#1); {4503#false} is VALID [2022-02-20 17:09:10,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {4503#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {4503#false} is VALID [2022-02-20 17:09:10,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {4503#false} assume !(student_version_~l~1#1 < student_version_~m#1); {4503#false} is VALID [2022-02-20 17:09:10,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {4503#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {4503#false} is VALID [2022-02-20 17:09:10,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {4503#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {4503#false} is VALID [2022-02-20 17:09:10,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {4503#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {4503#false} is VALID [2022-02-20 17:09:10,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {4503#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {4503#false} is VALID [2022-02-20 17:09:10,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {4503#false} student_version_#res#1 := student_version_~y~1#1; {4503#false} is VALID [2022-02-20 17:09:10,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {4503#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {4503#false} is VALID [2022-02-20 17:09:10,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {4503#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4503#false} is VALID [2022-02-20 17:09:10,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {4503#false} assume 0 == __VERIFIER_assert_~cond#1; {4503#false} is VALID [2022-02-20 17:09:10,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {4503#false} assume !false; {4503#false} is VALID [2022-02-20 17:09:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 17:09:10,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:10,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170918801] [2022-02-20 17:09:10,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170918801] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:10,579 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071726691] [2022-02-20 17:09:10,579 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 17:09:10,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:10,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:10,580 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:10,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 17:09:10,618 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-02-20 17:09:10,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:10,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 17:09:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:10,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:10,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {4502#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4502#true} is VALID [2022-02-20 17:09:10,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {4502#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {4502#true} is VALID [2022-02-20 17:09:10,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {4502#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {4519#(and (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_correct_version_~b~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~n#1|))} is VALID [2022-02-20 17:09:10,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {4519#(and (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_correct_version_~b~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~n#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {4523#(and (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~n#1|) (<= |ULTIMATE.start_correct_version_~b~0#1| |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:10,827 INFO L290 TraceCheckUtils]: 4: Hoare triple {4523#(and (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~n#1|) (<= |ULTIMATE.start_correct_version_~b~0#1| |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:10,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:10,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:10,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:10,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:10,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:10,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:10,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {4548#(and (<= |ULTIMATE.start_student_version_~n#1| |ULTIMATE.start_student_version_~a#1|) (<= 0 |ULTIMATE.start_student_version_~b~1#1|))} is VALID [2022-02-20 17:09:10,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {4548#(and (<= |ULTIMATE.start_student_version_~n#1| |ULTIMATE.start_student_version_~a#1|) (<= 0 |ULTIMATE.start_student_version_~b~1#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {4509#(<= |ULTIMATE.start_student_version_~n#1| |ULTIMATE.start_student_version_~b~1#1|)} is VALID [2022-02-20 17:09:10,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {4509#(<= |ULTIMATE.start_student_version_~n#1| |ULTIMATE.start_student_version_~b~1#1|)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {4503#false} is VALID [2022-02-20 17:09:10,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {4503#false} assume !(student_version_~b~1#1 < student_version_~n#1); {4503#false} is VALID [2022-02-20 17:09:10,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {4503#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {4503#false} is VALID [2022-02-20 17:09:10,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {4503#false} assume !(student_version_~l~1#1 < student_version_~m#1); {4503#false} is VALID [2022-02-20 17:09:10,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {4503#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {4503#false} is VALID [2022-02-20 17:09:10,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {4503#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {4503#false} is VALID [2022-02-20 17:09:10,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {4503#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {4503#false} is VALID [2022-02-20 17:09:10,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {4503#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {4503#false} is VALID [2022-02-20 17:09:10,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {4503#false} student_version_#res#1 := student_version_~y~1#1; {4503#false} is VALID [2022-02-20 17:09:10,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {4503#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {4503#false} is VALID [2022-02-20 17:09:10,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {4503#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4503#false} is VALID [2022-02-20 17:09:10,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {4503#false} assume 0 == __VERIFIER_assert_~cond#1; {4503#false} is VALID [2022-02-20 17:09:10,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {4503#false} assume !false; {4503#false} is VALID [2022-02-20 17:09:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:09:10,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:11,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {4503#false} assume !false; {4503#false} is VALID [2022-02-20 17:09:11,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {4503#false} assume 0 == __VERIFIER_assert_~cond#1; {4503#false} is VALID [2022-02-20 17:09:11,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {4503#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4503#false} is VALID [2022-02-20 17:09:11,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {4503#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {4503#false} is VALID [2022-02-20 17:09:11,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {4503#false} student_version_#res#1 := student_version_~y~1#1; {4503#false} is VALID [2022-02-20 17:09:11,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {4503#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {4503#false} is VALID [2022-02-20 17:09:11,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {4503#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {4503#false} is VALID [2022-02-20 17:09:11,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {4503#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {4503#false} is VALID [2022-02-20 17:09:11,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {4503#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {4503#false} is VALID [2022-02-20 17:09:11,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {4503#false} assume !(student_version_~l~1#1 < student_version_~m#1); {4503#false} is VALID [2022-02-20 17:09:11,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {4503#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {4503#false} is VALID [2022-02-20 17:09:11,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {4503#false} assume !(student_version_~b~1#1 < student_version_~n#1); {4503#false} is VALID [2022-02-20 17:09:11,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {4509#(<= |ULTIMATE.start_student_version_~n#1| |ULTIMATE.start_student_version_~b~1#1|)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {4503#false} is VALID [2022-02-20 17:09:11,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {4630#(<= |ULTIMATE.start_student_version_~n#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~b~1#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {4509#(<= |ULTIMATE.start_student_version_~n#1| |ULTIMATE.start_student_version_~b~1#1|)} is VALID [2022-02-20 17:09:11,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {4630#(<= |ULTIMATE.start_student_version_~n#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~b~1#1|))} is VALID [2022-02-20 17:09:11,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:11,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:11,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:11,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:11,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:11,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:11,053 INFO L290 TraceCheckUtils]: 4: Hoare triple {4655#(or (< |ULTIMATE.start_correct_version_~b~0#1| |ULTIMATE.start_correct_version_~n#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {4507#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-20 17:09:11,054 INFO L290 TraceCheckUtils]: 3: Hoare triple {4659#(or (< (+ |ULTIMATE.start_correct_version_~b~0#1| |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~n#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {4655#(or (< |ULTIMATE.start_correct_version_~b~0#1| |ULTIMATE.start_correct_version_~n#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:11,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {4502#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {4659#(or (< (+ |ULTIMATE.start_correct_version_~b~0#1| |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~n#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:11,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {4502#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {4502#true} is VALID [2022-02-20 17:09:11,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {4502#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4502#true} is VALID [2022-02-20 17:09:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:09:11,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071726691] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:11,056 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:11,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-02-20 17:09:11,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729293893] [2022-02-20 17:09:11,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:11,056 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 17:09:11,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:11,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:11,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:11,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 17:09:11,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:11,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 17:09:11,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:09:11,077 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:11,646 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2022-02-20 17:09:11,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:09:11,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 17:09:11,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-02-20 17:09:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-02-20 17:09:11,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2022-02-20 17:09:11,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:11,683 INFO L225 Difference]: With dead ends: 104 [2022-02-20 17:09:11,683 INFO L226 Difference]: Without dead ends: 79 [2022-02-20 17:09:11,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:09:11,684 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 129 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:11,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 161 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:11,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-20 17:09:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2022-02-20 17:09:11,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:11,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 67 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 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-20 17:09:11,912 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 67 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 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-20 17:09:11,912 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 67 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 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-20 17:09:11,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:11,913 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-02-20 17:09:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-02-20 17:09:11,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:11,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:11,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 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 79 states. [2022-02-20 17:09:11,914 INFO L87 Difference]: Start difference. First operand has 67 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 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 79 states. [2022-02-20 17:09:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:11,914 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-02-20 17:09:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-02-20 17:09:11,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:11,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:11,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:11,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 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-20 17:09:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2022-02-20 17:09:11,916 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 26 [2022-02-20 17:09:11,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:11,916 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2022-02-20 17:09:11,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:11,917 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2022-02-20 17:09:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:09:11,917 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:11,917 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:11,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-02-20 17:09:12,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-20 17:09:12,131 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2006452209, now seen corresponding path program 7 times [2022-02-20 17:09:12,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:12,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229857896] [2022-02-20 17:09:12,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:12,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:12,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {5083#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5083#true} is VALID [2022-02-20 17:09:12,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {5083#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {5083#true} is VALID [2022-02-20 17:09:12,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {5083#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:12,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:12,313 INFO L290 TraceCheckUtils]: 4: Hoare triple {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:12,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {5086#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:12,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {5086#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {5087#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:12,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {5087#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {5087#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:12,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {5087#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {5088#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (= |ULTIMATE.start_correct_version_~y~0#1| 0) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:12,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {5088#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (= |ULTIMATE.start_correct_version_~y~0#1| 0) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {5089#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} is VALID [2022-02-20 17:09:12,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {5089#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {5089#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} is VALID [2022-02-20 17:09:12,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {5089#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} correct_version_#res#1 := correct_version_~y~0#1; {5090#(and (<= |ULTIMATE.start_correct_version_#res#1| 2) (<= 2 |ULTIMATE.start_correct_version_#res#1|))} is VALID [2022-02-20 17:09:12,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {5090#(and (<= |ULTIMATE.start_correct_version_#res#1| 2) (<= 2 |ULTIMATE.start_correct_version_#res#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {5091#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:12,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {5091#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {5091#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:12,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {5091#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {5091#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:12,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {5091#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {5092#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} is VALID [2022-02-20 17:09:12,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {5092#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {5093#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:12,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {5093#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} assume !(student_version_~l~1#1 < student_version_~m#1); {5093#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:12,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {5093#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {5094#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~y~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:12,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {5094#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~y~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {5095#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:12,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {5095#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {5095#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:12,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {5095#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_#res#1 := student_version_~y~1#1; {5096#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} is VALID [2022-02-20 17:09:12,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {5096#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {5097#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} is VALID [2022-02-20 17:09:12,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {5097#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5098#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:09:12,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {5098#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {5084#false} is VALID [2022-02-20 17:09:12,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {5084#false} assume !false; {5084#false} is VALID [2022-02-20 17:09:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:09:12,323 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:12,323 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229857896] [2022-02-20 17:09:12,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229857896] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:12,323 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923876895] [2022-02-20 17:09:12,323 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-20 17:09:12,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:12,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:12,324 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:12,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 17:09:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:12,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 17:09:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:12,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:12,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {5083#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5083#true} is VALID [2022-02-20 17:09:12,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {5083#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {5083#true} is VALID [2022-02-20 17:09:12,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {5083#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:12,740 INFO L290 TraceCheckUtils]: 3: Hoare triple {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:12,740 INFO L290 TraceCheckUtils]: 4: Hoare triple {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:12,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {5086#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:12,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {5086#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {5087#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:12,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {5087#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {5087#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:12,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {5087#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {5088#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (= |ULTIMATE.start_correct_version_~y~0#1| 0) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:12,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {5088#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (= |ULTIMATE.start_correct_version_~y~0#1| 0) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {5089#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} is VALID [2022-02-20 17:09:12,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {5089#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {5089#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} is VALID [2022-02-20 17:09:12,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {5089#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} correct_version_#res#1 := correct_version_~y~0#1; {5090#(and (<= |ULTIMATE.start_correct_version_#res#1| 2) (<= 2 |ULTIMATE.start_correct_version_#res#1|))} is VALID [2022-02-20 17:09:12,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {5090#(and (<= |ULTIMATE.start_correct_version_#res#1| 2) (<= 2 |ULTIMATE.start_correct_version_#res#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {5091#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:12,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {5091#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {5091#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:12,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {5091#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {5091#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:12,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {5091#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {5147#(and (= |ULTIMATE.start_student_version_~j~1#1| 1) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:12,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {5147#(and (= |ULTIMATE.start_student_version_~j~1#1| 1) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {5151#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= |ULTIMATE.start_student_version_~j~1#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:12,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {5151#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= |ULTIMATE.start_student_version_~j~1#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~l~1#1 < student_version_~m#1); {5151#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= |ULTIMATE.start_student_version_~j~1#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:12,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {5151#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= |ULTIMATE.start_student_version_~j~1#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {5158#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= |ULTIMATE.start_student_version_~j~1#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~y~1#1| 0))} is VALID [2022-02-20 17:09:12,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {5158#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= |ULTIMATE.start_student_version_~j~1#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~y~1#1| 0))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {5162#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= |ULTIMATE.start_student_version_~y~1#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:12,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {5162#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= |ULTIMATE.start_student_version_~y~1#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {5162#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= |ULTIMATE.start_student_version_~y~1#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:12,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {5162#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= |ULTIMATE.start_student_version_~y~1#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_#res#1 := student_version_~y~1#1; {5169#(and (= 2 |ULTIMATE.start_student_version_#res#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:12,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {5169#(and (= 2 |ULTIMATE.start_student_version_#res#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {5173#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= 2 |ULTIMATE.start_main_~n_stones2~0#1|) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:12,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {5173#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= 2 |ULTIMATE.start_main_~n_stones2~0#1|) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5177#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:09:12,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {5177#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {5084#false} is VALID [2022-02-20 17:09:12,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {5084#false} assume !false; {5084#false} is VALID [2022-02-20 17:09:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:09:12,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:13,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {5084#false} assume !false; {5084#false} is VALID [2022-02-20 17:09:13,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {5177#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {5084#false} is VALID [2022-02-20 17:09:13,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {5097#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5177#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:09:13,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {5096#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {5097#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} is VALID [2022-02-20 17:09:13,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {5095#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_#res#1 := student_version_~y~1#1; {5096#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} is VALID [2022-02-20 17:09:13,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {5095#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {5095#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:13,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {5202#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|)))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {5095#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:13,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {5093#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {5202#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|)))} is VALID [2022-02-20 17:09:13,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {5093#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} assume !(student_version_~l~1#1 < student_version_~m#1); {5093#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:13,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {5092#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {5093#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:13,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {5215#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (+ |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {5092#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} is VALID [2022-02-20 17:09:13,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {5215#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (+ |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {5215#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (+ |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:13,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {5215#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (+ |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {5215#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (+ |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:13,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {5090#(and (<= |ULTIMATE.start_correct_version_#res#1| 2) (<= 2 |ULTIMATE.start_correct_version_#res#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {5215#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (+ |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:13,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {5089#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} correct_version_#res#1 := correct_version_~y~0#1; {5090#(and (<= |ULTIMATE.start_correct_version_#res#1| 2) (<= 2 |ULTIMATE.start_correct_version_#res#1|))} is VALID [2022-02-20 17:09:13,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {5089#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {5089#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} is VALID [2022-02-20 17:09:13,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {5234#(and (<= 2 (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|)) (<= (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) 2))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {5089#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} is VALID [2022-02-20 17:09:13,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {5087#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {5234#(and (<= 2 (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|)) (<= (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) 2))} is VALID [2022-02-20 17:09:13,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {5087#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {5087#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:13,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {5086#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {5087#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:13,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {5086#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:13,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:13,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:13,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {5083#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {5085#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:13,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {5083#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {5083#true} is VALID [2022-02-20 17:09:13,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {5083#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5083#true} is VALID [2022-02-20 17:09:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:09:13,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923876895] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:13,028 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:13,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 26 [2022-02-20 17:09:13,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71458512] [2022-02-20 17:09:13,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:13,028 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 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-20 17:09:13,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:13,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 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-20 17:09:13,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:13,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-20 17:09:13,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:13,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-20 17:09:13,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2022-02-20 17:09:13,063 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 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-20 17:09:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:14,718 INFO L93 Difference]: Finished difference Result 159 states and 188 transitions. [2022-02-20 17:09:14,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 17:09:14,719 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 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-20 17:09:14,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 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-20 17:09:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 100 transitions. [2022-02-20 17:09:14,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 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-20 17:09:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 100 transitions. [2022-02-20 17:09:14,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 100 transitions. [2022-02-20 17:09:14,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:14,790 INFO L225 Difference]: With dead ends: 159 [2022-02-20 17:09:14,790 INFO L226 Difference]: Without dead ends: 150 [2022-02-20 17:09:14,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=1433, Unknown=0, NotChecked=0, Total=1640 [2022-02-20 17:09:14,791 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 140 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:14,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 595 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:09:14,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-02-20 17:09:15,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 88. [2022-02-20 17:09:15,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:15,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 88 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 87 states have internal predecessors, (109), 0 states have call successors, (0), 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-20 17:09:15,098 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 88 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 87 states have internal predecessors, (109), 0 states have call successors, (0), 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-20 17:09:15,098 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 88 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 87 states have internal predecessors, (109), 0 states have call successors, (0), 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-20 17:09:15,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:15,100 INFO L93 Difference]: Finished difference Result 150 states and 178 transitions. [2022-02-20 17:09:15,100 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 178 transitions. [2022-02-20 17:09:15,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:15,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:15,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 87 states have internal predecessors, (109), 0 states have call successors, (0), 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 150 states. [2022-02-20 17:09:15,100 INFO L87 Difference]: Start difference. First operand has 88 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 87 states have internal predecessors, (109), 0 states have call successors, (0), 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 150 states. [2022-02-20 17:09:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:15,102 INFO L93 Difference]: Finished difference Result 150 states and 178 transitions. [2022-02-20 17:09:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 178 transitions. [2022-02-20 17:09:15,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:15,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:15,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:15,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 87 states have internal predecessors, (109), 0 states have call successors, (0), 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-20 17:09:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-02-20 17:09:15,104 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 26 [2022-02-20 17:09:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:15,104 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-02-20 17:09:15,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 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-20 17:09:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-02-20 17:09:15,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:09:15,105 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:15,105 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:15,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:15,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-20 17:09:15,319 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:15,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:15,320 INFO L85 PathProgramCache]: Analyzing trace with hash -216163038, now seen corresponding path program 8 times [2022-02-20 17:09:15,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:15,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603931471] [2022-02-20 17:09:15,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:15,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:15,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {5949#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5949#true} is VALID [2022-02-20 17:09:15,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {5949#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {5949#true} is VALID [2022-02-20 17:09:15,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {5949#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {5951#(and (<= |ULTIMATE.start_correct_version_~n#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_correct_version_~b~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:15,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {5951#(and (<= |ULTIMATE.start_correct_version_~n#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_correct_version_~b~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {5952#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= (+ |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~n#1|) (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~b~0#1|)))} is VALID [2022-02-20 17:09:15,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {5952#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= (+ |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~n#1|) (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~b~0#1|)))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {5953#(and (<= (+ |ULTIMATE.start_correct_version_~a#1| 1) |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:15,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {5953#(and (<= (+ |ULTIMATE.start_correct_version_~a#1| 1) |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {5953#(and (<= (+ |ULTIMATE.start_correct_version_~a#1| 1) |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:15,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {5953#(and (<= (+ |ULTIMATE.start_correct_version_~a#1| 1) |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {5955#(and (<= (+ |ULTIMATE.start_student_version_~a#1| 1) |ULTIMATE.start_student_version_~n#1|) (= |ULTIMATE.start_student_version_~b~1#1| 0))} is VALID [2022-02-20 17:09:15,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {5955#(and (<= (+ |ULTIMATE.start_student_version_~a#1| 1) |ULTIMATE.start_student_version_~n#1|) (= |ULTIMATE.start_student_version_~b~1#1| 0))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {5956#(<= (+ |ULTIMATE.start_student_version_~b~1#1| 1) |ULTIMATE.start_student_version_~n#1|)} is VALID [2022-02-20 17:09:15,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {5956#(<= (+ |ULTIMATE.start_student_version_~b~1#1| 1) |ULTIMATE.start_student_version_~n#1|)} assume !(student_version_~b~1#1 < student_version_~n#1); {5950#false} is VALID [2022-02-20 17:09:15,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {5950#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {5950#false} is VALID [2022-02-20 17:09:15,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {5950#false} assume !(student_version_~l~1#1 < student_version_~m#1); {5950#false} is VALID [2022-02-20 17:09:15,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {5950#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {5950#false} is VALID [2022-02-20 17:09:15,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {5950#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {5950#false} is VALID [2022-02-20 17:09:15,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {5950#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {5950#false} is VALID [2022-02-20 17:09:15,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {5950#false} student_version_#res#1 := student_version_~y~1#1; {5950#false} is VALID [2022-02-20 17:09:15,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {5950#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {5950#false} is VALID [2022-02-20 17:09:15,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {5950#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5950#false} is VALID [2022-02-20 17:09:15,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {5950#false} assume 0 == __VERIFIER_assert_~cond#1; {5950#false} is VALID [2022-02-20 17:09:15,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {5950#false} assume !false; {5950#false} is VALID [2022-02-20 17:09:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 17:09:15,402 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:15,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603931471] [2022-02-20 17:09:15,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603931471] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:15,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307654718] [2022-02-20 17:09:15,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:09:15,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:15,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:15,412 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:15,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-20 17:09:15,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:09:15,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:15,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 17:09:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:15,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:15,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {5949#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5949#true} is VALID [2022-02-20 17:09:15,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {5949#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {5949#true} is VALID [2022-02-20 17:09:15,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {5949#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {5966#(and (<= |ULTIMATE.start_correct_version_~n#1| |ULTIMATE.start_main_~n~0#1|) (<= 0 |ULTIMATE.start_correct_version_~b~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:15,668 INFO L290 TraceCheckUtils]: 3: Hoare triple {5966#(and (<= |ULTIMATE.start_correct_version_~n#1| |ULTIMATE.start_main_~n~0#1|) (<= 0 |ULTIMATE.start_correct_version_~b~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {5970#(and (<= |ULTIMATE.start_correct_version_~n#1| |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~b~0#1|))} is VALID [2022-02-20 17:09:15,668 INFO L290 TraceCheckUtils]: 4: Hoare triple {5970#(and (<= |ULTIMATE.start_correct_version_~n#1| |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~b~0#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {6001#(and (<= (+ |ULTIMATE.start_student_version_~a#1| 1) |ULTIMATE.start_student_version_~n#1|) (<= |ULTIMATE.start_student_version_~b~1#1| 0))} is VALID [2022-02-20 17:09:15,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {6001#(and (<= (+ |ULTIMATE.start_student_version_~a#1| 1) |ULTIMATE.start_student_version_~n#1|) (<= |ULTIMATE.start_student_version_~b~1#1| 0))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {5956#(<= (+ |ULTIMATE.start_student_version_~b~1#1| 1) |ULTIMATE.start_student_version_~n#1|)} is VALID [2022-02-20 17:09:15,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {5956#(<= (+ |ULTIMATE.start_student_version_~b~1#1| 1) |ULTIMATE.start_student_version_~n#1|)} assume !(student_version_~b~1#1 < student_version_~n#1); {5950#false} is VALID [2022-02-20 17:09:15,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {5950#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {5950#false} is VALID [2022-02-20 17:09:15,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {5950#false} assume !(student_version_~l~1#1 < student_version_~m#1); {5950#false} is VALID [2022-02-20 17:09:15,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {5950#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {5950#false} is VALID [2022-02-20 17:09:15,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {5950#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {5950#false} is VALID [2022-02-20 17:09:15,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {5950#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {5950#false} is VALID [2022-02-20 17:09:15,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {5950#false} student_version_#res#1 := student_version_~y~1#1; {5950#false} is VALID [2022-02-20 17:09:15,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {5950#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {5950#false} is VALID [2022-02-20 17:09:15,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {5950#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5950#false} is VALID [2022-02-20 17:09:15,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {5950#false} assume 0 == __VERIFIER_assert_~cond#1; {5950#false} is VALID [2022-02-20 17:09:15,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {5950#false} assume !false; {5950#false} is VALID [2022-02-20 17:09:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:09:15,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:15,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {5950#false} assume !false; {5950#false} is VALID [2022-02-20 17:09:15,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {5950#false} assume 0 == __VERIFIER_assert_~cond#1; {5950#false} is VALID [2022-02-20 17:09:15,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {5950#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5950#false} is VALID [2022-02-20 17:09:15,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {5950#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {5950#false} is VALID [2022-02-20 17:09:15,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {5950#false} student_version_#res#1 := student_version_~y~1#1; {5950#false} is VALID [2022-02-20 17:09:15,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {5950#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {5950#false} is VALID [2022-02-20 17:09:15,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {5950#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {5950#false} is VALID [2022-02-20 17:09:15,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {5950#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {5950#false} is VALID [2022-02-20 17:09:15,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {5950#false} assume !(student_version_~l~1#1 < student_version_~m#1); {5950#false} is VALID [2022-02-20 17:09:15,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {5950#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {5950#false} is VALID [2022-02-20 17:09:15,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {5956#(<= (+ |ULTIMATE.start_student_version_~b~1#1| 1) |ULTIMATE.start_student_version_~n#1|)} assume !(student_version_~b~1#1 < student_version_~n#1); {5950#false} is VALID [2022-02-20 17:09:15,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {6071#(<= (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~b~1#1| 1) |ULTIMATE.start_student_version_~n#1|)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {5956#(<= (+ |ULTIMATE.start_student_version_~b~1#1| 1) |ULTIMATE.start_student_version_~n#1|)} is VALID [2022-02-20 17:09:15,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {6071#(<= (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~b~1#1| 1) |ULTIMATE.start_student_version_~n#1|)} is VALID [2022-02-20 17:09:15,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,895 INFO L290 TraceCheckUtils]: 4: Hoare triple {6102#(or (<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|) (not (< |ULTIMATE.start_correct_version_~b~0#1| |ULTIMATE.start_correct_version_~n#1|)))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {5954#(<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:09:15,895 INFO L290 TraceCheckUtils]: 3: Hoare triple {6106#(or (<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_correct_version_~n#1| (+ |ULTIMATE.start_correct_version_~b~0#1| |ULTIMATE.start_correct_version_~a#1|)))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {6102#(or (<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|) (not (< |ULTIMATE.start_correct_version_~b~0#1| |ULTIMATE.start_correct_version_~n#1|)))} is VALID [2022-02-20 17:09:15,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {5949#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {6106#(or (<= (+ |ULTIMATE.start_main_~a~0#1| 1) |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_correct_version_~n#1| (+ |ULTIMATE.start_correct_version_~b~0#1| |ULTIMATE.start_correct_version_~a#1|)))} is VALID [2022-02-20 17:09:15,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {5949#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {5949#true} is VALID [2022-02-20 17:09:15,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {5949#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5949#true} is VALID [2022-02-20 17:09:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:09:15,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307654718] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:15,897 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:15,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-02-20 17:09:15,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054640788] [2022-02-20 17:09:15,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:15,898 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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-20 17:09:15,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:15,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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-20 17:09:15,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:15,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 17:09:15,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:15,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 17:09:15,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:09:15,933 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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-20 17:09:16,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:16,568 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2022-02-20 17:09:16,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:09:16,569 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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-20 17:09:16,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:16,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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-20 17:09:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-02-20 17:09:16,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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-20 17:09:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-02-20 17:09:16,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2022-02-20 17:09:16,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:16,613 INFO L225 Difference]: With dead ends: 107 [2022-02-20 17:09:16,613 INFO L226 Difference]: Without dead ends: 92 [2022-02-20 17:09:16,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:09:16,613 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 114 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:16,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 174 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:09:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-20 17:09:16,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2022-02-20 17:09:16,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:16,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 86 states, 85 states have (on average 1.223529411764706) internal successors, (104), 85 states have internal predecessors, (104), 0 states have call successors, (0), 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-20 17:09:16,961 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 86 states, 85 states have (on average 1.223529411764706) internal successors, (104), 85 states have internal predecessors, (104), 0 states have call successors, (0), 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-20 17:09:16,961 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 86 states, 85 states have (on average 1.223529411764706) internal successors, (104), 85 states have internal predecessors, (104), 0 states have call successors, (0), 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-20 17:09:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:16,962 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-02-20 17:09:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2022-02-20 17:09:16,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:16,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:16,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 85 states have (on average 1.223529411764706) internal successors, (104), 85 states have internal predecessors, (104), 0 states have call successors, (0), 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 92 states. [2022-02-20 17:09:16,963 INFO L87 Difference]: Start difference. First operand has 86 states, 85 states have (on average 1.223529411764706) internal successors, (104), 85 states have internal predecessors, (104), 0 states have call successors, (0), 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 92 states. [2022-02-20 17:09:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:16,964 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-02-20 17:09:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2022-02-20 17:09:16,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:16,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:16,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:16,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.223529411764706) internal successors, (104), 85 states have internal predecessors, (104), 0 states have call successors, (0), 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-20 17:09:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2022-02-20 17:09:16,965 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 26 [2022-02-20 17:09:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:16,965 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2022-02-20 17:09:16,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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-20 17:09:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2022-02-20 17:09:16,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 17:09:16,975 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:16,975 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:16,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:17,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-20 17:09:17,191 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:17,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:17,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1407838889, now seen corresponding path program 9 times [2022-02-20 17:09:17,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:17,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351155171] [2022-02-20 17:09:17,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:17,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:17,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {6588#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6588#true} is VALID [2022-02-20 17:09:17,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {6588#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {6588#true} is VALID [2022-02-20 17:09:17,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {6588#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {6590#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:17,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {6590#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {6590#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:17,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {6590#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {6590#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:17,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {6590#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {6591#(and (<= (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|) (+ |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~m#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:17,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {6591#(and (<= (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|) (+ |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~m#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {6592#(<= (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|) (+ |ULTIMATE.start_correct_version_~m#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:09:17,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {6592#(<= (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|) (+ |ULTIMATE.start_correct_version_~m#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:17,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:17,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:17,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:17,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} correct_version_#res#1 := correct_version_~y~0#1; {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:17,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {6594#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~m#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} is VALID [2022-02-20 17:09:17,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {6594#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~m#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {6594#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~m#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} is VALID [2022-02-20 17:09:17,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {6594#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~m#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} assume !(student_version_~b~1#1 < student_version_~n#1); {6594#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~m#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} is VALID [2022-02-20 17:09:17,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {6594#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~m#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {6595#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|))} is VALID [2022-02-20 17:09:17,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {6595#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {6596#(<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~l~1#1|)} is VALID [2022-02-20 17:09:17,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {6596#(<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~l~1#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {6589#false} is VALID [2022-02-20 17:09:17,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {6589#false} assume !(student_version_~l~1#1 < student_version_~m#1); {6589#false} is VALID [2022-02-20 17:09:17,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {6589#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {6589#false} is VALID [2022-02-20 17:09:17,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {6589#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {6589#false} is VALID [2022-02-20 17:09:17,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {6589#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {6589#false} is VALID [2022-02-20 17:09:17,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {6589#false} student_version_#res#1 := student_version_~y~1#1; {6589#false} is VALID [2022-02-20 17:09:17,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {6589#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {6589#false} is VALID [2022-02-20 17:09:17,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {6589#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {6589#false} is VALID [2022-02-20 17:09:17,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {6589#false} assume 0 == __VERIFIER_assert_~cond#1; {6589#false} is VALID [2022-02-20 17:09:17,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {6589#false} assume !false; {6589#false} is VALID [2022-02-20 17:09:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:17,308 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:17,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351155171] [2022-02-20 17:09:17,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351155171] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:17,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451121764] [2022-02-20 17:09:17,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:09:17,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:17,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:17,310 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:17,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-20 17:09:17,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 17:09:17,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:17,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 17:09:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:17,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:18,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {6588#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6588#true} is VALID [2022-02-20 17:09:18,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {6588#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {6588#true} is VALID [2022-02-20 17:09:18,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {6588#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {6606#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:18,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {6606#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {6606#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:18,108 INFO L290 TraceCheckUtils]: 4: Hoare triple {6606#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {6606#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:18,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {6606#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {6616#(and (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:18,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {6616#(and (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {6620#(and (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (<= (div (- |ULTIMATE.start_correct_version_~l~0#1|) (- 2)) |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:18,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {6620#(and (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (<= (div (- |ULTIMATE.start_correct_version_~l~0#1|) (- 2)) |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:18,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:18,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:18,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:18,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} correct_version_#res#1 := correct_version_~y~0#1; {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:18,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {6639#(and (<= 0 |ULTIMATE.start_student_version_~l~1#1|) (<= (div (* |ULTIMATE.start_student_version_~m#1| (- 1)) (- 2)) |ULTIMATE.start_student_version_~a#1|))} is VALID [2022-02-20 17:09:18,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {6639#(and (<= 0 |ULTIMATE.start_student_version_~l~1#1|) (<= (div (* |ULTIMATE.start_student_version_~m#1| (- 1)) (- 2)) |ULTIMATE.start_student_version_~a#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {6639#(and (<= 0 |ULTIMATE.start_student_version_~l~1#1|) (<= (div (* |ULTIMATE.start_student_version_~m#1| (- 1)) (- 2)) |ULTIMATE.start_student_version_~a#1|))} is VALID [2022-02-20 17:09:18,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {6639#(and (<= 0 |ULTIMATE.start_student_version_~l~1#1|) (<= (div (* |ULTIMATE.start_student_version_~m#1| (- 1)) (- 2)) |ULTIMATE.start_student_version_~a#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {6639#(and (<= 0 |ULTIMATE.start_student_version_~l~1#1|) (<= (div (* |ULTIMATE.start_student_version_~m#1| (- 1)) (- 2)) |ULTIMATE.start_student_version_~a#1|))} is VALID [2022-02-20 17:09:18,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {6639#(and (<= 0 |ULTIMATE.start_student_version_~l~1#1|) (<= (div (* |ULTIMATE.start_student_version_~m#1| (- 1)) (- 2)) |ULTIMATE.start_student_version_~a#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {6649#(and (<= |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|) (<= (div (* |ULTIMATE.start_student_version_~m#1| (- 1)) (- 2)) |ULTIMATE.start_student_version_~a#1|))} is VALID [2022-02-20 17:09:18,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {6649#(and (<= |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|) (<= (div (* |ULTIMATE.start_student_version_~m#1| (- 1)) (- 2)) |ULTIMATE.start_student_version_~a#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {6653#(<= (div (* |ULTIMATE.start_student_version_~m#1| (- 1)) (- 2)) (div |ULTIMATE.start_student_version_~l~1#1| 2))} is VALID [2022-02-20 17:09:18,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {6653#(<= (div (* |ULTIMATE.start_student_version_~m#1| (- 1)) (- 2)) (div |ULTIMATE.start_student_version_~l~1#1| 2))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {6589#false} is VALID [2022-02-20 17:09:18,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {6589#false} assume !(student_version_~l~1#1 < student_version_~m#1); {6589#false} is VALID [2022-02-20 17:09:18,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {6589#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {6589#false} is VALID [2022-02-20 17:09:18,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {6589#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {6589#false} is VALID [2022-02-20 17:09:18,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {6589#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {6589#false} is VALID [2022-02-20 17:09:18,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {6589#false} student_version_#res#1 := student_version_~y~1#1; {6589#false} is VALID [2022-02-20 17:09:18,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {6589#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {6589#false} is VALID [2022-02-20 17:09:18,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {6589#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {6589#false} is VALID [2022-02-20 17:09:18,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {6589#false} assume 0 == __VERIFIER_assert_~cond#1; {6589#false} is VALID [2022-02-20 17:09:18,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {6589#false} assume !false; {6589#false} is VALID [2022-02-20 17:09:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:18,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:18,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {6589#false} assume !false; {6589#false} is VALID [2022-02-20 17:09:18,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {6589#false} assume 0 == __VERIFIER_assert_~cond#1; {6589#false} is VALID [2022-02-20 17:09:18,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {6589#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {6589#false} is VALID [2022-02-20 17:09:18,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {6589#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {6589#false} is VALID [2022-02-20 17:09:18,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {6589#false} student_version_#res#1 := student_version_~y~1#1; {6589#false} is VALID [2022-02-20 17:09:18,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {6589#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {6589#false} is VALID [2022-02-20 17:09:18,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {6589#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {6589#false} is VALID [2022-02-20 17:09:18,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {6589#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {6589#false} is VALID [2022-02-20 17:09:18,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {6589#false} assume !(student_version_~l~1#1 < student_version_~m#1); {6589#false} is VALID [2022-02-20 17:09:18,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {6596#(<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~l~1#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {6589#false} is VALID [2022-02-20 17:09:18,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {6595#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {6596#(<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~l~1#1|)} is VALID [2022-02-20 17:09:18,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {6717#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {6595#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|))} is VALID [2022-02-20 17:09:18,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {6717#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} assume !(student_version_~b~1#1 < student_version_~n#1); {6717#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} is VALID [2022-02-20 17:09:18,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {6717#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {6717#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} is VALID [2022-02-20 17:09:18,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {6717#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} is VALID [2022-02-20 17:09:18,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} correct_version_#res#1 := correct_version_~y~0#1; {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:18,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:18,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:18,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:18,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {6742#(or (<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~m#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {6593#(<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:18,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {6746#(or (<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)) (< (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {6742#(or (<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:18,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {6750#(or (< (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|) |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {6746#(or (<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)) (< (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:18,539 INFO L290 TraceCheckUtils]: 4: Hoare triple {6750#(or (< (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|) |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {6750#(or (< (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|) |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:09:18,539 INFO L290 TraceCheckUtils]: 3: Hoare triple {6750#(or (< (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|) |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {6750#(or (< (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|) |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:09:18,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {6588#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {6750#(or (< (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|) |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_main_~m~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:09:18,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {6588#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {6588#true} is VALID [2022-02-20 17:09:18,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {6588#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6588#true} is VALID [2022-02-20 17:09:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:18,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451121764] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:18,540 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:18,540 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-02-20 17:09:18,541 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164503597] [2022-02-20 17:09:18,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:18,541 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 17:09:18,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:18,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:18,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:18,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 17:09:18,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:18,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 17:09:18,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:09:18,575 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:19,812 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2022-02-20 17:09:19,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 17:09:19,812 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 17:09:19,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:19,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 75 transitions. [2022-02-20 17:09:19,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:19,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 75 transitions. [2022-02-20 17:09:19,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 75 transitions. [2022-02-20 17:09:19,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:19,871 INFO L225 Difference]: With dead ends: 131 [2022-02-20 17:09:19,871 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 17:09:19,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=625, Unknown=0, NotChecked=0, Total=812 [2022-02-20 17:09:19,872 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 196 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:19,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 285 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:09:19,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 17:09:20,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2022-02-20 17:09:20,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:20,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 83 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 82 states have internal predecessors, (101), 0 states have call successors, (0), 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-20 17:09:20,302 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 83 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 82 states have internal predecessors, (101), 0 states have call successors, (0), 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-20 17:09:20,302 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 83 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 82 states have internal predecessors, (101), 0 states have call successors, (0), 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-20 17:09:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:20,303 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2022-02-20 17:09:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2022-02-20 17:09:20,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:20,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:20,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 82 states have internal predecessors, (101), 0 states have call successors, (0), 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 107 states. [2022-02-20 17:09:20,304 INFO L87 Difference]: Start difference. First operand has 83 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 82 states have internal predecessors, (101), 0 states have call successors, (0), 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 107 states. [2022-02-20 17:09:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:20,305 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2022-02-20 17:09:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2022-02-20 17:09:20,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:20,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:20,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:20,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 82 states have internal predecessors, (101), 0 states have call successors, (0), 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-20 17:09:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2022-02-20 17:09:20,307 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 27 [2022-02-20 17:09:20,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:20,307 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2022-02-20 17:09:20,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-02-20 17:09:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 17:09:20,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:20,308 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:20,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-02-20 17:09:20,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:20,523 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:20,524 INFO L85 PathProgramCache]: Analyzing trace with hash -325007018, now seen corresponding path program 10 times [2022-02-20 17:09:20,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:20,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827265680] [2022-02-20 17:09:20,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:20,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {7314#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7314#true} is VALID [2022-02-20 17:09:20,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {7314#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {7314#true} is VALID [2022-02-20 17:09:20,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {7314#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {7316#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:20,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {7316#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {7316#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:20,629 INFO L290 TraceCheckUtils]: 4: Hoare triple {7316#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {7316#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:20,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {7316#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {7317#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= (+ |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~m#1|) (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|)))} is VALID [2022-02-20 17:09:20,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {7317#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= (+ |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~m#1|) (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|)))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {7318#(and (<= (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|) (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:20,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {7318#(and (<= (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|) (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:20,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:20,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:20,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:20,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:20,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:20,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {7320#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= (+ (* |ULTIMATE.start_student_version_~a#1| 2) 1) |ULTIMATE.start_student_version_~m#1|))} is VALID [2022-02-20 17:09:20,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {7320#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= (+ (* |ULTIMATE.start_student_version_~a#1| 2) 1) |ULTIMATE.start_student_version_~m#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {7320#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= (+ (* |ULTIMATE.start_student_version_~a#1| 2) 1) |ULTIMATE.start_student_version_~m#1|))} is VALID [2022-02-20 17:09:20,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {7320#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= (+ (* |ULTIMATE.start_student_version_~a#1| 2) 1) |ULTIMATE.start_student_version_~m#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {7320#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= (+ (* |ULTIMATE.start_student_version_~a#1| 2) 1) |ULTIMATE.start_student_version_~m#1|))} is VALID [2022-02-20 17:09:20,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {7320#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= (+ (* |ULTIMATE.start_student_version_~a#1| 2) 1) |ULTIMATE.start_student_version_~m#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {7321#(<= (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:20,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {7321#(<= (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {7322#(<= (+ |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:20,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {7322#(<= (+ |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !(student_version_~l~1#1 < student_version_~m#1); {7315#false} is VALID [2022-02-20 17:09:20,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {7315#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {7315#false} is VALID [2022-02-20 17:09:20,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {7315#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {7315#false} is VALID [2022-02-20 17:09:20,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {7315#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {7315#false} is VALID [2022-02-20 17:09:20,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {7315#false} student_version_#res#1 := student_version_~y~1#1; {7315#false} is VALID [2022-02-20 17:09:20,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {7315#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {7315#false} is VALID [2022-02-20 17:09:20,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {7315#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {7315#false} is VALID [2022-02-20 17:09:20,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {7315#false} assume 0 == __VERIFIER_assert_~cond#1; {7315#false} is VALID [2022-02-20 17:09:20,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {7315#false} assume !false; {7315#false} is VALID [2022-02-20 17:09:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:20,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:20,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827265680] [2022-02-20 17:09:20,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827265680] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:20,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535121148] [2022-02-20 17:09:20,638 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:09:20,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:20,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:20,639 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:20,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-20 17:09:20,680 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:09:20,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:20,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 17:09:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:20,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:21,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {7314#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7314#true} is VALID [2022-02-20 17:09:21,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {7314#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {7314#true} is VALID [2022-02-20 17:09:21,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {7314#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {7332#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:21,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {7332#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {7332#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:21,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {7332#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {7332#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:21,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {7332#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {7342#(and (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:21,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {7342#(and (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {7346#(and (<= |ULTIMATE.start_main_~a~0#1| (div |ULTIMATE.start_correct_version_~l~0#1| 2)) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:21,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {7346#(and (<= |ULTIMATE.start_main_~a~0#1| (div |ULTIMATE.start_correct_version_~l~0#1| 2)) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:21,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:21,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:21,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:21,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:21,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:21,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {7368#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 2)))} is VALID [2022-02-20 17:09:21,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {7368#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 2)))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {7368#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 2)))} is VALID [2022-02-20 17:09:21,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {7368#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 2)))} assume !(student_version_~b~1#1 < student_version_~n#1); {7368#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 2)))} is VALID [2022-02-20 17:09:21,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {7368#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 2)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {7378#(and (<= |ULTIMATE.start_student_version_~l~1#1| |ULTIMATE.start_student_version_~a#1|) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 2)))} is VALID [2022-02-20 17:09:21,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {7378#(and (<= |ULTIMATE.start_student_version_~l~1#1| |ULTIMATE.start_student_version_~a#1|) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 2)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {7382#(<= (div (- |ULTIMATE.start_student_version_~l~1#1|) (- 2)) (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 2))} is VALID [2022-02-20 17:09:21,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {7382#(<= (div (- |ULTIMATE.start_student_version_~l~1#1|) (- 2)) (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 2))} assume !(student_version_~l~1#1 < student_version_~m#1); {7315#false} is VALID [2022-02-20 17:09:21,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {7315#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {7315#false} is VALID [2022-02-20 17:09:21,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {7315#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {7315#false} is VALID [2022-02-20 17:09:21,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {7315#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {7315#false} is VALID [2022-02-20 17:09:21,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {7315#false} student_version_#res#1 := student_version_~y~1#1; {7315#false} is VALID [2022-02-20 17:09:21,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {7315#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {7315#false} is VALID [2022-02-20 17:09:21,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {7315#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {7315#false} is VALID [2022-02-20 17:09:21,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {7315#false} assume 0 == __VERIFIER_assert_~cond#1; {7315#false} is VALID [2022-02-20 17:09:21,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {7315#false} assume !false; {7315#false} is VALID [2022-02-20 17:09:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:21,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:21,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {7315#false} assume !false; {7315#false} is VALID [2022-02-20 17:09:21,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {7315#false} assume 0 == __VERIFIER_assert_~cond#1; {7315#false} is VALID [2022-02-20 17:09:21,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {7315#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {7315#false} is VALID [2022-02-20 17:09:21,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {7315#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {7315#false} is VALID [2022-02-20 17:09:21,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {7315#false} student_version_#res#1 := student_version_~y~1#1; {7315#false} is VALID [2022-02-20 17:09:21,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {7315#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {7315#false} is VALID [2022-02-20 17:09:21,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {7315#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {7315#false} is VALID [2022-02-20 17:09:21,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {7315#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {7315#false} is VALID [2022-02-20 17:09:21,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {7322#(<= (+ |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !(student_version_~l~1#1 < student_version_~m#1); {7315#false} is VALID [2022-02-20 17:09:21,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {7321#(<= (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {7322#(<= (+ |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:21,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {7440#(<= (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2) 1) |ULTIMATE.start_student_version_~m#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {7321#(<= (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:21,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {7440#(<= (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2) 1) |ULTIMATE.start_student_version_~m#1|)} assume !(student_version_~b~1#1 < student_version_~n#1); {7440#(<= (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2) 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:21,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {7440#(<= (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2) 1) |ULTIMATE.start_student_version_~m#1|)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {7440#(<= (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2) 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:21,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {7440#(<= (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2) 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:21,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:21,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:21,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:21,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:21,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:21,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {7468#(or (not (< |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~m#1|)) (<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {7319#(<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:21,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {7472#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|)) (<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {7468#(or (not (< |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~m#1|)) (<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:21,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {7476#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|)) (<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {7472#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|)) (<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:21,695 INFO L290 TraceCheckUtils]: 4: Hoare triple {7476#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|)) (<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {7476#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|)) (<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:21,695 INFO L290 TraceCheckUtils]: 3: Hoare triple {7476#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|)) (<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {7476#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|)) (<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:21,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {7314#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {7476#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|)) (<= (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:21,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {7314#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {7314#true} is VALID [2022-02-20 17:09:21,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {7314#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7314#true} is VALID [2022-02-20 17:09:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:21,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535121148] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:21,696 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:21,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-02-20 17:09:21,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965335983] [2022-02-20 17:09:21,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:21,697 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 17:09:21,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:21,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:21,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:21,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 17:09:21,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:21,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 17:09:21,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:09:21,728 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:22,900 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2022-02-20 17:09:22,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:09:22,900 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 17:09:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2022-02-20 17:09:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2022-02-20 17:09:22,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2022-02-20 17:09:22,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:22,966 INFO L225 Difference]: With dead ends: 121 [2022-02-20 17:09:22,966 INFO L226 Difference]: Without dead ends: 109 [2022-02-20 17:09:22,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2022-02-20 17:09:22,966 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 203 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:22,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 396 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:09:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-20 17:09:23,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 85. [2022-02-20 17:09:23,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:23,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 85 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 84 states have internal predecessors, (103), 0 states have call successors, (0), 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-20 17:09:23,418 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 85 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 84 states have internal predecessors, (103), 0 states have call successors, (0), 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-20 17:09:23,419 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 85 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 84 states have internal predecessors, (103), 0 states have call successors, (0), 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-20 17:09:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:23,420 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2022-02-20 17:09:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2022-02-20 17:09:23,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:23,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:23,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 84 states have internal predecessors, (103), 0 states have call successors, (0), 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 109 states. [2022-02-20 17:09:23,421 INFO L87 Difference]: Start difference. First operand has 85 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 84 states have internal predecessors, (103), 0 states have call successors, (0), 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 109 states. [2022-02-20 17:09:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:23,422 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2022-02-20 17:09:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2022-02-20 17:09:23,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:23,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:23,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:23,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:23,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 84 states have internal predecessors, (103), 0 states have call successors, (0), 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-20 17:09:23,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-02-20 17:09:23,424 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 27 [2022-02-20 17:09:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:23,424 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-02-20 17:09:23,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-02-20 17:09:23,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 17:09:23,425 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:23,425 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:23,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:23,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-02-20 17:09:23,627 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:23,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:23,628 INFO L85 PathProgramCache]: Analyzing trace with hash 480362644, now seen corresponding path program 11 times [2022-02-20 17:09:23,628 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:23,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052140810] [2022-02-20 17:09:23,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:23,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:23,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {8023#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8023#true} is VALID [2022-02-20 17:09:23,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {8023#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {8023#true} is VALID [2022-02-20 17:09:23,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {8023#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {8025#(= |ULTIMATE.start_correct_version_~i~0#1| 0)} is VALID [2022-02-20 17:09:23,692 INFO L290 TraceCheckUtils]: 3: Hoare triple {8025#(= |ULTIMATE.start_correct_version_~i~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {8026#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,693 INFO L290 TraceCheckUtils]: 4: Hoare triple {8026#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {8028#(and (<= 2 |ULTIMATE.start_correct_version_~i~0#1|) (= |ULTIMATE.start_correct_version_~x~0#1| 0))} is VALID [2022-02-20 17:09:23,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {8028#(and (<= 2 |ULTIMATE.start_correct_version_~i~0#1|) (= |ULTIMATE.start_correct_version_~x~0#1| 0))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {8029#(<= (+ |ULTIMATE.start_correct_version_~x~0#1| 1) |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {8029#(<= (+ |ULTIMATE.start_correct_version_~x~0#1| 1) |ULTIMATE.start_correct_version_~i~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {8024#false} is VALID [2022-02-20 17:09:23,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {8024#false} correct_version_#res#1 := correct_version_~y~0#1; {8024#false} is VALID [2022-02-20 17:09:23,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {8024#false} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {8024#false} is VALID [2022-02-20 17:09:23,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {8024#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {8024#false} is VALID [2022-02-20 17:09:23,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {8024#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {8024#false} is VALID [2022-02-20 17:09:23,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {8024#false} assume !(student_version_~b~1#1 < student_version_~n#1); {8024#false} is VALID [2022-02-20 17:09:23,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {8024#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {8024#false} is VALID [2022-02-20 17:09:23,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {8024#false} assume !(student_version_~l~1#1 < student_version_~m#1); {8024#false} is VALID [2022-02-20 17:09:23,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {8024#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {8024#false} is VALID [2022-02-20 17:09:23,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {8024#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {8024#false} is VALID [2022-02-20 17:09:23,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {8024#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {8024#false} is VALID [2022-02-20 17:09:23,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {8024#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {8024#false} is VALID [2022-02-20 17:09:23,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {8024#false} student_version_#res#1 := student_version_~y~1#1; {8024#false} is VALID [2022-02-20 17:09:23,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {8024#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {8024#false} is VALID [2022-02-20 17:09:23,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {8024#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {8024#false} is VALID [2022-02-20 17:09:23,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {8024#false} assume 0 == __VERIFIER_assert_~cond#1; {8024#false} is VALID [2022-02-20 17:09:23,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {8024#false} assume !false; {8024#false} is VALID [2022-02-20 17:09:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 17:09:23,696 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:23,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052140810] [2022-02-20 17:09:23,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052140810] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:23,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676525621] [2022-02-20 17:09:23,696 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:09:23,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:23,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:23,698 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:23,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-20 17:09:23,736 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:09:23,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:23,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 17:09:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:23,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:23,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {8023#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8023#true} is VALID [2022-02-20 17:09:23,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {8023#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {8023#true} is VALID [2022-02-20 17:09:23,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {8023#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {8039#(<= 0 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {8039#(<= 0 |ULTIMATE.start_correct_version_~i~0#1|)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {8026#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,844 INFO L290 TraceCheckUtils]: 4: Hoare triple {8026#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {8058#(and (<= 2 |ULTIMATE.start_correct_version_~i~0#1|) (<= |ULTIMATE.start_correct_version_~x~0#1| 0))} is VALID [2022-02-20 17:09:23,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {8058#(and (<= 2 |ULTIMATE.start_correct_version_~i~0#1|) (<= |ULTIMATE.start_correct_version_~x~0#1| 0))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {8062#(and (<= 2 |ULTIMATE.start_correct_version_~i~0#1|) (<= |ULTIMATE.start_correct_version_~x~0#1| 1))} is VALID [2022-02-20 17:09:23,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {8062#(and (<= 2 |ULTIMATE.start_correct_version_~i~0#1|) (<= |ULTIMATE.start_correct_version_~x~0#1| 1))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {8024#false} is VALID [2022-02-20 17:09:23,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {8024#false} correct_version_#res#1 := correct_version_~y~0#1; {8024#false} is VALID [2022-02-20 17:09:23,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {8024#false} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {8024#false} is VALID [2022-02-20 17:09:23,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {8024#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {8024#false} is VALID [2022-02-20 17:09:23,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {8024#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {8024#false} is VALID [2022-02-20 17:09:23,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {8024#false} assume !(student_version_~b~1#1 < student_version_~n#1); {8024#false} is VALID [2022-02-20 17:09:23,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {8024#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {8024#false} is VALID [2022-02-20 17:09:23,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {8024#false} assume !(student_version_~l~1#1 < student_version_~m#1); {8024#false} is VALID [2022-02-20 17:09:23,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {8024#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {8024#false} is VALID [2022-02-20 17:09:23,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {8024#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {8024#false} is VALID [2022-02-20 17:09:23,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {8024#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {8024#false} is VALID [2022-02-20 17:09:23,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {8024#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {8024#false} is VALID [2022-02-20 17:09:23,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {8024#false} student_version_#res#1 := student_version_~y~1#1; {8024#false} is VALID [2022-02-20 17:09:23,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {8024#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {8024#false} is VALID [2022-02-20 17:09:23,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {8024#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {8024#false} is VALID [2022-02-20 17:09:23,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {8024#false} assume 0 == __VERIFIER_assert_~cond#1; {8024#false} is VALID [2022-02-20 17:09:23,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {8024#false} assume !false; {8024#false} is VALID [2022-02-20 17:09:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 17:09:23,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:23,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {8024#false} assume !false; {8024#false} is VALID [2022-02-20 17:09:23,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {8024#false} assume 0 == __VERIFIER_assert_~cond#1; {8024#false} is VALID [2022-02-20 17:09:23,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {8024#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {8024#false} is VALID [2022-02-20 17:09:23,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {8024#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {8024#false} is VALID [2022-02-20 17:09:23,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {8024#false} student_version_#res#1 := student_version_~y~1#1; {8024#false} is VALID [2022-02-20 17:09:23,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {8024#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {8024#false} is VALID [2022-02-20 17:09:23,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {8024#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {8024#false} is VALID [2022-02-20 17:09:23,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {8024#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {8024#false} is VALID [2022-02-20 17:09:23,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {8024#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {8024#false} is VALID [2022-02-20 17:09:23,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {8024#false} assume !(student_version_~l~1#1 < student_version_~m#1); {8024#false} is VALID [2022-02-20 17:09:23,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {8024#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {8024#false} is VALID [2022-02-20 17:09:23,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {8024#false} assume !(student_version_~b~1#1 < student_version_~n#1); {8024#false} is VALID [2022-02-20 17:09:23,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {8024#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {8024#false} is VALID [2022-02-20 17:09:23,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {8024#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {8024#false} is VALID [2022-02-20 17:09:23,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {8024#false} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {8024#false} is VALID [2022-02-20 17:09:23,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {8024#false} correct_version_#res#1 := correct_version_~y~0#1; {8024#false} is VALID [2022-02-20 17:09:23,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {8029#(<= (+ |ULTIMATE.start_correct_version_~x~0#1| 1) |ULTIMATE.start_correct_version_~i~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {8024#false} is VALID [2022-02-20 17:09:23,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {8165#(<= (+ 2 |ULTIMATE.start_correct_version_~x~0#1|) |ULTIMATE.start_correct_version_~i~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {8029#(<= (+ |ULTIMATE.start_correct_version_~x~0#1| 1) |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {8165#(<= (+ 2 |ULTIMATE.start_correct_version_~x~0#1|) |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,943 INFO L290 TraceCheckUtils]: 4: Hoare triple {8026#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {8027#(<= 2 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {8039#(<= 0 |ULTIMATE.start_correct_version_~i~0#1|)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {8026#(<= 1 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {8023#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {8039#(<= 0 |ULTIMATE.start_correct_version_~i~0#1|)} is VALID [2022-02-20 17:09:23,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {8023#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {8023#true} is VALID [2022-02-20 17:09:23,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {8023#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8023#true} is VALID [2022-02-20 17:09:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 17:09:23,944 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676525621] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:23,944 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:23,944 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-02-20 17:09:23,944 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067822371] [2022-02-20 17:09:23,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:23,945 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 17:09:23,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:23,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:23,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:23,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:09:23,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:23,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:09:23,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:09:23,970 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:24,432 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2022-02-20 17:09:24,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:09:24,432 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 17:09:24,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-02-20 17:09:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-02-20 17:09:24,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2022-02-20 17:09:24,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:24,480 INFO L225 Difference]: With dead ends: 110 [2022-02-20 17:09:24,480 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 17:09:24,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:09:24,481 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 68 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:24,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 116 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 17:09:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-02-20 17:09:24,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:24,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 71 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 70 states have internal predecessors, (85), 0 states have call successors, (0), 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-20 17:09:24,823 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 71 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 70 states have internal predecessors, (85), 0 states have call successors, (0), 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-20 17:09:24,823 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 71 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 70 states have internal predecessors, (85), 0 states have call successors, (0), 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-20 17:09:24,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:24,824 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-02-20 17:09:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-02-20 17:09:24,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:24,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:24,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 70 states have internal predecessors, (85), 0 states have call successors, (0), 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 77 states. [2022-02-20 17:09:24,825 INFO L87 Difference]: Start difference. First operand has 71 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 70 states have internal predecessors, (85), 0 states have call successors, (0), 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 77 states. [2022-02-20 17:09:24,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:24,826 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-02-20 17:09:24,826 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-02-20 17:09:24,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:24,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:24,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:24,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:24,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 70 states have internal predecessors, (85), 0 states have call successors, (0), 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-20 17:09:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2022-02-20 17:09:24,828 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 27 [2022-02-20 17:09:24,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:24,828 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2022-02-20 17:09:24,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:24,828 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2022-02-20 17:09:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 17:09:24,828 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:24,829 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:24,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:25,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:25,035 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash 400247189, now seen corresponding path program 12 times [2022-02-20 17:09:25,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:25,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710740578] [2022-02-20 17:09:25,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:25,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:25,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {8614#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8614#true} is VALID [2022-02-20 17:09:25,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {8614#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {8614#true} is VALID [2022-02-20 17:09:25,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {8614#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {8614#true} is VALID [2022-02-20 17:09:25,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {8614#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {8614#true} is VALID [2022-02-20 17:09:25,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {8614#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {8614#true} is VALID [2022-02-20 17:09:25,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {8614#true} assume !(correct_version_~b~0#1 < correct_version_~n#1); {8614#true} is VALID [2022-02-20 17:09:25,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {8614#true} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {8614#true} is VALID [2022-02-20 17:09:25,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {8614#true} assume !(correct_version_~l~0#1 < correct_version_~m#1); {8614#true} is VALID [2022-02-20 17:09:25,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {8614#true} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {8614#true} is VALID [2022-02-20 17:09:25,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {8614#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {8614#true} is VALID [2022-02-20 17:09:25,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {8614#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {8614#true} is VALID [2022-02-20 17:09:25,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {8614#true} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {8614#true} is VALID [2022-02-20 17:09:25,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {8614#true} correct_version_#res#1 := correct_version_~y~0#1; {8614#true} is VALID [2022-02-20 17:09:25,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {8614#true} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {8616#(= |ULTIMATE.start_student_version_~i~1#1| 0)} is VALID [2022-02-20 17:09:25,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {8616#(= |ULTIMATE.start_student_version_~i~1#1| 0)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {8617#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {8617#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} assume !(student_version_~b~1#1 < student_version_~n#1); {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} assume !(student_version_~l~1#1 < student_version_~m#1); {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {8619#(and (<= 2 |ULTIMATE.start_student_version_~i~1#1|) (= |ULTIMATE.start_student_version_~x~1#1| 0))} is VALID [2022-02-20 17:09:25,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {8619#(and (<= 2 |ULTIMATE.start_student_version_~i~1#1|) (= |ULTIMATE.start_student_version_~x~1#1| 0))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {8620#(<= (+ |ULTIMATE.start_student_version_~x~1#1| 1) |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {8620#(<= (+ |ULTIMATE.start_student_version_~x~1#1| 1) |ULTIMATE.start_student_version_~i~1#1|)} assume !(student_version_~x~1#1 < student_version_~i~1#1); {8615#false} is VALID [2022-02-20 17:09:25,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {8615#false} student_version_#res#1 := student_version_~y~1#1; {8615#false} is VALID [2022-02-20 17:09:25,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {8615#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {8615#false} is VALID [2022-02-20 17:09:25,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {8615#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {8615#false} is VALID [2022-02-20 17:09:25,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {8615#false} assume 0 == __VERIFIER_assert_~cond#1; {8615#false} is VALID [2022-02-20 17:09:25,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {8615#false} assume !false; {8615#false} is VALID [2022-02-20 17:09:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 17:09:25,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:25,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710740578] [2022-02-20 17:09:25,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710740578] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:25,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472218256] [2022-02-20 17:09:25,095 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 17:09:25,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:25,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:25,097 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:25,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-20 17:09:25,139 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-02-20 17:09:25,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:25,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 17:09:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:25,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:25,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {8614#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8614#true} is VALID [2022-02-20 17:09:25,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {8614#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {8614#true} is VALID [2022-02-20 17:09:25,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {8614#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {8614#true} is VALID [2022-02-20 17:09:25,244 INFO L290 TraceCheckUtils]: 3: Hoare triple {8614#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {8614#true} is VALID [2022-02-20 17:09:25,244 INFO L290 TraceCheckUtils]: 4: Hoare triple {8614#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {8614#true} is VALID [2022-02-20 17:09:25,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {8614#true} assume !(correct_version_~b~0#1 < correct_version_~n#1); {8614#true} is VALID [2022-02-20 17:09:25,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {8614#true} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {8614#true} is VALID [2022-02-20 17:09:25,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {8614#true} assume !(correct_version_~l~0#1 < correct_version_~m#1); {8614#true} is VALID [2022-02-20 17:09:25,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {8614#true} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {8614#true} is VALID [2022-02-20 17:09:25,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {8614#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {8614#true} is VALID [2022-02-20 17:09:25,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {8614#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {8614#true} is VALID [2022-02-20 17:09:25,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {8614#true} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {8614#true} is VALID [2022-02-20 17:09:25,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {8614#true} correct_version_#res#1 := correct_version_~y~0#1; {8614#true} is VALID [2022-02-20 17:09:25,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {8614#true} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {8663#(<= 0 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {8663#(<= 0 |ULTIMATE.start_student_version_~i~1#1|)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {8617#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {8617#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} assume !(student_version_~b~1#1 < student_version_~n#1); {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} assume !(student_version_~l~1#1 < student_version_~m#1); {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {8682#(and (<= |ULTIMATE.start_student_version_~x~1#1| 0) (<= 2 |ULTIMATE.start_student_version_~i~1#1|))} is VALID [2022-02-20 17:09:25,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {8682#(and (<= |ULTIMATE.start_student_version_~x~1#1| 0) (<= 2 |ULTIMATE.start_student_version_~i~1#1|))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {8686#(and (<= 2 |ULTIMATE.start_student_version_~i~1#1|) (<= |ULTIMATE.start_student_version_~x~1#1| 1))} is VALID [2022-02-20 17:09:25,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {8686#(and (<= 2 |ULTIMATE.start_student_version_~i~1#1|) (<= |ULTIMATE.start_student_version_~x~1#1| 1))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {8615#false} is VALID [2022-02-20 17:09:25,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {8615#false} student_version_#res#1 := student_version_~y~1#1; {8615#false} is VALID [2022-02-20 17:09:25,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {8615#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {8615#false} is VALID [2022-02-20 17:09:25,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {8615#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {8615#false} is VALID [2022-02-20 17:09:25,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {8615#false} assume 0 == __VERIFIER_assert_~cond#1; {8615#false} is VALID [2022-02-20 17:09:25,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {8615#false} assume !false; {8615#false} is VALID [2022-02-20 17:09:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 17:09:25,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:25,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {8615#false} assume !false; {8615#false} is VALID [2022-02-20 17:09:25,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {8615#false} assume 0 == __VERIFIER_assert_~cond#1; {8615#false} is VALID [2022-02-20 17:09:25,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {8615#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {8615#false} is VALID [2022-02-20 17:09:25,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {8615#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {8615#false} is VALID [2022-02-20 17:09:25,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {8615#false} student_version_#res#1 := student_version_~y~1#1; {8615#false} is VALID [2022-02-20 17:09:25,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {8620#(<= (+ |ULTIMATE.start_student_version_~x~1#1| 1) |ULTIMATE.start_student_version_~i~1#1|)} assume !(student_version_~x~1#1 < student_version_~i~1#1); {8615#false} is VALID [2022-02-20 17:09:25,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {8723#(<= (+ |ULTIMATE.start_student_version_~x~1#1| 2) |ULTIMATE.start_student_version_~i~1#1|)} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {8620#(<= (+ |ULTIMATE.start_student_version_~x~1#1| 1) |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {8723#(<= (+ |ULTIMATE.start_student_version_~x~1#1| 2) |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} assume !(student_version_~l~1#1 < student_version_~m#1); {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} assume !(student_version_~b~1#1 < student_version_~n#1); {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {8617#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {8618#(<= 2 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {8663#(<= 0 |ULTIMATE.start_student_version_~i~1#1|)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {8617#(<= 1 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {8614#true} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {8663#(<= 0 |ULTIMATE.start_student_version_~i~1#1|)} is VALID [2022-02-20 17:09:25,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {8614#true} correct_version_#res#1 := correct_version_~y~0#1; {8614#true} is VALID [2022-02-20 17:09:25,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {8614#true} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {8614#true} is VALID [2022-02-20 17:09:25,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {8614#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {8614#true} is VALID [2022-02-20 17:09:25,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {8614#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {8614#true} is VALID [2022-02-20 17:09:25,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {8614#true} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {8614#true} is VALID [2022-02-20 17:09:25,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {8614#true} assume !(correct_version_~l~0#1 < correct_version_~m#1); {8614#true} is VALID [2022-02-20 17:09:25,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {8614#true} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {8614#true} is VALID [2022-02-20 17:09:25,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {8614#true} assume !(correct_version_~b~0#1 < correct_version_~n#1); {8614#true} is VALID [2022-02-20 17:09:25,344 INFO L290 TraceCheckUtils]: 4: Hoare triple {8614#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {8614#true} is VALID [2022-02-20 17:09:25,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {8614#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {8614#true} is VALID [2022-02-20 17:09:25,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {8614#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {8614#true} is VALID [2022-02-20 17:09:25,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {8614#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {8614#true} is VALID [2022-02-20 17:09:25,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {8614#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8614#true} is VALID [2022-02-20 17:09:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 17:09:25,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472218256] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:25,345 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:25,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-02-20 17:09:25,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995741763] [2022-02-20 17:09:25,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:25,345 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 17:09:25,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:25,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:25,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:25,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:09:25,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:25,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:09:25,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:09:25,364 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:25,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:25,831 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-02-20 17:09:25,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:09:25,831 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 17:09:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-02-20 17:09:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-02-20 17:09:25,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-02-20 17:09:25,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:25,875 INFO L225 Difference]: With dead ends: 84 [2022-02-20 17:09:25,875 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 17:09:25,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:09:25,876 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:25,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 106 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 17:09:26,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2022-02-20 17:09:26,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:26,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 72 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 71 states have internal predecessors, (86), 0 states have call successors, (0), 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-20 17:09:26,253 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 72 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 71 states have internal predecessors, (86), 0 states have call successors, (0), 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-20 17:09:26,254 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 72 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 71 states have internal predecessors, (86), 0 states have call successors, (0), 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-20 17:09:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:26,255 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-02-20 17:09:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-02-20 17:09:26,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:26,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:26,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 71 states have internal predecessors, (86), 0 states have call successors, (0), 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 78 states. [2022-02-20 17:09:26,256 INFO L87 Difference]: Start difference. First operand has 72 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 71 states have internal predecessors, (86), 0 states have call successors, (0), 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 78 states. [2022-02-20 17:09:26,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:26,257 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-02-20 17:09:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-02-20 17:09:26,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:26,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:26,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:26,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 71 states have internal predecessors, (86), 0 states have call successors, (0), 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-20 17:09:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2022-02-20 17:09:26,258 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 27 [2022-02-20 17:09:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:26,258 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2022-02-20 17:09:26,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-02-20 17:09:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:09:26,259 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:26,259 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:26,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:26,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:26,475 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:26,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash -822645520, now seen corresponding path program 13 times [2022-02-20 17:09:26,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:26,476 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435423588] [2022-02-20 17:09:26,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:26,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:26,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {9169#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {9169#true} is VALID [2022-02-20 17:09:26,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {9169#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {9169#true} is VALID [2022-02-20 17:09:26,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {9169#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:26,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:26,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:26,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {9172#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:26,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {9172#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {9173#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:26,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {9173#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {9174#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} is VALID [2022-02-20 17:09:26,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {9174#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {9174#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} is VALID [2022-02-20 17:09:26,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {9174#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {9175#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (= |ULTIMATE.start_correct_version_~y~0#1| 0) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} is VALID [2022-02-20 17:09:26,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {9175#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (= |ULTIMATE.start_correct_version_~y~0#1| 0) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {9176#(and (<= 3 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 3))} is VALID [2022-02-20 17:09:26,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {9176#(and (<= 3 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 3))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {9176#(and (<= 3 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 3))} is VALID [2022-02-20 17:09:26,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {9176#(and (<= 3 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 3))} correct_version_#res#1 := correct_version_~y~0#1; {9177#(and (<= 3 |ULTIMATE.start_correct_version_#res#1|) (<= |ULTIMATE.start_correct_version_#res#1| 3))} is VALID [2022-02-20 17:09:26,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {9177#(and (<= 3 |ULTIMATE.start_correct_version_#res#1|) (<= |ULTIMATE.start_correct_version_#res#1| 3))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {9178#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:26,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {9178#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {9178#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:26,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {9178#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {9178#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:26,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {9178#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {9179#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (+ |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:26,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {9179#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (+ |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {9180#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} is VALID [2022-02-20 17:09:26,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {9180#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {9181#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:26,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {9181#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} assume !(student_version_~l~1#1 < student_version_~m#1); {9181#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:26,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {9181#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {9182#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~y~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:26,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {9182#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~y~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {9183#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:26,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {9183#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {9183#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:26,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {9183#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_#res#1 := student_version_~y~1#1; {9184#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} is VALID [2022-02-20 17:09:26,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {9184#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {9185#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} is VALID [2022-02-20 17:09:26,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {9185#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {9186#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:09:26,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {9186#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {9170#false} is VALID [2022-02-20 17:09:26,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {9170#false} assume !false; {9170#false} is VALID [2022-02-20 17:09:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:09:26,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:26,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435423588] [2022-02-20 17:09:26,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435423588] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:26,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191764261] [2022-02-20 17:09:26,715 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-20 17:09:26,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:26,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:26,716 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:26,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-20 17:09:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:26,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-20 17:09:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:26,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:27,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {9169#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {9169#true} is VALID [2022-02-20 17:09:27,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {9169#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {9169#true} is VALID [2022-02-20 17:09:27,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {9169#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:27,195 INFO L290 TraceCheckUtils]: 3: Hoare triple {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:27,195 INFO L290 TraceCheckUtils]: 4: Hoare triple {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:27,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {9172#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:27,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {9172#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {9173#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:27,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {9173#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {9174#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} is VALID [2022-02-20 17:09:27,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {9174#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {9174#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} is VALID [2022-02-20 17:09:27,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {9174#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {9175#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (= |ULTIMATE.start_correct_version_~y~0#1| 0) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} is VALID [2022-02-20 17:09:27,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {9175#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (= |ULTIMATE.start_correct_version_~y~0#1| 0) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {9176#(and (<= 3 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 3))} is VALID [2022-02-20 17:09:27,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {9176#(and (<= 3 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 3))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {9176#(and (<= 3 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 3))} is VALID [2022-02-20 17:09:27,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {9176#(and (<= 3 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 3))} correct_version_#res#1 := correct_version_~y~0#1; {9177#(and (<= 3 |ULTIMATE.start_correct_version_#res#1|) (<= |ULTIMATE.start_correct_version_#res#1| 3))} is VALID [2022-02-20 17:09:27,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {9177#(and (<= 3 |ULTIMATE.start_correct_version_#res#1|) (<= |ULTIMATE.start_correct_version_#res#1| 3))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {9178#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:27,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {9178#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {9178#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:27,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {9178#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {9178#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:27,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {9178#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {9238#(and (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:27,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {9238#(and (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {9242#(and (= (+ (- 2) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:27,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {9242#(and (= (+ (- 2) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {9246#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ |ULTIMATE.start_student_version_~j~1#1| (- 3)) 0))} is VALID [2022-02-20 17:09:27,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {9246#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ |ULTIMATE.start_student_version_~j~1#1| (- 3)) 0))} assume !(student_version_~l~1#1 < student_version_~m#1); {9246#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ |ULTIMATE.start_student_version_~j~1#1| (- 3)) 0))} is VALID [2022-02-20 17:09:27,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {9246#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ |ULTIMATE.start_student_version_~j~1#1| (- 3)) 0))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {9253#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ |ULTIMATE.start_student_version_~j~1#1| (- 3)) 0) (= |ULTIMATE.start_student_version_~y~1#1| 0))} is VALID [2022-02-20 17:09:27,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {9253#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ |ULTIMATE.start_student_version_~j~1#1| (- 3)) 0) (= |ULTIMATE.start_student_version_~y~1#1| 0))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {9257#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ |ULTIMATE.start_student_version_~y~1#1| (- 3)) 0))} is VALID [2022-02-20 17:09:27,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {9257#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ |ULTIMATE.start_student_version_~y~1#1| (- 3)) 0))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {9257#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ |ULTIMATE.start_student_version_~y~1#1| (- 3)) 0))} is VALID [2022-02-20 17:09:27,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {9257#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ |ULTIMATE.start_student_version_~y~1#1| (- 3)) 0))} student_version_#res#1 := student_version_~y~1#1; {9264#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ (- 3) |ULTIMATE.start_student_version_#res#1|) 0))} is VALID [2022-02-20 17:09:27,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {9264#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ (- 3) |ULTIMATE.start_student_version_#res#1|) 0))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {9268#(and (= (+ (- 3) |ULTIMATE.start_main_~n_stones2~0#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:27,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {9268#(and (= (+ (- 3) |ULTIMATE.start_main_~n_stones2~0#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 3) (<= 3 |ULTIMATE.start_main_~n_stones1~0#1|))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {9272#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:09:27,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {9272#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {9170#false} is VALID [2022-02-20 17:09:27,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {9170#false} assume !false; {9170#false} is VALID [2022-02-20 17:09:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:09:27,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:27,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {9170#false} assume !false; {9170#false} is VALID [2022-02-20 17:09:27,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {9272#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {9170#false} is VALID [2022-02-20 17:09:27,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {9185#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {9272#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:09:27,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {9184#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {9185#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} is VALID [2022-02-20 17:09:27,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {9183#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_#res#1 := student_version_~y~1#1; {9184#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} is VALID [2022-02-20 17:09:27,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {9183#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {9183#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:27,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {9297#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|)))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {9183#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:27,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {9181#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {9297#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|)))} is VALID [2022-02-20 17:09:27,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {9181#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} assume !(student_version_~l~1#1 < student_version_~m#1); {9181#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:27,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {9180#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {9181#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:27,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {9179#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (+ |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {9180#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} is VALID [2022-02-20 17:09:27,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {9313#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 3) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 3)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {9179#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (+ |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:27,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {9313#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 3) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 3)))} assume !(student_version_~b~1#1 < student_version_~n#1); {9313#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 3) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 3)))} is VALID [2022-02-20 17:09:27,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {9313#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 3) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 3)))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {9313#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 3) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 3)))} is VALID [2022-02-20 17:09:27,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {9177#(and (<= 3 |ULTIMATE.start_correct_version_#res#1|) (<= |ULTIMATE.start_correct_version_#res#1| 3))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {9313#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 3) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 3)))} is VALID [2022-02-20 17:09:27,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {9176#(and (<= 3 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 3))} correct_version_#res#1 := correct_version_~y~0#1; {9177#(and (<= 3 |ULTIMATE.start_correct_version_#res#1|) (<= |ULTIMATE.start_correct_version_#res#1| 3))} is VALID [2022-02-20 17:09:27,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {9176#(and (<= 3 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 3))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {9176#(and (<= 3 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 3))} is VALID [2022-02-20 17:09:27,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {9332#(and (<= 3 (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|)) (<= (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) 3))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {9176#(and (<= 3 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 3))} is VALID [2022-02-20 17:09:27,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {9174#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {9332#(and (<= 3 (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|)) (<= (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) 3))} is VALID [2022-02-20 17:09:27,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {9174#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {9174#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} is VALID [2022-02-20 17:09:27,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {9173#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {9174#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} is VALID [2022-02-20 17:09:27,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {9172#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {9173#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:27,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {9172#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:27,490 INFO L290 TraceCheckUtils]: 4: Hoare triple {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:27,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:27,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {9169#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {9171#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:27,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {9169#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {9169#true} is VALID [2022-02-20 17:09:27,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {9169#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {9169#true} is VALID [2022-02-20 17:09:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:09:27,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191764261] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:27,491 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:27,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 29 [2022-02-20 17:09:27,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389294254] [2022-02-20 17:09:27,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:27,499 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 0 states have call successors, (0), 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 28 [2022-02-20 17:09:27,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:27,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 0 states have call successors, (0), 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-20 17:09:27,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:27,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-20 17:09:27,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:27,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-20 17:09:27,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-02-20 17:09:27,532 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 0 states have call successors, (0), 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-20 17:09:29,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:29,777 INFO L93 Difference]: Finished difference Result 149 states and 168 transitions. [2022-02-20 17:09:29,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-20 17:09:29,778 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 0 states have call successors, (0), 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 28 [2022-02-20 17:09:29,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 0 states have call successors, (0), 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-20 17:09:29,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 112 transitions. [2022-02-20 17:09:29,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 0 states have call successors, (0), 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-20 17:09:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 112 transitions. [2022-02-20 17:09:29,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 112 transitions. [2022-02-20 17:09:29,855 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-20 17:09:29,856 INFO L225 Difference]: With dead ends: 149 [2022-02-20 17:09:29,857 INFO L226 Difference]: Without dead ends: 140 [2022-02-20 17:09:29,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=1844, Unknown=0, NotChecked=0, Total=2070 [2022-02-20 17:09:29,858 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 144 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:29,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 943 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:09:29,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-02-20 17:09:30,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 81. [2022-02-20 17:09:30,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:30,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 81 states, 80 states have (on average 1.2) internal successors, (96), 80 states have internal predecessors, (96), 0 states have call successors, (0), 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-20 17:09:30,318 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 81 states, 80 states have (on average 1.2) internal successors, (96), 80 states have internal predecessors, (96), 0 states have call successors, (0), 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-20 17:09:30,318 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 81 states, 80 states have (on average 1.2) internal successors, (96), 80 states have internal predecessors, (96), 0 states have call successors, (0), 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-20 17:09:30,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:30,320 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2022-02-20 17:09:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2022-02-20 17:09:30,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:30,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:30,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 80 states have (on average 1.2) internal successors, (96), 80 states have internal predecessors, (96), 0 states have call successors, (0), 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 140 states. [2022-02-20 17:09:30,320 INFO L87 Difference]: Start difference. First operand has 81 states, 80 states have (on average 1.2) internal successors, (96), 80 states have internal predecessors, (96), 0 states have call successors, (0), 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 140 states. [2022-02-20 17:09:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:30,322 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2022-02-20 17:09:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2022-02-20 17:09:30,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:30,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:30,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:30,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.2) internal successors, (96), 80 states have internal predecessors, (96), 0 states have call successors, (0), 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-20 17:09:30,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2022-02-20 17:09:30,323 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 28 [2022-02-20 17:09:30,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:30,323 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2022-02-20 17:09:30,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 0 states have call successors, (0), 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-20 17:09:30,323 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2022-02-20 17:09:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:09:30,324 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:30,324 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:30,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:30,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-02-20 17:09:30,525 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:30,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:30,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1124024368, now seen corresponding path program 14 times [2022-02-20 17:09:30,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:30,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110844690] [2022-02-20 17:09:30,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:30,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:30,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {10011#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10011#true} is VALID [2022-02-20 17:09:30,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {10011#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {10011#true} is VALID [2022-02-20 17:09:30,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {10011#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:30,733 INFO L290 TraceCheckUtils]: 3: Hoare triple {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:30,733 INFO L290 TraceCheckUtils]: 4: Hoare triple {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:30,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:30,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {10014#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:30,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {10014#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {10014#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:30,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {10014#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {10015#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1) (= |ULTIMATE.start_correct_version_~y~0#1| 0))} is VALID [2022-02-20 17:09:30,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {10015#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1) (= |ULTIMATE.start_correct_version_~y~0#1| 0))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {10016#(and (<= 2 (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|)) (<= (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) 2))} is VALID [2022-02-20 17:09:30,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {10016#(and (<= 2 (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|)) (<= (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) 2))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {10017#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} is VALID [2022-02-20 17:09:30,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {10017#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {10017#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} is VALID [2022-02-20 17:09:30,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {10017#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} correct_version_#res#1 := correct_version_~y~0#1; {10018#(and (<= |ULTIMATE.start_correct_version_#res#1| 2) (<= 2 |ULTIMATE.start_correct_version_#res#1|))} is VALID [2022-02-20 17:09:30,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {10018#(and (<= |ULTIMATE.start_correct_version_#res#1| 2) (<= 2 |ULTIMATE.start_correct_version_#res#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {10019#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:30,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {10019#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {10019#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:30,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {10019#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {10019#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:30,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {10019#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {10019#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:30,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {10019#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {10020#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:30,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {10020#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~l~1#1 < student_version_~m#1); {10020#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:30,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {10020#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {10021#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~y~1#1| 0))} is VALID [2022-02-20 17:09:30,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {10021#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~y~1#1| 0))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {10022#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|)))} is VALID [2022-02-20 17:09:30,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {10022#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|)))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {10023#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:30,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {10023#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {10023#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:30,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {10023#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_#res#1 := student_version_~y~1#1; {10024#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} is VALID [2022-02-20 17:09:30,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {10024#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {10025#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} is VALID [2022-02-20 17:09:30,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {10025#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {10026#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:09:30,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {10026#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {10012#false} is VALID [2022-02-20 17:09:30,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {10012#false} assume !false; {10012#false} is VALID [2022-02-20 17:09:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:09:30,744 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:30,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110844690] [2022-02-20 17:09:30,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110844690] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:30,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689404182] [2022-02-20 17:09:30,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:09:30,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:30,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:30,745 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:30,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-20 17:09:30,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:09:30,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:30,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 17:09:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:30,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:31,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {10011#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10011#true} is VALID [2022-02-20 17:09:31,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {10011#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {10011#true} is VALID [2022-02-20 17:09:31,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {10011#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:31,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:31,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:31,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:31,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {10014#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:31,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {10014#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {10014#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:31,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {10014#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {10015#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1) (= |ULTIMATE.start_correct_version_~y~0#1| 0))} is VALID [2022-02-20 17:09:31,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {10015#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1) (= |ULTIMATE.start_correct_version_~y~0#1| 0))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {10057#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (= |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:31,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {10057#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (= |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {10017#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} is VALID [2022-02-20 17:09:31,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {10017#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {10017#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} is VALID [2022-02-20 17:09:31,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {10017#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} correct_version_#res#1 := correct_version_~y~0#1; {10018#(and (<= |ULTIMATE.start_correct_version_#res#1| 2) (<= 2 |ULTIMATE.start_correct_version_#res#1|))} is VALID [2022-02-20 17:09:31,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {10018#(and (<= |ULTIMATE.start_correct_version_#res#1| 2) (<= 2 |ULTIMATE.start_correct_version_#res#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {10019#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {10019#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {10019#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {10019#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {10019#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {10019#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {10019#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {10019#(and (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {10082#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {10082#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~l~1#1 < student_version_~m#1); {10082#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {10082#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {10089#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~y~1#1| 0))} is VALID [2022-02-20 17:09:31,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {10089#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~y~1#1| 0))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {10093#(and (= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {10093#(and (= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {10097#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= (+ (- 1) |ULTIMATE.start_student_version_~y~1#1|) 1) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {10097#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= (+ (- 1) |ULTIMATE.start_student_version_~y~1#1|) 1) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {10097#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= (+ (- 1) |ULTIMATE.start_student_version_~y~1#1|) 1) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {10097#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= (+ (- 1) |ULTIMATE.start_student_version_~y~1#1|) 1) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_#res#1 := student_version_~y~1#1; {10104#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= (+ (- 1) |ULTIMATE.start_student_version_#res#1|) 1) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {10104#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= (+ (- 1) |ULTIMATE.start_student_version_#res#1|) 1) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {10108#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= 2 |ULTIMATE.start_main_~n_stones2~0#1|) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {10108#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| 2) (= 2 |ULTIMATE.start_main_~n_stones2~0#1|) (<= 2 |ULTIMATE.start_main_~n_stones1~0#1|))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {10112#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:09:31,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {10112#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {10012#false} is VALID [2022-02-20 17:09:31,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {10012#false} assume !false; {10012#false} is VALID [2022-02-20 17:09:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:09:31,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:31,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {10012#false} assume !false; {10012#false} is VALID [2022-02-20 17:09:31,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {10112#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {10012#false} is VALID [2022-02-20 17:09:31,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {10025#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {10112#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:09:31,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {10024#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {10025#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} is VALID [2022-02-20 17:09:31,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {10023#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_#res#1 := student_version_~y~1#1; {10024#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} is VALID [2022-02-20 17:09:31,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {10023#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {10023#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {10022#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|)))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {10023#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {10140#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_student_version_~y~1#1|)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {10022#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|)))} is VALID [2022-02-20 17:09:31,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {10020#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {10140#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_student_version_~y~1#1|)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {10020#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~l~1#1 < student_version_~m#1); {10020#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {10150#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {10020#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {10150#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {10150#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {10150#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {10150#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {10150#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {10150#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {10018#(and (<= |ULTIMATE.start_correct_version_#res#1| 2) (<= 2 |ULTIMATE.start_correct_version_#res#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {10150#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:31,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {10017#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} correct_version_#res#1 := correct_version_~y~0#1; {10018#(and (<= |ULTIMATE.start_correct_version_#res#1| 2) (<= 2 |ULTIMATE.start_correct_version_#res#1|))} is VALID [2022-02-20 17:09:31,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {10017#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {10017#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} is VALID [2022-02-20 17:09:31,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {10016#(and (<= 2 (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|)) (<= (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) 2))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {10017#(and (<= |ULTIMATE.start_correct_version_~y~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~y~0#1|))} is VALID [2022-02-20 17:09:31,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {10175#(and (<= 2 (+ (* 2 |ULTIMATE.start_correct_version_~j~0#1|) |ULTIMATE.start_correct_version_~y~0#1|)) (<= (+ (* 2 |ULTIMATE.start_correct_version_~j~0#1|) |ULTIMATE.start_correct_version_~y~0#1|) 2))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {10016#(and (<= 2 (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|)) (<= (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) 2))} is VALID [2022-02-20 17:09:31,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {10014#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {10175#(and (<= 2 (+ (* 2 |ULTIMATE.start_correct_version_~j~0#1|) |ULTIMATE.start_correct_version_~y~0#1|)) (<= (+ (* 2 |ULTIMATE.start_correct_version_~j~0#1|) |ULTIMATE.start_correct_version_~y~0#1|) 2))} is VALID [2022-02-20 17:09:31,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {10014#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {10014#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:31,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {10014#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:31,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:31,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:31,498 INFO L290 TraceCheckUtils]: 3: Hoare triple {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:31,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {10011#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {10013#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:31,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {10011#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {10011#true} is VALID [2022-02-20 17:09:31,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {10011#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10011#true} is VALID [2022-02-20 17:09:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:09:31,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689404182] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:31,498 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:31,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 27 [2022-02-20 17:09:31,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788728990] [2022-02-20 17:09:31,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:31,499 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 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 28 [2022-02-20 17:09:31,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:31,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 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-20 17:09:31,530 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-20 17:09:31,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-20 17:09:31,530 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:31,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-20 17:09:31,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-02-20 17:09:31,531 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 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-20 17:09:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:33,116 INFO L93 Difference]: Finished difference Result 118 states and 135 transitions. [2022-02-20 17:09:33,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 17:09:33,116 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 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 28 [2022-02-20 17:09:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 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-20 17:09:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 71 transitions. [2022-02-20 17:09:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 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-20 17:09:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 71 transitions. [2022-02-20 17:09:33,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 71 transitions. [2022-02-20 17:09:33,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:33,173 INFO L225 Difference]: With dead ends: 118 [2022-02-20 17:09:33,173 INFO L226 Difference]: Without dead ends: 112 [2022-02-20 17:09:33,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=1435, Unknown=0, NotChecked=0, Total=1640 [2022-02-20 17:09:33,174 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 96 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:33,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 404 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:09:33,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-20 17:09:33,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2022-02-20 17:09:33,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:33,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 91 states, 90 states have (on average 1.2) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 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-20 17:09:33,713 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 91 states, 90 states have (on average 1.2) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 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-20 17:09:33,713 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 91 states, 90 states have (on average 1.2) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 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-20 17:09:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:33,714 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2022-02-20 17:09:33,714 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2022-02-20 17:09:33,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:33,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:33,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 90 states have (on average 1.2) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 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 112 states. [2022-02-20 17:09:33,714 INFO L87 Difference]: Start difference. First operand has 91 states, 90 states have (on average 1.2) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 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 112 states. [2022-02-20 17:09:33,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:33,715 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2022-02-20 17:09:33,716 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2022-02-20 17:09:33,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:33,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:33,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:33,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.2) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 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-20 17:09:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2022-02-20 17:09:33,717 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 28 [2022-02-20 17:09:33,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:33,717 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2022-02-20 17:09:33,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 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-20 17:09:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2022-02-20 17:09:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:09:33,717 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:33,717 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:33,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:33,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:33,918 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:33,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:33,918 INFO L85 PathProgramCache]: Analyzing trace with hash 930430102, now seen corresponding path program 15 times [2022-02-20 17:09:33,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:33,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957571643] [2022-02-20 17:09:33,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:33,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:34,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {10764#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10764#true} is VALID [2022-02-20 17:09:34,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {10764#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {10764#true} is VALID [2022-02-20 17:09:34,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {10764#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {10766#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:34,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {10766#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {10766#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:34,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {10766#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {10766#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:34,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {10766#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {10767#(and (<= (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|) (+ |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~m#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:34,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {10767#(and (<= (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|) (+ |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~m#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {10768#(and (<= (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|) (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:34,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {10768#(and (<= (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|) (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {10769#(<= (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|) (+ (* 3 |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:34,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {10769#(<= (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|) (+ (* 3 |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_correct_version_~m#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:34,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:34,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:34,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:34,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} correct_version_#res#1 := correct_version_~y~0#1; {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:34,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {10771#(and (<= |ULTIMATE.start_student_version_~m#1| (* |ULTIMATE.start_student_version_~a#1| 3)) (= |ULTIMATE.start_student_version_~l~1#1| 0))} is VALID [2022-02-20 17:09:34,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {10771#(and (<= |ULTIMATE.start_student_version_~m#1| (* |ULTIMATE.start_student_version_~a#1| 3)) (= |ULTIMATE.start_student_version_~l~1#1| 0))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {10771#(and (<= |ULTIMATE.start_student_version_~m#1| (* |ULTIMATE.start_student_version_~a#1| 3)) (= |ULTIMATE.start_student_version_~l~1#1| 0))} is VALID [2022-02-20 17:09:34,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {10771#(and (<= |ULTIMATE.start_student_version_~m#1| (* |ULTIMATE.start_student_version_~a#1| 3)) (= |ULTIMATE.start_student_version_~l~1#1| 0))} assume !(student_version_~b~1#1 < student_version_~n#1); {10771#(and (<= |ULTIMATE.start_student_version_~m#1| (* |ULTIMATE.start_student_version_~a#1| 3)) (= |ULTIMATE.start_student_version_~l~1#1| 0))} is VALID [2022-02-20 17:09:34,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {10771#(and (<= |ULTIMATE.start_student_version_~m#1| (* |ULTIMATE.start_student_version_~a#1| 3)) (= |ULTIMATE.start_student_version_~l~1#1| 0))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {10772#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} is VALID [2022-02-20 17:09:34,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {10772#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {10773#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|))} is VALID [2022-02-20 17:09:34,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {10773#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {10774#(<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~l~1#1|)} is VALID [2022-02-20 17:09:34,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {10774#(<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~l~1#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {10765#false} is VALID [2022-02-20 17:09:34,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {10765#false} assume !(student_version_~l~1#1 < student_version_~m#1); {10765#false} is VALID [2022-02-20 17:09:34,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {10765#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {10765#false} is VALID [2022-02-20 17:09:34,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {10765#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {10765#false} is VALID [2022-02-20 17:09:34,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {10765#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {10765#false} is VALID [2022-02-20 17:09:34,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {10765#false} student_version_#res#1 := student_version_~y~1#1; {10765#false} is VALID [2022-02-20 17:09:34,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {10765#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {10765#false} is VALID [2022-02-20 17:09:34,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {10765#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {10765#false} is VALID [2022-02-20 17:09:34,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {10765#false} assume 0 == __VERIFIER_assert_~cond#1; {10765#false} is VALID [2022-02-20 17:09:34,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {10765#false} assume !false; {10765#false} is VALID [2022-02-20 17:09:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:34,030 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:34,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957571643] [2022-02-20 17:09:34,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957571643] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:34,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260264339] [2022-02-20 17:09:34,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:09:34,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:34,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:34,032 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:34,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-02-20 17:09:34,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 17:09:34,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:34,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 17:09:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:34,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:34,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {10764#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10764#true} is VALID [2022-02-20 17:09:34,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {10764#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {10764#true} is VALID [2022-02-20 17:09:34,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {10764#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {10784#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:34,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {10784#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {10784#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:34,888 INFO L290 TraceCheckUtils]: 4: Hoare triple {10784#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {10784#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:34,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {10784#(and (<= |ULTIMATE.start_correct_version_~l~0#1| 0) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {10794#(and (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:34,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {10794#(and (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {10798#(and (<= |ULTIMATE.start_correct_version_~l~0#1| (* 2 |ULTIMATE.start_correct_version_~a#1|)) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:34,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {10798#(and (<= |ULTIMATE.start_correct_version_~l~0#1| (* 2 |ULTIMATE.start_correct_version_~a#1|)) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {10802#(and (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (<= (div (- |ULTIMATE.start_correct_version_~l~0#1|) (- 3)) |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:34,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {10802#(and (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~m#1|) (<= (div (- |ULTIMATE.start_correct_version_~l~0#1|) (- 3)) |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:34,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:34,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:34,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:34,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} correct_version_#res#1 := correct_version_~y~0#1; {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:34,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {10821#(and (<= 0 |ULTIMATE.start_student_version_~l~1#1|) (<= (div (- |ULTIMATE.start_student_version_~m#1|) (- 3)) |ULTIMATE.start_student_version_~a#1|))} is VALID [2022-02-20 17:09:34,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {10821#(and (<= 0 |ULTIMATE.start_student_version_~l~1#1|) (<= (div (- |ULTIMATE.start_student_version_~m#1|) (- 3)) |ULTIMATE.start_student_version_~a#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {10821#(and (<= 0 |ULTIMATE.start_student_version_~l~1#1|) (<= (div (- |ULTIMATE.start_student_version_~m#1|) (- 3)) |ULTIMATE.start_student_version_~a#1|))} is VALID [2022-02-20 17:09:34,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {10821#(and (<= 0 |ULTIMATE.start_student_version_~l~1#1|) (<= (div (- |ULTIMATE.start_student_version_~m#1|) (- 3)) |ULTIMATE.start_student_version_~a#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {10821#(and (<= 0 |ULTIMATE.start_student_version_~l~1#1|) (<= (div (- |ULTIMATE.start_student_version_~m#1|) (- 3)) |ULTIMATE.start_student_version_~a#1|))} is VALID [2022-02-20 17:09:34,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {10821#(and (<= 0 |ULTIMATE.start_student_version_~l~1#1|) (<= (div (- |ULTIMATE.start_student_version_~m#1|) (- 3)) |ULTIMATE.start_student_version_~a#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {10831#(and (<= |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|) (<= (div (- |ULTIMATE.start_student_version_~m#1|) (- 3)) |ULTIMATE.start_student_version_~a#1|))} is VALID [2022-02-20 17:09:34,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {10831#(and (<= |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|) (<= (div (- |ULTIMATE.start_student_version_~m#1|) (- 3)) |ULTIMATE.start_student_version_~a#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {10835#(and (<= (* |ULTIMATE.start_student_version_~a#1| 2) |ULTIMATE.start_student_version_~l~1#1|) (<= (div (- |ULTIMATE.start_student_version_~m#1|) (- 3)) |ULTIMATE.start_student_version_~a#1|))} is VALID [2022-02-20 17:09:34,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {10835#(and (<= (* |ULTIMATE.start_student_version_~a#1| 2) |ULTIMATE.start_student_version_~l~1#1|) (<= (div (- |ULTIMATE.start_student_version_~m#1|) (- 3)) |ULTIMATE.start_student_version_~a#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {10839#(<= (div (* |ULTIMATE.start_student_version_~m#1| (- 1)) (- 3)) (div |ULTIMATE.start_student_version_~l~1#1| 3))} is VALID [2022-02-20 17:09:34,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {10839#(<= (div (* |ULTIMATE.start_student_version_~m#1| (- 1)) (- 3)) (div |ULTIMATE.start_student_version_~l~1#1| 3))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {10765#false} is VALID [2022-02-20 17:09:34,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {10765#false} assume !(student_version_~l~1#1 < student_version_~m#1); {10765#false} is VALID [2022-02-20 17:09:34,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {10765#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {10765#false} is VALID [2022-02-20 17:09:34,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {10765#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {10765#false} is VALID [2022-02-20 17:09:34,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {10765#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {10765#false} is VALID [2022-02-20 17:09:34,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {10765#false} student_version_#res#1 := student_version_~y~1#1; {10765#false} is VALID [2022-02-20 17:09:34,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {10765#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {10765#false} is VALID [2022-02-20 17:09:34,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {10765#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {10765#false} is VALID [2022-02-20 17:09:34,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {10765#false} assume 0 == __VERIFIER_assert_~cond#1; {10765#false} is VALID [2022-02-20 17:09:34,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {10765#false} assume !false; {10765#false} is VALID [2022-02-20 17:09:34,898 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:34,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:35,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {10765#false} assume !false; {10765#false} is VALID [2022-02-20 17:09:35,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {10765#false} assume 0 == __VERIFIER_assert_~cond#1; {10765#false} is VALID [2022-02-20 17:09:35,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {10765#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {10765#false} is VALID [2022-02-20 17:09:35,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {10765#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {10765#false} is VALID [2022-02-20 17:09:35,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {10765#false} student_version_#res#1 := student_version_~y~1#1; {10765#false} is VALID [2022-02-20 17:09:35,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {10765#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {10765#false} is VALID [2022-02-20 17:09:35,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {10765#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {10765#false} is VALID [2022-02-20 17:09:35,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {10765#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {10765#false} is VALID [2022-02-20 17:09:35,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {10765#false} assume !(student_version_~l~1#1 < student_version_~m#1); {10765#false} is VALID [2022-02-20 17:09:35,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {10774#(<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~l~1#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {10765#false} is VALID [2022-02-20 17:09:35,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {10773#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {10774#(<= |ULTIMATE.start_student_version_~m#1| |ULTIMATE.start_student_version_~l~1#1|)} is VALID [2022-02-20 17:09:35,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {10772#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {10773#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1|))} is VALID [2022-02-20 17:09:35,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {10906#(<= |ULTIMATE.start_student_version_~m#1| (+ (* |ULTIMATE.start_student_version_~a#1| 3) |ULTIMATE.start_student_version_~l~1#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {10772#(<= |ULTIMATE.start_student_version_~m#1| (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} is VALID [2022-02-20 17:09:35,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {10906#(<= |ULTIMATE.start_student_version_~m#1| (+ (* |ULTIMATE.start_student_version_~a#1| 3) |ULTIMATE.start_student_version_~l~1#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {10906#(<= |ULTIMATE.start_student_version_~m#1| (+ (* |ULTIMATE.start_student_version_~a#1| 3) |ULTIMATE.start_student_version_~l~1#1|))} is VALID [2022-02-20 17:09:35,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {10906#(<= |ULTIMATE.start_student_version_~m#1| (+ (* |ULTIMATE.start_student_version_~a#1| 3) |ULTIMATE.start_student_version_~l~1#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {10906#(<= |ULTIMATE.start_student_version_~m#1| (+ (* |ULTIMATE.start_student_version_~a#1| 3) |ULTIMATE.start_student_version_~l~1#1|))} is VALID [2022-02-20 17:09:35,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {10906#(<= |ULTIMATE.start_student_version_~m#1| (+ (* |ULTIMATE.start_student_version_~a#1| 3) |ULTIMATE.start_student_version_~l~1#1|))} is VALID [2022-02-20 17:09:35,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} correct_version_#res#1 := correct_version_~y~0#1; {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:35,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:35,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:35,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:35,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {10931#(or (<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~m#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {10770#(<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:35,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {10935#(or (<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|)) (< (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {10931#(or (<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:35,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {10939#(or (< (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|) |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|)))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {10935#(or (<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|)) (< (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|))} is VALID [2022-02-20 17:09:35,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {10943#(or (< (+ |ULTIMATE.start_correct_version_~l~0#1| (* 3 |ULTIMATE.start_correct_version_~a#1|)) |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|)))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {10939#(or (< (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|) |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:09:35,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {10943#(or (< (+ |ULTIMATE.start_correct_version_~l~0#1| (* 3 |ULTIMATE.start_correct_version_~a#1|)) |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|)))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {10943#(or (< (+ |ULTIMATE.start_correct_version_~l~0#1| (* 3 |ULTIMATE.start_correct_version_~a#1|)) |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:09:35,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {10943#(or (< (+ |ULTIMATE.start_correct_version_~l~0#1| (* 3 |ULTIMATE.start_correct_version_~a#1|)) |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|)))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {10943#(or (< (+ |ULTIMATE.start_correct_version_~l~0#1| (* 3 |ULTIMATE.start_correct_version_~a#1|)) |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:09:35,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {10764#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {10943#(or (< (+ |ULTIMATE.start_correct_version_~l~0#1| (* 3 |ULTIMATE.start_correct_version_~a#1|)) |ULTIMATE.start_correct_version_~m#1|) (<= |ULTIMATE.start_main_~m~0#1| (* 3 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:09:35,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {10764#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {10764#true} is VALID [2022-02-20 17:09:35,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {10764#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10764#true} is VALID [2022-02-20 17:09:35,346 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:35,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260264339] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:35,346 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:35,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-02-20 17:09:35,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017191340] [2022-02-20 17:09:35,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:35,347 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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 29 [2022-02-20 17:09:35,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:35,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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-20 17:09:35,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:35,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 17:09:35,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:35,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 17:09:35,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2022-02-20 17:09:35,387 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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-20 17:09:37,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:37,486 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2022-02-20 17:09:37,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 17:09:37,487 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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 29 [2022-02-20 17:09:37,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:37,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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-20 17:09:37,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 96 transitions. [2022-02-20 17:09:37,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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-20 17:09:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 96 transitions. [2022-02-20 17:09:37,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 96 transitions. [2022-02-20 17:09:37,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:37,561 INFO L225 Difference]: With dead ends: 155 [2022-02-20 17:09:37,561 INFO L226 Difference]: Without dead ends: 129 [2022-02-20 17:09:37,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=363, Invalid=1277, Unknown=0, NotChecked=0, Total=1640 [2022-02-20 17:09:37,562 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 405 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:37,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 476 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:09:37,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-20 17:09:38,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 94. [2022-02-20 17:09:38,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:38,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 94 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 93 states have internal predecessors, (113), 0 states have call successors, (0), 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-20 17:09:38,126 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 94 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 93 states have internal predecessors, (113), 0 states have call successors, (0), 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-20 17:09:38,126 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 94 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 93 states have internal predecessors, (113), 0 states have call successors, (0), 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-20 17:09:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:38,127 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2022-02-20 17:09:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2022-02-20 17:09:38,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:38,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:38,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 93 states have internal predecessors, (113), 0 states have call successors, (0), 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 129 states. [2022-02-20 17:09:38,128 INFO L87 Difference]: Start difference. First operand has 94 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 93 states have internal predecessors, (113), 0 states have call successors, (0), 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 129 states. [2022-02-20 17:09:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:38,130 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2022-02-20 17:09:38,130 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2022-02-20 17:09:38,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:38,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:38,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:38,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 93 states have internal predecessors, (113), 0 states have call successors, (0), 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-20 17:09:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2022-02-20 17:09:38,131 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 29 [2022-02-20 17:09:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:38,132 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2022-02-20 17:09:38,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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-20 17:09:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-02-20 17:09:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:09:38,132 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:38,132 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:38,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:38,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:38,345 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:38,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:38,345 INFO L85 PathProgramCache]: Analyzing trace with hash 138479735, now seen corresponding path program 16 times [2022-02-20 17:09:38,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:38,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451063288] [2022-02-20 17:09:38,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:38,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:38,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {11618#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {11618#true} is VALID [2022-02-20 17:09:38,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {11618#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {11618#true} is VALID [2022-02-20 17:09:38,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {11618#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {11620#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:38,452 INFO L290 TraceCheckUtils]: 3: Hoare triple {11620#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {11620#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:38,453 INFO L290 TraceCheckUtils]: 4: Hoare triple {11620#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {11620#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:38,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {11620#(and (= |ULTIMATE.start_correct_version_~l~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {11621#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= (+ |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~m#1|) (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|)))} is VALID [2022-02-20 17:09:38,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {11621#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= (+ |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~m#1|) (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|)))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {11622#(and (<= (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|) (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:38,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {11622#(and (<= (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|) (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {11623#(and (<= (+ (* 3 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|) (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:38,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {11623#(and (<= (+ (* 3 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~m#1|) (+ |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_correct_version_~l~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:38,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:38,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:38,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:38,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:38,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:38,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {11625#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= (+ (* |ULTIMATE.start_student_version_~a#1| 3) 1) |ULTIMATE.start_student_version_~m#1|))} is VALID [2022-02-20 17:09:38,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {11625#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= (+ (* |ULTIMATE.start_student_version_~a#1| 3) 1) |ULTIMATE.start_student_version_~m#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {11625#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= (+ (* |ULTIMATE.start_student_version_~a#1| 3) 1) |ULTIMATE.start_student_version_~m#1|))} is VALID [2022-02-20 17:09:38,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {11625#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= (+ (* |ULTIMATE.start_student_version_~a#1| 3) 1) |ULTIMATE.start_student_version_~m#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {11625#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= (+ (* |ULTIMATE.start_student_version_~a#1| 3) 1) |ULTIMATE.start_student_version_~m#1|))} is VALID [2022-02-20 17:09:38,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {11625#(and (= |ULTIMATE.start_student_version_~l~1#1| 0) (<= (+ (* |ULTIMATE.start_student_version_~a#1| 3) 1) |ULTIMATE.start_student_version_~m#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {11626#(<= (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2) 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:38,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {11626#(<= (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2) 1) |ULTIMATE.start_student_version_~m#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {11627#(<= (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:38,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {11627#(<= (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {11628#(<= (+ |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:38,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {11628#(<= (+ |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !(student_version_~l~1#1 < student_version_~m#1); {11619#false} is VALID [2022-02-20 17:09:38,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {11619#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {11619#false} is VALID [2022-02-20 17:09:38,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {11619#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {11619#false} is VALID [2022-02-20 17:09:38,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {11619#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {11619#false} is VALID [2022-02-20 17:09:38,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {11619#false} student_version_#res#1 := student_version_~y~1#1; {11619#false} is VALID [2022-02-20 17:09:38,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {11619#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {11619#false} is VALID [2022-02-20 17:09:38,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {11619#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {11619#false} is VALID [2022-02-20 17:09:38,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {11619#false} assume 0 == __VERIFIER_assert_~cond#1; {11619#false} is VALID [2022-02-20 17:09:38,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {11619#false} assume !false; {11619#false} is VALID [2022-02-20 17:09:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:38,460 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:38,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451063288] [2022-02-20 17:09:38,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451063288] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:38,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366223280] [2022-02-20 17:09:38,460 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:09:38,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:38,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:38,462 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:38,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-20 17:09:38,504 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:09:38,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:38,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 17:09:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:38,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:39,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {11618#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {11618#true} is VALID [2022-02-20 17:09:39,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {11618#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {11618#true} is VALID [2022-02-20 17:09:39,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {11618#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {11638#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:39,247 INFO L290 TraceCheckUtils]: 3: Hoare triple {11638#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {11638#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:39,247 INFO L290 TraceCheckUtils]: 4: Hoare triple {11638#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {11638#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:39,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {11638#(and (<= 0 |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {11648#(and (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:39,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {11648#(and (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {11652#(and (<= (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:39,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {11652#(and (<= (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {11656#(and (<= |ULTIMATE.start_main_~a~0#1| (div |ULTIMATE.start_correct_version_~l~0#1| 3)) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:39,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {11656#(and (<= |ULTIMATE.start_main_~a~0#1| (div |ULTIMATE.start_correct_version_~l~0#1| 3)) (<= |ULTIMATE.start_correct_version_~m#1| |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:39,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:39,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:39,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:39,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:39,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:39,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {11678#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 3)))} is VALID [2022-02-20 17:09:39,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {11678#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 3)))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {11678#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 3)))} is VALID [2022-02-20 17:09:39,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {11678#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 3)))} assume !(student_version_~b~1#1 < student_version_~n#1); {11678#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 3)))} is VALID [2022-02-20 17:09:39,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {11678#(and (<= |ULTIMATE.start_student_version_~l~1#1| 0) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 3)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {11688#(and (<= |ULTIMATE.start_student_version_~l~1#1| |ULTIMATE.start_student_version_~a#1|) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 3)))} is VALID [2022-02-20 17:09:39,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {11688#(and (<= |ULTIMATE.start_student_version_~l~1#1| |ULTIMATE.start_student_version_~a#1|) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 3)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {11692#(and (<= |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2)) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 3)))} is VALID [2022-02-20 17:09:39,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {11692#(and (<= |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2)) (<= |ULTIMATE.start_student_version_~a#1| (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 3)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {11696#(<= (div (- |ULTIMATE.start_student_version_~l~1#1|) (- 3)) (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 3))} is VALID [2022-02-20 17:09:39,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {11696#(<= (div (- |ULTIMATE.start_student_version_~l~1#1|) (- 3)) (div (+ |ULTIMATE.start_student_version_~m#1| (- 1)) 3))} assume !(student_version_~l~1#1 < student_version_~m#1); {11619#false} is VALID [2022-02-20 17:09:39,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {11619#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {11619#false} is VALID [2022-02-20 17:09:39,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {11619#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {11619#false} is VALID [2022-02-20 17:09:39,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {11619#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {11619#false} is VALID [2022-02-20 17:09:39,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {11619#false} student_version_#res#1 := student_version_~y~1#1; {11619#false} is VALID [2022-02-20 17:09:39,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {11619#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {11619#false} is VALID [2022-02-20 17:09:39,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {11619#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {11619#false} is VALID [2022-02-20 17:09:39,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {11619#false} assume 0 == __VERIFIER_assert_~cond#1; {11619#false} is VALID [2022-02-20 17:09:39,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {11619#false} assume !false; {11619#false} is VALID [2022-02-20 17:09:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:39,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:39,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {11619#false} assume !false; {11619#false} is VALID [2022-02-20 17:09:39,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {11619#false} assume 0 == __VERIFIER_assert_~cond#1; {11619#false} is VALID [2022-02-20 17:09:39,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {11619#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {11619#false} is VALID [2022-02-20 17:09:39,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {11619#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {11619#false} is VALID [2022-02-20 17:09:39,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {11619#false} student_version_#res#1 := student_version_~y~1#1; {11619#false} is VALID [2022-02-20 17:09:39,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {11619#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {11619#false} is VALID [2022-02-20 17:09:39,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {11619#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {11619#false} is VALID [2022-02-20 17:09:39,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {11619#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {11619#false} is VALID [2022-02-20 17:09:39,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {11628#(<= (+ |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !(student_version_~l~1#1 < student_version_~m#1); {11619#false} is VALID [2022-02-20 17:09:39,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {11627#(<= (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {11628#(<= (+ |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:39,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {11626#(<= (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2) 1) |ULTIMATE.start_student_version_~m#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {11627#(<= (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:39,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {11757#(<= (+ (* |ULTIMATE.start_student_version_~a#1| 3) |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {11626#(<= (+ |ULTIMATE.start_student_version_~l~1#1| (* |ULTIMATE.start_student_version_~a#1| 2) 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:39,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {11757#(<= (+ (* |ULTIMATE.start_student_version_~a#1| 3) |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !(student_version_~b~1#1 < student_version_~n#1); {11757#(<= (+ (* |ULTIMATE.start_student_version_~a#1| 3) |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:39,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {11757#(<= (+ (* |ULTIMATE.start_student_version_~a#1| 3) |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {11757#(<= (+ (* |ULTIMATE.start_student_version_~a#1| 3) |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:39,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {11757#(<= (+ (* |ULTIMATE.start_student_version_~a#1| 3) |ULTIMATE.start_student_version_~l~1#1| 1) |ULTIMATE.start_student_version_~m#1|)} is VALID [2022-02-20 17:09:39,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} correct_version_#res#1 := correct_version_~y~0#1; {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:39,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:39,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:39,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:39,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:39,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {11785#(or (<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|) (not (< |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~m#1|)))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {11624#(<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 17:09:39,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {11789#(or (<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|) (<= |ULTIMATE.start_correct_version_~m#1| (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|)))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {11785#(or (<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|) (not (< |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~m#1|)))} is VALID [2022-02-20 17:09:39,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {11793#(or (<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|) (<= |ULTIMATE.start_correct_version_~m#1| (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|)))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {11789#(or (<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|) (<= |ULTIMATE.start_correct_version_~m#1| (+ |ULTIMATE.start_correct_version_~l~0#1| |ULTIMATE.start_correct_version_~a#1|)))} is VALID [2022-02-20 17:09:39,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {11797#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ |ULTIMATE.start_correct_version_~l~0#1| (* 3 |ULTIMATE.start_correct_version_~a#1|))) (<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {11793#(or (<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|) (<= |ULTIMATE.start_correct_version_~m#1| (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~l~0#1|)))} is VALID [2022-02-20 17:09:39,695 INFO L290 TraceCheckUtils]: 4: Hoare triple {11797#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ |ULTIMATE.start_correct_version_~l~0#1| (* 3 |ULTIMATE.start_correct_version_~a#1|))) (<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {11797#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ |ULTIMATE.start_correct_version_~l~0#1| (* 3 |ULTIMATE.start_correct_version_~a#1|))) (<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:39,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {11797#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ |ULTIMATE.start_correct_version_~l~0#1| (* 3 |ULTIMATE.start_correct_version_~a#1|))) (<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {11797#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ |ULTIMATE.start_correct_version_~l~0#1| (* 3 |ULTIMATE.start_correct_version_~a#1|))) (<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:39,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {11618#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {11797#(or (<= |ULTIMATE.start_correct_version_~m#1| (+ |ULTIMATE.start_correct_version_~l~0#1| (* 3 |ULTIMATE.start_correct_version_~a#1|))) (<= (+ (* 3 |ULTIMATE.start_main_~a~0#1|) 1) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 17:09:39,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {11618#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {11618#true} is VALID [2022-02-20 17:09:39,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {11618#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {11618#true} is VALID [2022-02-20 17:09:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:09:39,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366223280] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:39,697 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:39,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-02-20 17:09:39,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919227948] [2022-02-20 17:09:39,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:39,698 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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 29 [2022-02-20 17:09:39,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:39,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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-20 17:09:39,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:39,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 17:09:39,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:39,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 17:09:39,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-02-20 17:09:39,736 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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-20 17:09:41,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:41,752 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2022-02-20 17:09:41,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:09:41,752 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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 29 [2022-02-20 17:09:41,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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-20 17:09:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 95 transitions. [2022-02-20 17:09:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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-20 17:09:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 95 transitions. [2022-02-20 17:09:41,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 95 transitions. [2022-02-20 17:09:41,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:41,828 INFO L225 Difference]: With dead ends: 144 [2022-02-20 17:09:41,828 INFO L226 Difference]: Without dead ends: 131 [2022-02-20 17:09:41,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2022-02-20 17:09:41,829 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 350 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:41,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 762 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:09:41,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-02-20 17:09:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 96. [2022-02-20 17:09:42,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:42,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 96 states, 95 states have (on average 1.2105263157894737) internal successors, (115), 95 states have internal predecessors, (115), 0 states have call successors, (0), 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-20 17:09:42,489 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 96 states, 95 states have (on average 1.2105263157894737) internal successors, (115), 95 states have internal predecessors, (115), 0 states have call successors, (0), 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-20 17:09:42,489 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 96 states, 95 states have (on average 1.2105263157894737) internal successors, (115), 95 states have internal predecessors, (115), 0 states have call successors, (0), 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-20 17:09:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:42,490 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2022-02-20 17:09:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 150 transitions. [2022-02-20 17:09:42,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:42,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:42,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 95 states have (on average 1.2105263157894737) internal successors, (115), 95 states have internal predecessors, (115), 0 states have call successors, (0), 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 131 states. [2022-02-20 17:09:42,491 INFO L87 Difference]: Start difference. First operand has 96 states, 95 states have (on average 1.2105263157894737) internal successors, (115), 95 states have internal predecessors, (115), 0 states have call successors, (0), 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 131 states. [2022-02-20 17:09:42,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:42,492 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2022-02-20 17:09:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 150 transitions. [2022-02-20 17:09:42,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:42,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:42,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:42,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.2105263157894737) internal successors, (115), 95 states have internal predecessors, (115), 0 states have call successors, (0), 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-20 17:09:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2022-02-20 17:09:42,494 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 29 [2022-02-20 17:09:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:42,494 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2022-02-20 17:09:42,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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-20 17:09:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2022-02-20 17:09:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:09:42,495 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:42,495 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:42,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:42,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:42,699 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:42,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:42,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2086280437, now seen corresponding path program 17 times [2022-02-20 17:09:42,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:42,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191244892] [2022-02-20 17:09:42,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:42,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:42,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {12446#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {12446#true} is VALID [2022-02-20 17:09:42,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {12446#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {12446#true} is VALID [2022-02-20 17:09:42,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {12446#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {12446#true} is VALID [2022-02-20 17:09:42,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {12446#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {12446#true} is VALID [2022-02-20 17:09:42,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {12446#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {12446#true} is VALID [2022-02-20 17:09:42,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {12446#true} assume !(correct_version_~b~0#1 < correct_version_~n#1); {12446#true} is VALID [2022-02-20 17:09:42,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {12446#true} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {12446#true} is VALID [2022-02-20 17:09:42,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {12446#true} assume !(correct_version_~l~0#1 < correct_version_~m#1); {12446#true} is VALID [2022-02-20 17:09:42,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {12446#true} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {12446#true} is VALID [2022-02-20 17:09:42,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {12446#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {12446#true} is VALID [2022-02-20 17:09:42,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {12446#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {12446#true} is VALID [2022-02-20 17:09:42,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {12446#true} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {12446#true} is VALID [2022-02-20 17:09:42,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {12446#true} correct_version_#res#1 := correct_version_~y~0#1; {12446#true} is VALID [2022-02-20 17:09:42,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {12446#true} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {12448#(= |ULTIMATE.start_student_version_~i~1#1| 0)} is VALID [2022-02-20 17:09:42,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {12448#(= |ULTIMATE.start_student_version_~i~1#1| 0)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {12449#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} is VALID [2022-02-20 17:09:42,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {12449#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} is VALID [2022-02-20 17:09:42,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} assume !(student_version_~b~1#1 < student_version_~n#1); {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} is VALID [2022-02-20 17:09:42,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} is VALID [2022-02-20 17:09:42,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} assume !(student_version_~l~1#1 < student_version_~m#1); {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} is VALID [2022-02-20 17:09:42,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {12451#(and (<= |ULTIMATE.start_student_version_~i~1#1| 2) (= |ULTIMATE.start_student_version_~x~1#1| 0))} is VALID [2022-02-20 17:09:42,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {12451#(and (<= |ULTIMATE.start_student_version_~i~1#1| 2) (= |ULTIMATE.start_student_version_~x~1#1| 0))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {12452#(<= |ULTIMATE.start_student_version_~i~1#1| (+ |ULTIMATE.start_student_version_~x~1#1| 1))} is VALID [2022-02-20 17:09:42,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {12452#(<= |ULTIMATE.start_student_version_~i~1#1| (+ |ULTIMATE.start_student_version_~x~1#1| 1))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {12453#(<= |ULTIMATE.start_student_version_~i~1#1| |ULTIMATE.start_student_version_~x~1#1|)} is VALID [2022-02-20 17:09:42,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {12453#(<= |ULTIMATE.start_student_version_~i~1#1| |ULTIMATE.start_student_version_~x~1#1|)} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {12447#false} is VALID [2022-02-20 17:09:42,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {12447#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {12447#false} is VALID [2022-02-20 17:09:42,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {12447#false} student_version_#res#1 := student_version_~y~1#1; {12447#false} is VALID [2022-02-20 17:09:42,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {12447#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {12447#false} is VALID [2022-02-20 17:09:42,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {12447#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {12447#false} is VALID [2022-02-20 17:09:42,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {12447#false} assume 0 == __VERIFIER_assert_~cond#1; {12447#false} is VALID [2022-02-20 17:09:42,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {12447#false} assume !false; {12447#false} is VALID [2022-02-20 17:09:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 17:09:42,756 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:42,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191244892] [2022-02-20 17:09:42,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191244892] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:42,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542746780] [2022-02-20 17:09:42,756 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:09:42,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:42,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:42,757 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:42,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-02-20 17:09:42,803 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-20 17:09:42,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:42,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:09:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:42,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:42,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {12446#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {12446#true} is VALID [2022-02-20 17:09:42,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {12446#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {12446#true} is VALID [2022-02-20 17:09:42,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {12446#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {12446#true} is VALID [2022-02-20 17:09:42,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {12446#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {12446#true} is VALID [2022-02-20 17:09:42,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {12446#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {12446#true} is VALID [2022-02-20 17:09:42,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {12446#true} assume !(correct_version_~b~0#1 < correct_version_~n#1); {12446#true} is VALID [2022-02-20 17:09:42,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {12446#true} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {12446#true} is VALID [2022-02-20 17:09:42,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {12446#true} assume !(correct_version_~l~0#1 < correct_version_~m#1); {12446#true} is VALID [2022-02-20 17:09:42,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {12446#true} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {12446#true} is VALID [2022-02-20 17:09:42,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {12446#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {12446#true} is VALID [2022-02-20 17:09:42,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {12446#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {12446#true} is VALID [2022-02-20 17:09:42,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {12446#true} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {12446#true} is VALID [2022-02-20 17:09:42,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {12446#true} correct_version_#res#1 := correct_version_~y~0#1; {12446#true} is VALID [2022-02-20 17:09:42,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {12446#true} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {12496#(<= |ULTIMATE.start_student_version_~i~1#1| 0)} is VALID [2022-02-20 17:09:42,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {12496#(<= |ULTIMATE.start_student_version_~i~1#1| 0)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {12449#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} is VALID [2022-02-20 17:09:42,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {12449#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} is VALID [2022-02-20 17:09:42,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} assume !(student_version_~b~1#1 < student_version_~n#1); {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} is VALID [2022-02-20 17:09:42,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} is VALID [2022-02-20 17:09:42,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} assume !(student_version_~l~1#1 < student_version_~m#1); {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} is VALID [2022-02-20 17:09:42,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {12515#(and (<= |ULTIMATE.start_student_version_~i~1#1| 2) (<= 0 |ULTIMATE.start_student_version_~x~1#1|))} is VALID [2022-02-20 17:09:42,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {12515#(and (<= |ULTIMATE.start_student_version_~i~1#1| 2) (<= 0 |ULTIMATE.start_student_version_~x~1#1|))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {12519#(and (<= |ULTIMATE.start_student_version_~i~1#1| 2) (<= 1 |ULTIMATE.start_student_version_~x~1#1|))} is VALID [2022-02-20 17:09:42,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {12519#(and (<= |ULTIMATE.start_student_version_~i~1#1| 2) (<= 1 |ULTIMATE.start_student_version_~x~1#1|))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {12523#(and (<= |ULTIMATE.start_student_version_~i~1#1| 2) (<= 2 |ULTIMATE.start_student_version_~x~1#1|))} is VALID [2022-02-20 17:09:42,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {12523#(and (<= |ULTIMATE.start_student_version_~i~1#1| 2) (<= 2 |ULTIMATE.start_student_version_~x~1#1|))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {12447#false} is VALID [2022-02-20 17:09:42,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {12447#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {12447#false} is VALID [2022-02-20 17:09:42,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {12447#false} student_version_#res#1 := student_version_~y~1#1; {12447#false} is VALID [2022-02-20 17:09:42,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {12447#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {12447#false} is VALID [2022-02-20 17:09:42,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {12447#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {12447#false} is VALID [2022-02-20 17:09:42,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {12447#false} assume 0 == __VERIFIER_assert_~cond#1; {12447#false} is VALID [2022-02-20 17:09:42,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {12447#false} assume !false; {12447#false} is VALID [2022-02-20 17:09:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 17:09:42,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:43,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {12447#false} assume !false; {12447#false} is VALID [2022-02-20 17:09:43,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {12447#false} assume 0 == __VERIFIER_assert_~cond#1; {12447#false} is VALID [2022-02-20 17:09:43,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {12447#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {12447#false} is VALID [2022-02-20 17:09:43,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {12447#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {12447#false} is VALID [2022-02-20 17:09:43,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {12447#false} student_version_#res#1 := student_version_~y~1#1; {12447#false} is VALID [2022-02-20 17:09:43,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {12447#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {12447#false} is VALID [2022-02-20 17:09:43,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {12453#(<= |ULTIMATE.start_student_version_~i~1#1| |ULTIMATE.start_student_version_~x~1#1|)} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {12447#false} is VALID [2022-02-20 17:09:43,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {12452#(<= |ULTIMATE.start_student_version_~i~1#1| (+ |ULTIMATE.start_student_version_~x~1#1| 1))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {12453#(<= |ULTIMATE.start_student_version_~i~1#1| |ULTIMATE.start_student_version_~x~1#1|)} is VALID [2022-02-20 17:09:43,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {12569#(<= |ULTIMATE.start_student_version_~i~1#1| (+ |ULTIMATE.start_student_version_~x~1#1| 2))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {12452#(<= |ULTIMATE.start_student_version_~i~1#1| (+ |ULTIMATE.start_student_version_~x~1#1| 1))} is VALID [2022-02-20 17:09:43,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {12569#(<= |ULTIMATE.start_student_version_~i~1#1| (+ |ULTIMATE.start_student_version_~x~1#1| 2))} is VALID [2022-02-20 17:09:43,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} assume !(student_version_~l~1#1 < student_version_~m#1); {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} is VALID [2022-02-20 17:09:43,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} is VALID [2022-02-20 17:09:43,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} assume !(student_version_~b~1#1 < student_version_~n#1); {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} is VALID [2022-02-20 17:09:43,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {12449#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {12450#(<= |ULTIMATE.start_student_version_~i~1#1| 2)} is VALID [2022-02-20 17:09:43,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {12496#(<= |ULTIMATE.start_student_version_~i~1#1| 0)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {12449#(<= |ULTIMATE.start_student_version_~i~1#1| 1)} is VALID [2022-02-20 17:09:43,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {12446#true} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {12496#(<= |ULTIMATE.start_student_version_~i~1#1| 0)} is VALID [2022-02-20 17:09:43,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {12446#true} correct_version_#res#1 := correct_version_~y~0#1; {12446#true} is VALID [2022-02-20 17:09:43,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {12446#true} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {12446#true} is VALID [2022-02-20 17:09:43,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {12446#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {12446#true} is VALID [2022-02-20 17:09:43,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {12446#true} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {12446#true} is VALID [2022-02-20 17:09:43,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {12446#true} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {12446#true} is VALID [2022-02-20 17:09:43,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {12446#true} assume !(correct_version_~l~0#1 < correct_version_~m#1); {12446#true} is VALID [2022-02-20 17:09:43,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {12446#true} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {12446#true} is VALID [2022-02-20 17:09:43,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {12446#true} assume !(correct_version_~b~0#1 < correct_version_~n#1); {12446#true} is VALID [2022-02-20 17:09:43,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {12446#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {12446#true} is VALID [2022-02-20 17:09:43,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {12446#true} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {12446#true} is VALID [2022-02-20 17:09:43,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {12446#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {12446#true} is VALID [2022-02-20 17:09:43,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {12446#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {12446#true} is VALID [2022-02-20 17:09:43,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {12446#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {12446#true} is VALID [2022-02-20 17:09:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 17:09:43,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542746780] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:43,027 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:43,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-02-20 17:09:43,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511469194] [2022-02-20 17:09:43,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:43,028 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 17:09:43,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:43,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:43,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:43,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:09:43,047 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:43,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:09:43,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:09:43,048 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:44,068 INFO L93 Difference]: Finished difference Result 139 states and 163 transitions. [2022-02-20 17:09:44,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 17:09:44,068 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 17:09:44,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-02-20 17:09:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-02-20 17:09:44,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-02-20 17:09:44,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:44,110 INFO L225 Difference]: With dead ends: 139 [2022-02-20 17:09:44,110 INFO L226 Difference]: Without dead ends: 126 [2022-02-20 17:09:44,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:09:44,111 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 69 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:44,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 120 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-20 17:09:44,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112. [2022-02-20 17:09:44,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:44,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 112 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 111 states have internal predecessors, (136), 0 states have call successors, (0), 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-20 17:09:44,841 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 112 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 111 states have internal predecessors, (136), 0 states have call successors, (0), 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-20 17:09:44,841 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 112 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 111 states have internal predecessors, (136), 0 states have call successors, (0), 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-20 17:09:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:44,842 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2022-02-20 17:09:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 148 transitions. [2022-02-20 17:09:44,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:44,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:44,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 111 states have internal predecessors, (136), 0 states have call successors, (0), 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 126 states. [2022-02-20 17:09:44,843 INFO L87 Difference]: Start difference. First operand has 112 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 111 states have internal predecessors, (136), 0 states have call successors, (0), 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 126 states. [2022-02-20 17:09:44,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:44,844 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2022-02-20 17:09:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 148 transitions. [2022-02-20 17:09:44,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:44,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:44,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:44,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:44,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 111 states have internal predecessors, (136), 0 states have call successors, (0), 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-20 17:09:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2022-02-20 17:09:44,845 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 29 [2022-02-20 17:09:44,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:44,845 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2022-02-20 17:09:44,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:44,845 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2022-02-20 17:09:44,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:09:44,846 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:44,846 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:44,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:45,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-02-20 17:09:45,046 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash -397298668, now seen corresponding path program 18 times [2022-02-20 17:09:45,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:45,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770186926] [2022-02-20 17:09:45,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:45,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:45,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {13253#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {13253#true} is VALID [2022-02-20 17:09:45,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {13253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {13253#true} is VALID [2022-02-20 17:09:45,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {13253#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {13255#(= |ULTIMATE.start_correct_version_~i~0#1| 0)} is VALID [2022-02-20 17:09:45,114 INFO L290 TraceCheckUtils]: 3: Hoare triple {13255#(= |ULTIMATE.start_correct_version_~i~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {13256#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} is VALID [2022-02-20 17:09:45,114 INFO L290 TraceCheckUtils]: 4: Hoare triple {13256#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} is VALID [2022-02-20 17:09:45,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} is VALID [2022-02-20 17:09:45,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} is VALID [2022-02-20 17:09:45,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} is VALID [2022-02-20 17:09:45,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {13258#(and (<= |ULTIMATE.start_correct_version_~i~0#1| 2) (= |ULTIMATE.start_correct_version_~x~0#1| 0))} is VALID [2022-02-20 17:09:45,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {13258#(and (<= |ULTIMATE.start_correct_version_~i~0#1| 2) (= |ULTIMATE.start_correct_version_~x~0#1| 0))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {13259#(<= |ULTIMATE.start_correct_version_~i~0#1| (+ |ULTIMATE.start_correct_version_~x~0#1| 1))} is VALID [2022-02-20 17:09:45,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {13259#(<= |ULTIMATE.start_correct_version_~i~0#1| (+ |ULTIMATE.start_correct_version_~x~0#1| 1))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {13260#(<= |ULTIMATE.start_correct_version_~i~0#1| |ULTIMATE.start_correct_version_~x~0#1|)} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {13260#(<= |ULTIMATE.start_correct_version_~i~0#1| |ULTIMATE.start_correct_version_~x~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {13254#false} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {13254#false} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {13254#false} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {13254#false} correct_version_#res#1 := correct_version_~y~0#1; {13254#false} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {13254#false} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {13254#false} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {13254#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {13254#false} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {13254#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {13254#false} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {13254#false} assume !(student_version_~b~1#1 < student_version_~n#1); {13254#false} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {13254#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {13254#false} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {13254#false} assume !(student_version_~l~1#1 < student_version_~m#1); {13254#false} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {13254#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {13254#false} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {13254#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {13254#false} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {13254#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {13254#false} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {13254#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {13254#false} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {13254#false} student_version_#res#1 := student_version_~y~1#1; {13254#false} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {13254#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {13254#false} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {13254#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {13254#false} is VALID [2022-02-20 17:09:45,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {13254#false} assume 0 == __VERIFIER_assert_~cond#1; {13254#false} is VALID [2022-02-20 17:09:45,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {13254#false} assume !false; {13254#false} is VALID [2022-02-20 17:09:45,118 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 17:09:45,118 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:45,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770186926] [2022-02-20 17:09:45,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770186926] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:45,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095837452] [2022-02-20 17:09:45,118 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 17:09:45,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:45,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:45,119 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:45,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-02-20 17:09:45,160 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-20 17:09:45,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:45,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:09:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:45,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:45,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {13253#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {13253#true} is VALID [2022-02-20 17:09:45,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {13253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {13253#true} is VALID [2022-02-20 17:09:45,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {13253#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {13270#(<= |ULTIMATE.start_correct_version_~i~0#1| 0)} is VALID [2022-02-20 17:09:45,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {13270#(<= |ULTIMATE.start_correct_version_~i~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {13256#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} is VALID [2022-02-20 17:09:45,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {13256#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} is VALID [2022-02-20 17:09:45,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} is VALID [2022-02-20 17:09:45,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} is VALID [2022-02-20 17:09:45,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} is VALID [2022-02-20 17:09:45,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {13289#(and (<= |ULTIMATE.start_correct_version_~i~0#1| 2) (<= 0 |ULTIMATE.start_correct_version_~x~0#1|))} is VALID [2022-02-20 17:09:45,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {13289#(and (<= |ULTIMATE.start_correct_version_~i~0#1| 2) (<= 0 |ULTIMATE.start_correct_version_~x~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {13293#(and (<= |ULTIMATE.start_correct_version_~i~0#1| 2) (<= 1 |ULTIMATE.start_correct_version_~x~0#1|))} is VALID [2022-02-20 17:09:45,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {13293#(and (<= |ULTIMATE.start_correct_version_~i~0#1| 2) (<= 1 |ULTIMATE.start_correct_version_~x~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {13297#(and (<= |ULTIMATE.start_correct_version_~i~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~x~0#1|))} is VALID [2022-02-20 17:09:45,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {13297#(and (<= |ULTIMATE.start_correct_version_~i~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~x~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {13254#false} is VALID [2022-02-20 17:09:45,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {13254#false} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {13254#false} is VALID [2022-02-20 17:09:45,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {13254#false} correct_version_#res#1 := correct_version_~y~0#1; {13254#false} is VALID [2022-02-20 17:09:45,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {13254#false} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {13254#false} is VALID [2022-02-20 17:09:45,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {13254#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {13254#false} is VALID [2022-02-20 17:09:45,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {13254#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {13254#false} is VALID [2022-02-20 17:09:45,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {13254#false} assume !(student_version_~b~1#1 < student_version_~n#1); {13254#false} is VALID [2022-02-20 17:09:45,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {13254#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {13254#false} is VALID [2022-02-20 17:09:45,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {13254#false} assume !(student_version_~l~1#1 < student_version_~m#1); {13254#false} is VALID [2022-02-20 17:09:45,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {13254#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {13254#false} is VALID [2022-02-20 17:09:45,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {13254#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {13254#false} is VALID [2022-02-20 17:09:45,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {13254#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {13254#false} is VALID [2022-02-20 17:09:45,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {13254#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {13254#false} is VALID [2022-02-20 17:09:45,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {13254#false} student_version_#res#1 := student_version_~y~1#1; {13254#false} is VALID [2022-02-20 17:09:45,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {13254#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {13254#false} is VALID [2022-02-20 17:09:45,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {13254#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {13254#false} is VALID [2022-02-20 17:09:45,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {13254#false} assume 0 == __VERIFIER_assert_~cond#1; {13254#false} is VALID [2022-02-20 17:09:45,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {13254#false} assume !false; {13254#false} is VALID [2022-02-20 17:09:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 17:09:45,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:45,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {13254#false} assume !false; {13254#false} is VALID [2022-02-20 17:09:45,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {13254#false} assume 0 == __VERIFIER_assert_~cond#1; {13254#false} is VALID [2022-02-20 17:09:45,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {13254#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {13254#false} is VALID [2022-02-20 17:09:45,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {13254#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {13254#false} is VALID [2022-02-20 17:09:45,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {13254#false} student_version_#res#1 := student_version_~y~1#1; {13254#false} is VALID [2022-02-20 17:09:45,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {13254#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {13254#false} is VALID [2022-02-20 17:09:45,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {13254#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {13254#false} is VALID [2022-02-20 17:09:45,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {13254#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {13254#false} is VALID [2022-02-20 17:09:45,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {13254#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {13254#false} is VALID [2022-02-20 17:09:45,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {13254#false} assume !(student_version_~l~1#1 < student_version_~m#1); {13254#false} is VALID [2022-02-20 17:09:45,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {13254#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {13254#false} is VALID [2022-02-20 17:09:45,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {13254#false} assume !(student_version_~b~1#1 < student_version_~n#1); {13254#false} is VALID [2022-02-20 17:09:45,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {13254#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {13254#false} is VALID [2022-02-20 17:09:45,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {13254#false} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {13254#false} is VALID [2022-02-20 17:09:45,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {13254#false} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {13254#false} is VALID [2022-02-20 17:09:45,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {13254#false} correct_version_#res#1 := correct_version_~y~0#1; {13254#false} is VALID [2022-02-20 17:09:45,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {13254#false} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {13254#false} is VALID [2022-02-20 17:09:45,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {13260#(<= |ULTIMATE.start_correct_version_~i~0#1| |ULTIMATE.start_correct_version_~x~0#1|)} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {13254#false} is VALID [2022-02-20 17:09:45,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {13259#(<= |ULTIMATE.start_correct_version_~i~0#1| (+ |ULTIMATE.start_correct_version_~x~0#1| 1))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {13260#(<= |ULTIMATE.start_correct_version_~i~0#1| |ULTIMATE.start_correct_version_~x~0#1|)} is VALID [2022-02-20 17:09:45,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {13409#(<= |ULTIMATE.start_correct_version_~i~0#1| (+ 2 |ULTIMATE.start_correct_version_~x~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {13259#(<= |ULTIMATE.start_correct_version_~i~0#1| (+ |ULTIMATE.start_correct_version_~x~0#1| 1))} is VALID [2022-02-20 17:09:45,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {13409#(<= |ULTIMATE.start_correct_version_~i~0#1| (+ 2 |ULTIMATE.start_correct_version_~x~0#1|))} is VALID [2022-02-20 17:09:45,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} assume !(correct_version_~l~0#1 < correct_version_~m#1); {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} is VALID [2022-02-20 17:09:45,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} is VALID [2022-02-20 17:09:45,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} is VALID [2022-02-20 17:09:45,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {13256#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {13257#(<= |ULTIMATE.start_correct_version_~i~0#1| 2)} is VALID [2022-02-20 17:09:45,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {13270#(<= |ULTIMATE.start_correct_version_~i~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {13256#(<= |ULTIMATE.start_correct_version_~i~0#1| 1)} is VALID [2022-02-20 17:09:45,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {13253#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {13270#(<= |ULTIMATE.start_correct_version_~i~0#1| 0)} is VALID [2022-02-20 17:09:45,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {13253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {13253#true} is VALID [2022-02-20 17:09:45,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {13253#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {13253#true} is VALID [2022-02-20 17:09:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 17:09:45,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095837452] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:45,395 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:45,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-02-20 17:09:45,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341042400] [2022-02-20 17:09:45,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:45,395 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 17:09:45,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:45,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:45,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:45,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:09:45,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:45,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:09:45,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:09:45,414 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:47,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:47,056 INFO L93 Difference]: Finished difference Result 262 states and 317 transitions. [2022-02-20 17:09:47,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 17:09:47,056 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 17:09:47,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:47,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2022-02-20 17:09:47,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2022-02-20 17:09:47,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 85 transitions. [2022-02-20 17:09:47,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:47,125 INFO L225 Difference]: With dead ends: 262 [2022-02-20 17:09:47,125 INFO L226 Difference]: Without dead ends: 202 [2022-02-20 17:09:47,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:09:47,126 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 147 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:47,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 149 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:47,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-02-20 17:09:48,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 134. [2022-02-20 17:09:48,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:48,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand has 134 states, 133 states have (on average 1.2255639097744362) internal successors, (163), 133 states have internal predecessors, (163), 0 states have call successors, (0), 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-20 17:09:48,011 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand has 134 states, 133 states have (on average 1.2255639097744362) internal successors, (163), 133 states have internal predecessors, (163), 0 states have call successors, (0), 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-20 17:09:48,011 INFO L87 Difference]: Start difference. First operand 202 states. Second operand has 134 states, 133 states have (on average 1.2255639097744362) internal successors, (163), 133 states have internal predecessors, (163), 0 states have call successors, (0), 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-20 17:09:48,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:48,014 INFO L93 Difference]: Finished difference Result 202 states and 239 transitions. [2022-02-20 17:09:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 239 transitions. [2022-02-20 17:09:48,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:48,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:48,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 133 states have (on average 1.2255639097744362) internal successors, (163), 133 states have internal predecessors, (163), 0 states have call successors, (0), 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 202 states. [2022-02-20 17:09:48,015 INFO L87 Difference]: Start difference. First operand has 134 states, 133 states have (on average 1.2255639097744362) internal successors, (163), 133 states have internal predecessors, (163), 0 states have call successors, (0), 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 202 states. [2022-02-20 17:09:48,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:48,017 INFO L93 Difference]: Finished difference Result 202 states and 239 transitions. [2022-02-20 17:09:48,017 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 239 transitions. [2022-02-20 17:09:48,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:48,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:48,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:48,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.2255639097744362) internal successors, (163), 133 states have internal predecessors, (163), 0 states have call successors, (0), 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-20 17:09:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 163 transitions. [2022-02-20 17:09:48,020 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 163 transitions. Word has length 29 [2022-02-20 17:09:48,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:48,020 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 163 transitions. [2022-02-20 17:09:48,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 163 transitions. [2022-02-20 17:09:48,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:09:48,021 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:48,021 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:48,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:48,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-02-20 17:09:48,235 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:48,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:48,236 INFO L85 PathProgramCache]: Analyzing trace with hash 660541935, now seen corresponding path program 19 times [2022-02-20 17:09:48,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:48,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473325105] [2022-02-20 17:09:48,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:48,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:48,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {14436#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {14436#true} is VALID [2022-02-20 17:09:48,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {14436#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {14436#true} is VALID [2022-02-20 17:09:48,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {14436#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:48,524 INFO L290 TraceCheckUtils]: 3: Hoare triple {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:48,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:48,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {14439#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:48,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {14439#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {14440#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:48,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {14440#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {14441#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} is VALID [2022-02-20 17:09:48,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {14441#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {14442#(and (<= 4 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 4))} is VALID [2022-02-20 17:09:48,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {14442#(and (<= 4 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 4))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {14442#(and (<= 4 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 4))} is VALID [2022-02-20 17:09:48,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {14442#(and (<= 4 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 4))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {14443#(and (= |ULTIMATE.start_correct_version_~y~0#1| 0) (<= 4 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 4))} is VALID [2022-02-20 17:09:48,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {14443#(and (= |ULTIMATE.start_correct_version_~y~0#1| 0) (<= 4 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 4))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {14444#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} is VALID [2022-02-20 17:09:48,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {14444#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {14444#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} is VALID [2022-02-20 17:09:48,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {14444#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} correct_version_#res#1 := correct_version_~y~0#1; {14445#(and (<= |ULTIMATE.start_correct_version_#res#1| 4) (<= 4 |ULTIMATE.start_correct_version_#res#1|))} is VALID [2022-02-20 17:09:48,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {14445#(and (<= |ULTIMATE.start_correct_version_#res#1| 4) (<= 4 |ULTIMATE.start_correct_version_#res#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {14446#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:09:48,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {14446#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {14446#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:09:48,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {14446#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !(student_version_~b~1#1 < student_version_~n#1); {14446#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:09:48,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {14446#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {14447#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 3) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 3)))} is VALID [2022-02-20 17:09:48,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {14447#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 3) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 3)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {14448#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (+ |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:48,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {14448#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (+ |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {14449#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} is VALID [2022-02-20 17:09:48,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {14449#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {14450#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:48,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {14450#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} assume !(student_version_~l~1#1 < student_version_~m#1); {14450#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:48,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {14450#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {14451#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~y~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:48,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {14451#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~y~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {14452#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:48,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {14452#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {14452#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:48,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {14452#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_#res#1 := student_version_~y~1#1; {14453#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} is VALID [2022-02-20 17:09:48,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {14453#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {14454#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} is VALID [2022-02-20 17:09:48,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {14454#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {14455#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:09:48,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {14455#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {14437#false} is VALID [2022-02-20 17:09:48,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {14437#false} assume !false; {14437#false} is VALID [2022-02-20 17:09:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:09:48,540 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:48,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473325105] [2022-02-20 17:09:48,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473325105] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:48,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358805258] [2022-02-20 17:09:48,541 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-20 17:09:48,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:48,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:48,542 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:48,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-02-20 17:09:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:48,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 39 conjunts are in the unsatisfiable core [2022-02-20 17:09:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:48,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:49,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {14436#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {14436#true} is VALID [2022-02-20 17:09:49,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {14436#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {14436#true} is VALID [2022-02-20 17:09:49,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {14436#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:49,058 INFO L290 TraceCheckUtils]: 3: Hoare triple {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:49,058 INFO L290 TraceCheckUtils]: 4: Hoare triple {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:49,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {14439#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:49,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {14439#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {14440#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:49,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {14440#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {14441#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} is VALID [2022-02-20 17:09:49,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {14441#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {14442#(and (<= 4 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 4))} is VALID [2022-02-20 17:09:49,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {14442#(and (<= 4 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 4))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {14442#(and (<= 4 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 4))} is VALID [2022-02-20 17:09:49,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {14442#(and (<= 4 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 4))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {14443#(and (= |ULTIMATE.start_correct_version_~y~0#1| 0) (<= 4 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 4))} is VALID [2022-02-20 17:09:49,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {14443#(and (= |ULTIMATE.start_correct_version_~y~0#1| 0) (<= 4 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 4))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {14444#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} is VALID [2022-02-20 17:09:49,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {14444#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {14444#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} is VALID [2022-02-20 17:09:49,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {14444#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} correct_version_#res#1 := correct_version_~y~0#1; {14445#(and (<= |ULTIMATE.start_correct_version_#res#1| 4) (<= 4 |ULTIMATE.start_correct_version_#res#1|))} is VALID [2022-02-20 17:09:49,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {14445#(and (<= |ULTIMATE.start_correct_version_#res#1| 4) (<= 4 |ULTIMATE.start_correct_version_#res#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {14446#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:09:49,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {14446#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {14446#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:09:49,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {14446#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !(student_version_~b~1#1 < student_version_~n#1); {14446#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:09:49,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {14446#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {14510#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:09:49,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {14510#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {14514#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 2) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:09:49,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {14514#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 2) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {14518#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4) (= 2 (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|)))} is VALID [2022-02-20 17:09:49,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {14518#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4) (= 2 (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {14522#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 4) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:09:49,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {14522#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 4) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !(student_version_~l~1#1 < student_version_~m#1); {14522#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 4) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:09:49,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {14522#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 4) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {14529#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 4) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4) (= |ULTIMATE.start_student_version_~y~1#1| 0))} is VALID [2022-02-20 17:09:49,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {14529#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 4) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4) (= |ULTIMATE.start_student_version_~y~1#1| 0))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {14533#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4) (= |ULTIMATE.start_student_version_~y~1#1| 4))} is VALID [2022-02-20 17:09:49,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {14533#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4) (= |ULTIMATE.start_student_version_~y~1#1| 4))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {14533#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4) (= |ULTIMATE.start_student_version_~y~1#1| 4))} is VALID [2022-02-20 17:09:49,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {14533#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4) (= |ULTIMATE.start_student_version_~y~1#1| 4))} student_version_#res#1 := student_version_~y~1#1; {14540#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_#res#1| 4) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:09:49,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {14540#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_#res#1| 4) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {14544#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_main_~n_stones2~0#1| 4) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:09:49,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {14544#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_main_~n_stones2~0#1| 4) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {14548#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:09:49,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {14548#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {14437#false} is VALID [2022-02-20 17:09:49,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {14437#false} assume !false; {14437#false} is VALID [2022-02-20 17:09:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:09:49,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:49,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {14437#false} assume !false; {14437#false} is VALID [2022-02-20 17:09:49,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {14548#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {14437#false} is VALID [2022-02-20 17:09:49,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {14454#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {14548#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:09:49,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {14453#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {14454#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} is VALID [2022-02-20 17:09:49,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {14452#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_#res#1 := student_version_~y~1#1; {14453#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} is VALID [2022-02-20 17:09:49,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {14452#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {14452#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:49,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {14573#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|)))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {14452#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:49,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {14450#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {14573#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|)))} is VALID [2022-02-20 17:09:49,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {14450#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} assume !(student_version_~l~1#1 < student_version_~m#1); {14450#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:49,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {14449#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {14450#(and (<= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~j~1#1|))} is VALID [2022-02-20 17:09:49,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {14448#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (+ |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {14449#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 1) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 1)))} is VALID [2022-02-20 17:09:49,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {14447#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 3) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 3)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {14448#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (+ |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:49,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {14592#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 4) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 4)))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {14447#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 3) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 3)))} is VALID [2022-02-20 17:09:49,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {14592#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 4) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 4)))} assume !(student_version_~b~1#1 < student_version_~n#1); {14592#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 4) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 4)))} is VALID [2022-02-20 17:09:49,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {14592#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 4) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 4)))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {14592#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 4) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 4)))} is VALID [2022-02-20 17:09:49,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {14445#(and (<= |ULTIMATE.start_correct_version_#res#1| 4) (<= 4 |ULTIMATE.start_correct_version_#res#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {14592#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| 4) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| 4)))} is VALID [2022-02-20 17:09:49,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {14444#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} correct_version_#res#1 := correct_version_~y~0#1; {14445#(and (<= |ULTIMATE.start_correct_version_#res#1| 4) (<= 4 |ULTIMATE.start_correct_version_#res#1|))} is VALID [2022-02-20 17:09:49,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {14444#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {14444#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} is VALID [2022-02-20 17:09:49,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {14611#(and (<= 4 (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|)) (<= (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) 4))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {14444#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} is VALID [2022-02-20 17:09:49,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {14442#(and (<= 4 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 4))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {14611#(and (<= 4 (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|)) (<= (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) 4))} is VALID [2022-02-20 17:09:49,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {14442#(and (<= 4 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 4))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {14442#(and (<= 4 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 4))} is VALID [2022-02-20 17:09:49,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {14441#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {14442#(and (<= 4 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 4))} is VALID [2022-02-20 17:09:49,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {14440#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {14441#(and (<= 3 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 3))} is VALID [2022-02-20 17:09:49,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {14439#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {14440#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:49,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {14439#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:49,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:49,376 INFO L290 TraceCheckUtils]: 3: Hoare triple {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:49,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {14436#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {14438#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:49,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {14436#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {14436#true} is VALID [2022-02-20 17:09:49,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {14436#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {14436#true} is VALID [2022-02-20 17:09:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:09:49,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358805258] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:49,377 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:49,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 32 [2022-02-20 17:09:49,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182412465] [2022-02-20 17:09:49,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:49,378 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.59375) internal successors, (51), 32 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 30 [2022-02-20 17:09:49,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:49,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.59375) internal successors, (51), 32 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-20 17:09:49,422 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-20 17:09:49,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-02-20 17:09:49,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:49,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-20 17:09:49,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=914, Unknown=0, NotChecked=0, Total=992 [2022-02-20 17:09:49,424 INFO L87 Difference]: Start difference. First operand 134 states and 163 transitions. Second operand has 32 states, 32 states have (on average 1.59375) internal successors, (51), 32 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-20 17:09:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:53,245 INFO L93 Difference]: Finished difference Result 258 states and 295 transitions. [2022-02-20 17:09:53,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 17:09:53,245 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.59375) internal successors, (51), 32 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 30 [2022-02-20 17:09:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.59375) internal successors, (51), 32 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-20 17:09:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 132 transitions. [2022-02-20 17:09:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.59375) internal successors, (51), 32 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-20 17:09:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 132 transitions. [2022-02-20 17:09:53,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 132 transitions. [2022-02-20 17:09:53,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:53,351 INFO L225 Difference]: With dead ends: 258 [2022-02-20 17:09:53,351 INFO L226 Difference]: Without dead ends: 249 [2022-02-20 17:09:53,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=2305, Unknown=0, NotChecked=0, Total=2550 [2022-02-20 17:09:53,352 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 167 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:53,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 1370 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 17:09:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-02-20 17:09:54,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 143. [2022-02-20 17:09:54,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:54,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 143 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 142 states have internal predecessors, (173), 0 states have call successors, (0), 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-20 17:09:54,324 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 143 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 142 states have internal predecessors, (173), 0 states have call successors, (0), 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-20 17:09:54,324 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 143 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 142 states have internal predecessors, (173), 0 states have call successors, (0), 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-20 17:09:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:54,327 INFO L93 Difference]: Finished difference Result 249 states and 286 transitions. [2022-02-20 17:09:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 286 transitions. [2022-02-20 17:09:54,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:54,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:54,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 142 states have internal predecessors, (173), 0 states have call successors, (0), 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 249 states. [2022-02-20 17:09:54,328 INFO L87 Difference]: Start difference. First operand has 143 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 142 states have internal predecessors, (173), 0 states have call successors, (0), 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 249 states. [2022-02-20 17:09:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:54,331 INFO L93 Difference]: Finished difference Result 249 states and 286 transitions. [2022-02-20 17:09:54,331 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 286 transitions. [2022-02-20 17:09:54,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:54,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:54,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:54,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 142 states have internal predecessors, (173), 0 states have call successors, (0), 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-20 17:09:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 173 transitions. [2022-02-20 17:09:54,333 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 173 transitions. Word has length 30 [2022-02-20 17:09:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:54,334 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 173 transitions. [2022-02-20 17:09:54,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.59375) internal successors, (51), 32 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-20 17:09:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 173 transitions. [2022-02-20 17:09:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:09:54,334 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:54,334 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:54,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-02-20 17:09:54,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-02-20 17:09:54,552 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:54,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:54,552 INFO L85 PathProgramCache]: Analyzing trace with hash 283195298, now seen corresponding path program 20 times [2022-02-20 17:09:54,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:54,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108992366] [2022-02-20 17:09:54,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:54,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {15770#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {15770#true} is VALID [2022-02-20 17:09:54,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {15770#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {15770#true} is VALID [2022-02-20 17:09:54,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {15770#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {15772#(and (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~n#1|) (= |ULTIMATE.start_correct_version_~b~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:54,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {15772#(and (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~n#1|) (= |ULTIMATE.start_correct_version_~b~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {15773#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~b~0#1|) (+ |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~n#1|)))} is VALID [2022-02-20 17:09:54,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {15773#(and (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~b~0#1|) (+ |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_correct_version_~n#1|)))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {15774#(and (<= (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~b~0#1|) (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~n#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:54,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {15774#(and (<= (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~b~0#1|) (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~n#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {15775#(and (<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_correct_version_~a#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} is VALID [2022-02-20 17:09:54,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {15775#(and (<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_correct_version_~a#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_correct_version_~a#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:54,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:54,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:54,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:54,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:54,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:54,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} correct_version_#res#1 := correct_version_~y~0#1; {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:54,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {15777#(and (<= |ULTIMATE.start_student_version_~n#1| (* |ULTIMATE.start_student_version_~a#1| 2)) (= |ULTIMATE.start_student_version_~b~1#1| 0))} is VALID [2022-02-20 17:09:54,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {15777#(and (<= |ULTIMATE.start_student_version_~n#1| (* |ULTIMATE.start_student_version_~a#1| 2)) (= |ULTIMATE.start_student_version_~b~1#1| 0))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {15778#(<= |ULTIMATE.start_student_version_~n#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~b~1#1|))} is VALID [2022-02-20 17:09:54,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {15778#(<= |ULTIMATE.start_student_version_~n#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~b~1#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {15779#(<= |ULTIMATE.start_student_version_~n#1| |ULTIMATE.start_student_version_~b~1#1|)} is VALID [2022-02-20 17:09:54,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {15779#(<= |ULTIMATE.start_student_version_~n#1| |ULTIMATE.start_student_version_~b~1#1|)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {15771#false} is VALID [2022-02-20 17:09:54,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {15771#false} assume !(student_version_~b~1#1 < student_version_~n#1); {15771#false} is VALID [2022-02-20 17:09:54,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {15771#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {15771#false} is VALID [2022-02-20 17:09:54,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {15771#false} assume !(student_version_~l~1#1 < student_version_~m#1); {15771#false} is VALID [2022-02-20 17:09:54,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {15771#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {15771#false} is VALID [2022-02-20 17:09:54,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {15771#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {15771#false} is VALID [2022-02-20 17:09:54,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {15771#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {15771#false} is VALID [2022-02-20 17:09:54,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {15771#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {15771#false} is VALID [2022-02-20 17:09:54,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {15771#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {15771#false} is VALID [2022-02-20 17:09:54,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {15771#false} student_version_#res#1 := student_version_~y~1#1; {15771#false} is VALID [2022-02-20 17:09:54,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {15771#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {15771#false} is VALID [2022-02-20 17:09:54,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {15771#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {15771#false} is VALID [2022-02-20 17:09:54,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {15771#false} assume 0 == __VERIFIER_assert_~cond#1; {15771#false} is VALID [2022-02-20 17:09:54,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {15771#false} assume !false; {15771#false} is VALID [2022-02-20 17:09:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 17:09:54,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:54,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108992366] [2022-02-20 17:09:54,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108992366] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:54,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048631130] [2022-02-20 17:09:54,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:09:54,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:54,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:54,646 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:54,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-02-20 17:09:54,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:09:54,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:54,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 17:09:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:54,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:55,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {15770#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {15770#true} is VALID [2022-02-20 17:09:55,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {15770#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {15770#true} is VALID [2022-02-20 17:09:55,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {15770#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {15789#(and (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_correct_version_~b~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~n#1|))} is VALID [2022-02-20 17:09:55,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {15789#(and (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_correct_version_~b~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~n#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {15793#(and (<= |ULTIMATE.start_correct_version_~b~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~n#1|))} is VALID [2022-02-20 17:09:55,318 INFO L290 TraceCheckUtils]: 4: Hoare triple {15793#(and (<= |ULTIMATE.start_correct_version_~b~0#1| |ULTIMATE.start_correct_version_~a#1|) (<= |ULTIMATE.start_correct_version_~a#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~n#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {15797#(and (<= (div (- |ULTIMATE.start_correct_version_~b~0#1|) (- 2)) |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~n#1|))} is VALID [2022-02-20 17:09:55,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {15797#(and (<= (div (- |ULTIMATE.start_correct_version_~b~0#1|) (- 2)) |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_correct_version_~n#1|))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:55,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:55,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:55,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:55,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:55,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:55,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:55,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} correct_version_#res#1 := correct_version_~y~0#1; {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:55,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {15825#(and (<= 0 |ULTIMATE.start_student_version_~b~1#1|) (<= (div (- |ULTIMATE.start_student_version_~n#1|) (- 2)) |ULTIMATE.start_student_version_~a#1|))} is VALID [2022-02-20 17:09:55,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {15825#(and (<= 0 |ULTIMATE.start_student_version_~b~1#1|) (<= (div (- |ULTIMATE.start_student_version_~n#1|) (- 2)) |ULTIMATE.start_student_version_~a#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {15829#(and (<= |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~b~1#1|) (<= (div (- |ULTIMATE.start_student_version_~n#1|) (- 2)) |ULTIMATE.start_student_version_~a#1|))} is VALID [2022-02-20 17:09:55,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {15829#(and (<= |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~b~1#1|) (<= (div (- |ULTIMATE.start_student_version_~n#1|) (- 2)) |ULTIMATE.start_student_version_~a#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {15833#(<= (div (* |ULTIMATE.start_student_version_~n#1| (- 1)) (- 2)) (div |ULTIMATE.start_student_version_~b~1#1| 2))} is VALID [2022-02-20 17:09:55,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {15833#(<= (div (* |ULTIMATE.start_student_version_~n#1| (- 1)) (- 2)) (div |ULTIMATE.start_student_version_~b~1#1| 2))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {15771#false} is VALID [2022-02-20 17:09:55,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {15771#false} assume !(student_version_~b~1#1 < student_version_~n#1); {15771#false} is VALID [2022-02-20 17:09:55,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {15771#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {15771#false} is VALID [2022-02-20 17:09:55,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {15771#false} assume !(student_version_~l~1#1 < student_version_~m#1); {15771#false} is VALID [2022-02-20 17:09:55,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {15771#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {15771#false} is VALID [2022-02-20 17:09:55,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {15771#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {15771#false} is VALID [2022-02-20 17:09:55,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {15771#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {15771#false} is VALID [2022-02-20 17:09:55,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {15771#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {15771#false} is VALID [2022-02-20 17:09:55,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {15771#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {15771#false} is VALID [2022-02-20 17:09:55,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {15771#false} student_version_#res#1 := student_version_~y~1#1; {15771#false} is VALID [2022-02-20 17:09:55,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {15771#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {15771#false} is VALID [2022-02-20 17:09:55,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {15771#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {15771#false} is VALID [2022-02-20 17:09:55,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {15771#false} assume 0 == __VERIFIER_assert_~cond#1; {15771#false} is VALID [2022-02-20 17:09:55,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {15771#false} assume !false; {15771#false} is VALID [2022-02-20 17:09:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 17:09:55,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:55,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {15771#false} assume !false; {15771#false} is VALID [2022-02-20 17:09:55,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {15771#false} assume 0 == __VERIFIER_assert_~cond#1; {15771#false} is VALID [2022-02-20 17:09:55,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {15771#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {15771#false} is VALID [2022-02-20 17:09:55,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {15771#false} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {15771#false} is VALID [2022-02-20 17:09:55,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {15771#false} student_version_#res#1 := student_version_~y~1#1; {15771#false} is VALID [2022-02-20 17:09:55,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {15771#false} assume !(student_version_~x~1#1 < student_version_~i~1#1); {15771#false} is VALID [2022-02-20 17:09:55,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {15771#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {15771#false} is VALID [2022-02-20 17:09:55,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {15771#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {15771#false} is VALID [2022-02-20 17:09:55,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {15771#false} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {15771#false} is VALID [2022-02-20 17:09:55,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {15771#false} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {15771#false} is VALID [2022-02-20 17:09:55,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {15771#false} assume !(student_version_~l~1#1 < student_version_~m#1); {15771#false} is VALID [2022-02-20 17:09:55,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {15771#false} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {15771#false} is VALID [2022-02-20 17:09:55,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {15771#false} assume !(student_version_~b~1#1 < student_version_~n#1); {15771#false} is VALID [2022-02-20 17:09:55,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {15779#(<= |ULTIMATE.start_student_version_~n#1| |ULTIMATE.start_student_version_~b~1#1|)} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {15771#false} is VALID [2022-02-20 17:09:55,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {15778#(<= |ULTIMATE.start_student_version_~n#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~b~1#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {15779#(<= |ULTIMATE.start_student_version_~n#1| |ULTIMATE.start_student_version_~b~1#1|)} is VALID [2022-02-20 17:09:55,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {15921#(<= |ULTIMATE.start_student_version_~n#1| (+ |ULTIMATE.start_student_version_~b~1#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {15778#(<= |ULTIMATE.start_student_version_~n#1| (+ |ULTIMATE.start_student_version_~a#1| |ULTIMATE.start_student_version_~b~1#1|))} is VALID [2022-02-20 17:09:55,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {15921#(<= |ULTIMATE.start_student_version_~n#1| (+ |ULTIMATE.start_student_version_~b~1#1| (* |ULTIMATE.start_student_version_~a#1| 2)))} is VALID [2022-02-20 17:09:55,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} correct_version_#res#1 := correct_version_~y~0#1; {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:55,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:55,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:55,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:55,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:55,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:55,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:55,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {15949#(or (< |ULTIMATE.start_correct_version_~b~0#1| |ULTIMATE.start_correct_version_~n#1|) (<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !(correct_version_~b~0#1 < correct_version_~n#1); {15776#(<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:09:55,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {15953#(or (< (+ |ULTIMATE.start_correct_version_~b~0#1| |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~n#1|) (<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {15949#(or (< |ULTIMATE.start_correct_version_~b~0#1| |ULTIMATE.start_correct_version_~n#1|) (<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:09:55,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {15957#(or (<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)) (< (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~b~0#1|) |ULTIMATE.start_correct_version_~n#1|))} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {15953#(or (< (+ |ULTIMATE.start_correct_version_~b~0#1| |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~n#1|) (<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:09:55,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {15770#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {15957#(or (<= |ULTIMATE.start_main_~n~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)) (< (+ (* 2 |ULTIMATE.start_correct_version_~a#1|) |ULTIMATE.start_correct_version_~b~0#1|) |ULTIMATE.start_correct_version_~n#1|))} is VALID [2022-02-20 17:09:55,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {15770#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {15770#true} is VALID [2022-02-20 17:09:55,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {15770#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {15770#true} is VALID [2022-02-20 17:09:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 17:09:55,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048631130] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:55,668 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:55,669 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-02-20 17:09:55,669 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805535350] [2022-02-20 17:09:55,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:55,669 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 17:09:55,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:55,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 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-20 17:09:55,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:55,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 17:09:55,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:55,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 17:09:55,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-02-20 17:09:55,694 INFO L87 Difference]: Start difference. First operand 143 states and 173 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 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-20 17:09:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:57,873 INFO L93 Difference]: Finished difference Result 217 states and 254 transitions. [2022-02-20 17:09:57,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 17:09:57,873 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 17:09:57,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 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-20 17:09:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2022-02-20 17:09:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 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-20 17:09:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2022-02-20 17:09:57,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 81 transitions. [2022-02-20 17:09:57,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:57,939 INFO L225 Difference]: With dead ends: 217 [2022-02-20 17:09:57,939 INFO L226 Difference]: Without dead ends: 181 [2022-02-20 17:09:57,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2022-02-20 17:09:57,940 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 276 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:57,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 279 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:09:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-02-20 17:09:59,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 154. [2022-02-20 17:09:59,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:59,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 154 states, 153 states have (on average 1.196078431372549) internal successors, (183), 153 states have internal predecessors, (183), 0 states have call successors, (0), 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-20 17:09:59,090 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 154 states, 153 states have (on average 1.196078431372549) internal successors, (183), 153 states have internal predecessors, (183), 0 states have call successors, (0), 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-20 17:09:59,090 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 154 states, 153 states have (on average 1.196078431372549) internal successors, (183), 153 states have internal predecessors, (183), 0 states have call successors, (0), 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-20 17:09:59,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:59,092 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2022-02-20 17:09:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 209 transitions. [2022-02-20 17:09:59,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:59,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:59,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 153 states have (on average 1.196078431372549) internal successors, (183), 153 states have internal predecessors, (183), 0 states have call successors, (0), 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 181 states. [2022-02-20 17:09:59,093 INFO L87 Difference]: Start difference. First operand has 154 states, 153 states have (on average 1.196078431372549) internal successors, (183), 153 states have internal predecessors, (183), 0 states have call successors, (0), 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 181 states. [2022-02-20 17:09:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:59,095 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2022-02-20 17:09:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 209 transitions. [2022-02-20 17:09:59,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:59,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:59,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:59,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.196078431372549) internal successors, (183), 153 states have internal predecessors, (183), 0 states have call successors, (0), 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-20 17:09:59,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 183 transitions. [2022-02-20 17:09:59,097 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 183 transitions. Word has length 30 [2022-02-20 17:09:59,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:59,097 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 183 transitions. [2022-02-20 17:09:59,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 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-20 17:09:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 183 transitions. [2022-02-20 17:09:59,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:09:59,098 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:59,098 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:59,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:59,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:59,315 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:59,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1226887537, now seen corresponding path program 21 times [2022-02-20 17:09:59,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:59,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531901139] [2022-02-20 17:09:59,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:59,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:59,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {16906#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {16906#true} is VALID [2022-02-20 17:09:59,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {16906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {16906#true} is VALID [2022-02-20 17:09:59,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {16906#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:59,544 INFO L290 TraceCheckUtils]: 3: Hoare triple {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:59,544 INFO L290 TraceCheckUtils]: 4: Hoare triple {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:59,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:09:59,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {16909#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:09:59,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {16909#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {16910#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:59,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {16910#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {16910#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:59,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {16910#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {16911#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (= |ULTIMATE.start_correct_version_~y~0#1| 0) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:09:59,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {16911#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (= |ULTIMATE.start_correct_version_~y~0#1| 0) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {16912#(and (<= 4 (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|)) (<= (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) 4))} is VALID [2022-02-20 17:09:59,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {16912#(and (<= 4 (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|)) (<= (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) 4))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {16913#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} is VALID [2022-02-20 17:09:59,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {16913#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {16913#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} is VALID [2022-02-20 17:09:59,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {16913#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} correct_version_#res#1 := correct_version_~y~0#1; {16914#(and (<= |ULTIMATE.start_correct_version_#res#1| 4) (<= 4 |ULTIMATE.start_correct_version_#res#1|))} is VALID [2022-02-20 17:09:59,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {16914#(and (<= |ULTIMATE.start_correct_version_#res#1| 4) (<= 4 |ULTIMATE.start_correct_version_#res#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {16915#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:09:59,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {16915#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {16915#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:09:59,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {16915#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {16915#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:09:59,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {16915#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !(student_version_~b~1#1 < student_version_~n#1); {16915#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:09:59,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {16915#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {16916#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:59,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {16916#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {16917#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:59,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {16917#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~l~1#1 < student_version_~m#1); {16917#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:59,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {16917#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {16918#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~y~1#1| 0))} is VALID [2022-02-20 17:09:59,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {16918#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~y~1#1| 0))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {16919#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|)))} is VALID [2022-02-20 17:09:59,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {16919#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|)))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {16920#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:59,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {16920#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {16920#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:09:59,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {16920#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_#res#1 := student_version_~y~1#1; {16921#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} is VALID [2022-02-20 17:09:59,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {16921#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {16922#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} is VALID [2022-02-20 17:09:59,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {16922#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {16923#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:09:59,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {16923#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {16907#false} is VALID [2022-02-20 17:09:59,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {16907#false} assume !false; {16907#false} is VALID [2022-02-20 17:09:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:09:59,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:59,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531901139] [2022-02-20 17:09:59,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531901139] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:59,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116293567] [2022-02-20 17:09:59,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:09:59,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:59,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:59,558 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:59,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-02-20 17:09:59,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 17:09:59,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:59,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-20 17:09:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:59,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:10:00,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {16906#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {16906#true} is VALID [2022-02-20 17:10:00,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {16906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {16906#true} is VALID [2022-02-20 17:10:00,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {16906#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:10:00,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:10:00,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:10:00,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:10:00,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {16909#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:10:00,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {16909#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {16910#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:10:00,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {16910#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {16910#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:10:00,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {16910#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {16911#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (= |ULTIMATE.start_correct_version_~y~0#1| 0) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:10:00,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {16911#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (= |ULTIMATE.start_correct_version_~y~0#1| 0) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {16957#(and (= (+ (* (- 1) |ULTIMATE.start_correct_version_~j~0#1|) |ULTIMATE.start_correct_version_~y~0#1|) 0) (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:10:00,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {16957#(and (= (+ (* (- 1) |ULTIMATE.start_correct_version_~j~0#1|) |ULTIMATE.start_correct_version_~y~0#1|) 0) (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {16913#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} is VALID [2022-02-20 17:10:00,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {16913#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {16913#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} is VALID [2022-02-20 17:10:00,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {16913#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} correct_version_#res#1 := correct_version_~y~0#1; {16914#(and (<= |ULTIMATE.start_correct_version_#res#1| 4) (<= 4 |ULTIMATE.start_correct_version_#res#1|))} is VALID [2022-02-20 17:10:00,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {16914#(and (<= |ULTIMATE.start_correct_version_#res#1| 4) (<= 4 |ULTIMATE.start_correct_version_#res#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {16915#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:10:00,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {16915#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {16915#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:10:00,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {16915#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {16915#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:10:00,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {16915#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !(student_version_~b~1#1 < student_version_~n#1); {16915#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:10:00,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {16915#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {16982#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:10:00,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {16982#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ (- 1) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {16986#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ (- 2) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:10:00,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {16986#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ (- 2) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !(student_version_~l~1#1 < student_version_~m#1); {16986#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ (- 2) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:10:00,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {16986#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ (- 2) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {16993#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ (- 2) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4) (= |ULTIMATE.start_student_version_~y~1#1| 0))} is VALID [2022-02-20 17:10:00,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {16993#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= (+ (- 2) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4) (= |ULTIMATE.start_student_version_~y~1#1| 0))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {16997#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) (= (+ (- 2) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:10:00,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {16997#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) (= (+ (- 2) |ULTIMATE.start_student_version_~j~1#1|) 0) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {17001#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4) (= |ULTIMATE.start_student_version_~y~1#1| 4))} is VALID [2022-02-20 17:10:00,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {17001#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4) (= |ULTIMATE.start_student_version_~y~1#1| 4))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {17001#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4) (= |ULTIMATE.start_student_version_~y~1#1| 4))} is VALID [2022-02-20 17:10:00,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {17001#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4) (= |ULTIMATE.start_student_version_~y~1#1| 4))} student_version_#res#1 := student_version_~y~1#1; {17008#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_#res#1| 4) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:10:00,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {17008#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_student_version_#res#1| 4) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {17012#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_main_~n_stones2~0#1| 4) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} is VALID [2022-02-20 17:10:00,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {17012#(and (<= 4 |ULTIMATE.start_main_~n_stones1~0#1|) (= |ULTIMATE.start_main_~n_stones2~0#1| 4) (<= |ULTIMATE.start_main_~n_stones1~0#1| 4))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {17016#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:10:00,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {17016#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {16907#false} is VALID [2022-02-20 17:10:00,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {16907#false} assume !false; {16907#false} is VALID [2022-02-20 17:10:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:10:00,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:10:00,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {16907#false} assume !false; {16907#false} is VALID [2022-02-20 17:10:00,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {17016#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {16907#false} is VALID [2022-02-20 17:10:00,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {16922#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~n_stones1~0#1 == main_~n_stones2~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {17016#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:10:00,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {16921#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} main_#t~ret9#1 := student_version_#res#1;assume { :end_inline_student_version } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {16922#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_main_~n_stones2~0#1|) (< |ULTIMATE.start_main_~n_stones2~0#1| (+ |ULTIMATE.start_main_~n_stones1~0#1| 1)))} is VALID [2022-02-20 17:10:00,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {16920#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_#res#1 := student_version_~y~1#1; {16921#(and (<= |ULTIMATE.start_student_version_#res#1| |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_#res#1|))} is VALID [2022-02-20 17:10:00,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {16920#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~x~1#1 < student_version_~i~1#1); {16920#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:10:00,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {16919#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|)))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {16920#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| |ULTIMATE.start_student_version_~y~1#1|) (<= |ULTIMATE.start_student_version_~y~1#1| |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:10:00,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {17044#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_student_version_~y~1#1|)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~x~1#1 < student_version_~i~1#1);student_version_~y~1#1 := student_version_~y~1#1 + student_version_~j~1#1;student_version_~x~1#1 := 1 + student_version_~x~1#1; {16919#(and (<= (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|) (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ |ULTIMATE.start_student_version_~j~1#1| |ULTIMATE.start_student_version_~y~1#1|)))} is VALID [2022-02-20 17:10:00,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {16917#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} student_version_~x~1#1 := 0;student_version_~y~1#1 := 0; {17044#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_student_version_~y~1#1|)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_student_version_~y~1#1|) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:10:00,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {16917#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~l~1#1 < student_version_~m#1); {16917#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:10:00,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {16916#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {16917#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (* |ULTIMATE.start_student_version_~j~1#1| 2)) (<= (* |ULTIMATE.start_student_version_~j~1#1| 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:10:00,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {17057#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 4)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 4) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~l~1#1 < student_version_~m#1);student_version_~l~1#1 := student_version_~l~1#1 + student_version_~a#1;student_version_~j~1#1 := 1 + student_version_~j~1#1; {16916#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 2) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:10:00,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {17057#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 4)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 4) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !(student_version_~b~1#1 < student_version_~n#1); {17057#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 4)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 4) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:10:00,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {17057#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 4)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 4) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {17057#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 4)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 4) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:10:00,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {17057#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 4)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 4) |ULTIMATE.start_main_~n_stones1~0#1|))} assume !!(student_version_~b~1#1 < student_version_~n#1);student_version_~b~1#1 := student_version_~b~1#1 + student_version_~a#1;student_version_~i~1#1 := 1 + student_version_~i~1#1; {17057#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 4)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 4) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:10:00,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {16914#(and (<= |ULTIMATE.start_correct_version_#res#1| 4) (<= 4 |ULTIMATE.start_correct_version_#res#1|))} main_#t~ret8#1 := correct_version_#res#1;assume { :end_inline_correct_version } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~n_stones1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_student_version } true;student_version_#in~n#1, student_version_#in~m#1, student_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc student_version_#res#1;havoc student_version_~n#1, student_version_~m#1, student_version_~a#1, student_version_~i~1#1, student_version_~j~1#1, student_version_~b~1#1, student_version_~l~1#1, student_version_~x~1#1, student_version_~y~1#1;student_version_~n#1 := student_version_#in~n#1;student_version_~m#1 := student_version_#in~m#1;student_version_~a#1 := student_version_#in~a#1;student_version_~i~1#1 := 0;student_version_~j~1#1 := 0;student_version_~b~1#1 := 0;student_version_~l~1#1 := 0; {17057#(and (<= |ULTIMATE.start_main_~n_stones1~0#1| (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 4)) (<= (+ (* |ULTIMATE.start_student_version_~j~1#1| 2) 4) |ULTIMATE.start_main_~n_stones1~0#1|))} is VALID [2022-02-20 17:10:00,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {16913#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} correct_version_#res#1 := correct_version_~y~0#1; {16914#(and (<= |ULTIMATE.start_correct_version_#res#1| 4) (<= 4 |ULTIMATE.start_correct_version_#res#1|))} is VALID [2022-02-20 17:10:00,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {16913#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} assume !(correct_version_~x~0#1 < correct_version_~i~0#1); {16913#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} is VALID [2022-02-20 17:10:00,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {16912#(and (<= 4 (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|)) (<= (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) 4))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {16913#(and (<= 4 |ULTIMATE.start_correct_version_~y~0#1|) (<= |ULTIMATE.start_correct_version_~y~0#1| 4))} is VALID [2022-02-20 17:10:00,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {17082#(and (<= (+ (* 2 |ULTIMATE.start_correct_version_~j~0#1|) |ULTIMATE.start_correct_version_~y~0#1|) 4) (<= 4 (+ (* 2 |ULTIMATE.start_correct_version_~j~0#1|) |ULTIMATE.start_correct_version_~y~0#1|)))} assume !!(correct_version_~x~0#1 < correct_version_~i~0#1);correct_version_~y~0#1 := correct_version_~y~0#1 + correct_version_~j~0#1;correct_version_~x~0#1 := 1 + correct_version_~x~0#1; {16912#(and (<= 4 (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|)) (<= (+ |ULTIMATE.start_correct_version_~j~0#1| |ULTIMATE.start_correct_version_~y~0#1|) 4))} is VALID [2022-02-20 17:10:00,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {16910#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} correct_version_~x~0#1 := 0;correct_version_~y~0#1 := 0; {17082#(and (<= (+ (* 2 |ULTIMATE.start_correct_version_~j~0#1|) |ULTIMATE.start_correct_version_~y~0#1|) 4) (<= 4 (+ (* 2 |ULTIMATE.start_correct_version_~j~0#1|) |ULTIMATE.start_correct_version_~y~0#1|)))} is VALID [2022-02-20 17:10:00,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {16910#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} assume !(correct_version_~l~0#1 < correct_version_~m#1); {16910#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:10:00,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {16909#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {16910#(and (<= |ULTIMATE.start_correct_version_~j~0#1| 2) (<= 2 |ULTIMATE.start_correct_version_~j~0#1|))} is VALID [2022-02-20 17:10:00,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~l~0#1 < correct_version_~m#1);correct_version_~l~0#1 := correct_version_~l~0#1 + correct_version_~a#1;correct_version_~j~0#1 := 1 + correct_version_~j~0#1; {16909#(and (<= 1 |ULTIMATE.start_correct_version_~j~0#1|) (<= |ULTIMATE.start_correct_version_~j~0#1| 1))} is VALID [2022-02-20 17:10:00,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !(correct_version_~b~0#1 < correct_version_~n#1); {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:10:00,408 INFO L290 TraceCheckUtils]: 4: Hoare triple {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:10:00,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} assume !!(correct_version_~b~0#1 < correct_version_~n#1);correct_version_~b~0#1 := correct_version_~b~0#1 + correct_version_~a#1;correct_version_~i~0#1 := 1 + correct_version_~i~0#1; {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:10:00,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {16906#true} assume ((((1 <= main_~n~0#1 && 1 <= main_~m~0#1) && 1 <= main_~a~0#1) && main_~n~0#1 <= 109) && main_~m~0#1 <= 109) && main_~a~0#1 <= 109;assume { :begin_inline_correct_version } true;correct_version_#in~n#1, correct_version_#in~m#1, correct_version_#in~a#1 := main_~n~0#1, main_~m~0#1, main_~a~0#1;havoc correct_version_#res#1;havoc correct_version_~n#1, correct_version_~m#1, correct_version_~a#1, correct_version_~i~0#1, correct_version_~j~0#1, correct_version_~b~0#1, correct_version_~l~0#1, correct_version_~x~0#1, correct_version_~y~0#1;correct_version_~n#1 := correct_version_#in~n#1;correct_version_~m#1 := correct_version_#in~m#1;correct_version_~a#1 := correct_version_#in~a#1;correct_version_~i~0#1 := 0;correct_version_~j~0#1 := 0;correct_version_~b~0#1 := 0;correct_version_~l~0#1 := 0; {16908#(= |ULTIMATE.start_correct_version_~j~0#1| 0)} is VALID [2022-02-20 17:10:00,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {16906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~a~0#1, main_~n~0#1, main_~m~0#1, main_~n_stones1~0#1, main_~n_stones2~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~n_stones1~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n_stones2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;main_~n_stones1~0#1 := main_~n_stones2~0#1; {16906#true} is VALID [2022-02-20 17:10:00,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {16906#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {16906#true} is VALID [2022-02-20 17:10:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:10:00,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116293567] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:10:00,409 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:10:00,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 30 [2022-02-20 17:10:00,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120879019] [2022-02-20 17:10:00,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:10:00,410 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 17:10:00,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:00,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 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-20 17:10:00,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:00,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-02-20 17:10:00,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:00,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-02-20 17:10:00,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2022-02-20 17:10:00,442 INFO L87 Difference]: Start difference. First operand 154 states and 183 transitions. Second operand has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)