./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination 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/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:35:09,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:35:09,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:35:09,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:35:09,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:35:09,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:35:09,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:35:09,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:35:09,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:35:10,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:35:10,000 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:35:10,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:35:10,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:35:10,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:35:10,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:35:10,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:35:10,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:35:10,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:35:10,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:35:10,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:35:10,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:35:10,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:35:10,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:35:10,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:35:10,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:35:10,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:35:10,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:35:10,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:35:10,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:35:10,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:35:10,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:35:10,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:35:10,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:35:10,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:35:10,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:35:10,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:35:10,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:35:10,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:35:10,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:35:10,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:35:10,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:35:10,032 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:35:10,051 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:35:10,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:35:10,052 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:35:10,052 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:35:10,053 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:35:10,053 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:35:10,053 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:35:10,053 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:35:10,053 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:35:10,053 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:35:10,054 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:35:10,054 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:35:10,054 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:35:10,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:35:10,055 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:35:10,055 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:35:10,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:35:10,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:35:10,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:35:10,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:35:10,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:35:10,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:35:10,056 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:35:10,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:35:10,056 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:35:10,056 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:35:10,056 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:35:10,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:35:10,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:35:10,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:35:10,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:35:10,058 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:35:10,058 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 [2022-02-21 04:35:10,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:35:10,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:35:10,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:35:10,317 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:35:10,317 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:35:10,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2022-02-21 04:35:10,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62eefc01a/19db101b2fc84c11a3722c43e30a4929/FLAGa6367e40e [2022-02-21 04:35:10,785 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:35:10,786 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2022-02-21 04:35:10,798 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62eefc01a/19db101b2fc84c11a3722c43e30a4929/FLAGa6367e40e [2022-02-21 04:35:10,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62eefc01a/19db101b2fc84c11a3722c43e30a4929 [2022-02-21 04:35:10,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:35:10,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:35:10,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:10,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:35:10,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:35:10,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:10" (1/1) ... [2022-02-21 04:35:10,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be11480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:10, skipping insertion in model container [2022-02-21 04:35:10,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:10" (1/1) ... [2022-02-21 04:35:10,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:35:10,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:35:11,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:11,132 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:35:11,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:11,194 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:35:11,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:11 WrapperNode [2022-02-21 04:35:11,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:11,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:11,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:35:11,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:35:11,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:11" (1/1) ... [2022-02-21 04:35:11,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:11" (1/1) ... [2022-02-21 04:35:11,233 INFO L137 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2022-02-21 04:35:11,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:11,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:35:11,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:35:11,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:35:11,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:11" (1/1) ... [2022-02-21 04:35:11,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:11" (1/1) ... [2022-02-21 04:35:11,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:11" (1/1) ... [2022-02-21 04:35:11,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:11" (1/1) ... [2022-02-21 04:35:11,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:11" (1/1) ... [2022-02-21 04:35:11,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:11" (1/1) ... [2022-02-21 04:35:11,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:11" (1/1) ... [2022-02-21 04:35:11,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:35:11,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:35:11,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:35:11,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:35:11,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:11" (1/1) ... [2022-02-21 04:35:11,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:11,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:11,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:11,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:35:11,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:35:11,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:35:11,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:35:11,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:35:11,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:35:11,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:35:11,438 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:35:11,440 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:11,680 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:11,684 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:11,686 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 04:35:11,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:11 BoogieIcfgContainer [2022-02-21 04:35:11,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:11,688 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:11,689 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:11,691 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:11,692 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:11,692 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:35:10" (1/3) ... [2022-02-21 04:35:11,693 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@659b8b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:11, skipping insertion in model container [2022-02-21 04:35:11,693 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:11,693 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:11" (2/3) ... [2022-02-21 04:35:11,693 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@659b8b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:11, skipping insertion in model container [2022-02-21 04:35:11,693 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:11,693 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:11" (3/3) ... [2022-02-21 04:35:11,695 INFO L388 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2022-02-21 04:35:11,739 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:11,739 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:11,739 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:11,739 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:11,740 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:11,740 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:11,740 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:11,740 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:11,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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-21 04:35:11,763 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:35:11,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:11,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:11,768 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:35:11,768 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:11,768 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:11,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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-21 04:35:11,771 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:35:11,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:11,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:11,773 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:35:11,773 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:11,778 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 13#L523true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 14#L523-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 6#L528-3true [2022-02-21 04:35:11,779 INFO L793 eck$LassoCheckResult]: Loop: 6#L528-3true assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 10#L528-2true main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6#L528-3true [2022-02-21 04:35:11,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:11,784 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-02-21 04:35:11,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:11,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488726422] [2022-02-21 04:35:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:11,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:11,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:11,914 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:11,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:11,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2022-02-21 04:35:11,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:11,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232364340] [2022-02-21 04:35:11,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:11,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:11,938 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:11,953 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:11,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2022-02-21 04:35:11,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:11,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144849828] [2022-02-21 04:35:11,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:11,986 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:12,000 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:12,270 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:12,271 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:12,271 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:12,271 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:12,271 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:12,271 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:12,272 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:12,272 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:12,272 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration1_Lasso [2022-02-21 04:35:12,272 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:12,272 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:12,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:12,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:12,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:12,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:12,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:12,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:12,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:12,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:12,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:12,758 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:12,761 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:12,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:12,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:12,794 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:12,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:35:12,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:12,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:12,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:12,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:12,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:12,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:12,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:12,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:12,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:12,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:35:12,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:12,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:12,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:12,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:35:12,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:12,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:12,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:12,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:12,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:12,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:12,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:12,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:12,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 04:35:12,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:12,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:12,919 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:12,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:35:12,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:12,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:12,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:12,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:12,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:12,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:12,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:12,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:12,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:12,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:12,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:12,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:12,964 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:12,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:35:12,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:12,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:12,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:12,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:12,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:12,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:12,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:13,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:13,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 04:35:13,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:13,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:13,027 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:13,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:35:13,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:13,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:13,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:13,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:13,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:13,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:13,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:13,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:13,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:13,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:13,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:13,075 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:13,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:35:13,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:13,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:13,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:13,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:13,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:13,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:13,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:13,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:13,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:13,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:13,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:13,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:13,118 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:13,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:35:13,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:13,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:13,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:13,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:13,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:13,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:13,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:13,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:13,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:13,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:13,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:13,166 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:13,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:35:13,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:13,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:13,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:13,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:13,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:13,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:13,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:13,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:13,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:13,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:13,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:13,209 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:13,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:35:13,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:13,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:13,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:13,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:13,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:13,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:13,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:13,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:13,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:13,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:13,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:13,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:13,247 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:13,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:35:13,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:13,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:13,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:13,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:13,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:13,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:13,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:13,277 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:13,330 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-02-21 04:35:13,330 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-02-21 04:35:13,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:13,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:13,359 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:13,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:35:13,388 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:13,395 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 04:35:13,395 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:13,395 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1, ULTIMATE.start_main_~i~1#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 - 2*ULTIMATE.start_main_~i~1#1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 - 2*ULTIMATE.start_main_~array_size~0#1 >= 0] [2022-02-21 04:35:13,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:13,444 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2022-02-21 04:35:13,453 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1;" "main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2022-02-21 04:35:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:13,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:13,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 04:35:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:13,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:13,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {26#unseeded} is VALID [2022-02-21 04:35:13,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {26#unseeded} is VALID [2022-02-21 04:35:13,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#unseeded} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {75#(and unseeded (not (< |ULTIMATE.start_main_~array_size~0#1| 1)))} is VALID [2022-02-21 04:35:13,529 INFO L290 TraceCheckUtils]: 3: Hoare triple {75#(and unseeded (not (< |ULTIMATE.start_main_~array_size~0#1| 1)))} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {60#(and unseeded (>= (+ (* (- 2) |ULTIMATE.start_main_~array_size~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|)) 0))} is VALID [2022-02-21 04:35:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:13,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 04:35:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:13,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:13,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|) (* (- 2) |ULTIMATE.start_main_~i~1#1|))) (>= (+ (* (- 2) |ULTIMATE.start_main_~array_size~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|)) 0))} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {79#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|) (* (- 2) |ULTIMATE.start_main_~i~1#1|))) (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|) (>= (+ (* |ULTIMATE.start_main_~array_size~0#1| (- 2)) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|)) 0))} is VALID [2022-02-21 04:35:13,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {79#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|) (* (- 2) |ULTIMATE.start_main_~i~1#1|))) (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|) (>= (+ (* |ULTIMATE.start_main_~array_size~0#1| (- 2)) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|)) 0))} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {63#(and (>= (+ (* (- 2) |ULTIMATE.start_main_~array_size~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|)) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|) (* (- 2) |ULTIMATE.start_main_~i~1#1|)))) unseeded))} is VALID [2022-02-21 04:35:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:13,583 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-21 04:35:13,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:13,592 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,596 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 04:35:13,597 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) 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-21 04:35:13,684 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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). 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) Result 35 states and 53 transitions. Complement of second has 9 states. [2022-02-21 04:35:13,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:13,684 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:13,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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-21 04:35:13,685 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:35:13,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:13,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:13,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. 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-21 04:35:13,688 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:13,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:13,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:13,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 53 transitions. [2022-02-21 04:35:13,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:13,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:13,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:13,700 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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-21 04:35:13,701 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:35:13,702 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:35:13,702 INFO L70 LassoExtractor]: Start lassoExtractor. 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-21 04:35:13,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:13,704 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:13,704 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 53 transitions. cyclomatic complexity: 22 [2022-02-21 04:35:13,704 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:35:13,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:13,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,705 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:13,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:13,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:13,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,705 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:13,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:13,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:35:13,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,707 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:35:13,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:35:13,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 35 letters. Loop has 35 letters. [2022-02-21 04:35:13,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,707 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 35 letters. Loop has 35 letters. [2022-02-21 04:35:13,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 35 letters. Loop has 35 letters. [2022-02-21 04:35:13,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:13,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,708 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:13,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:13,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:35:13,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,708 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:35:13,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:35:13,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:13,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,709 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:13,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:13,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:13,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,710 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:13,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:13,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:35:13,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,710 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:35:13,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:35:13,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:13,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,711 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:13,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:13,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:13,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,711 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:13,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:13,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:13,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,712 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:13,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:13,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,729 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 3 letters. Loop has 1 letters. [2022-02-21 04:35:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,730 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 1 letters. [2022-02-21 04:35:13,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 1 letters. [2022-02-21 04:35:13,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:13,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,730 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:13,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:13,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:13,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,731 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:13,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:13,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:13,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,750 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:13,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:13,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:13,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,752 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:13,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:13,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:13,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,753 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:13,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:13,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:35:13,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,754 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:35:13,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:35:13,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,755 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:13,759 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-21 04:35:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-21 04:35:13,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:13,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:13,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:13,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:13,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. cyclomatic complexity: 22 [2022-02-21 04:35:13,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:13,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:13,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 18 transitions. [2022-02-21 04:35:13,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 04:35:13,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 04:35:13,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2022-02-21 04:35:13,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:13,778 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 04:35:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2022-02-21 04:35:13,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 04:35:13,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:13,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:13,810 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:13,811 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:13,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:13,814 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2022-02-21 04:35:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2022-02-21 04:35:13,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:13,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:13,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 18 transitions. [2022-02-21 04:35:13,815 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 18 transitions. [2022-02-21 04:35:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:13,815 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2022-02-21 04:35:13,816 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2022-02-21 04:35:13,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:13,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:13,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:13,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-02-21 04:35:13,817 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 04:35:13,817 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 04:35:13,818 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:13,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-02-21 04:35:13,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:13,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:13,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:13,818 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:35:13,818 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:13,819 INFO L791 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 133#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 136#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 137#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 138#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 134#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 135#L515-3 [2022-02-21 04:35:13,825 INFO L793 eck$LassoCheckResult]: Loop: 135#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 141#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 142#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 135#L515-3 [2022-02-21 04:35:13,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:13,825 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2022-02-21 04:35:13,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:13,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413593578] [2022-02-21 04:35:13,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:13,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:13,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {174#true} is VALID [2022-02-21 04:35:13,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {174#true} is VALID [2022-02-21 04:35:13,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {174#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {176#(<= 1 |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-21 04:35:13,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {176#(<= 1 |ULTIMATE.start_main_~array_size~0#1|)} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {177#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-21 04:35:13,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {177#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))} assume !(main_~i~1#1 < main_~array_size~0#1); {175#false} is VALID [2022-02-21 04:35:13,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#false} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {175#false} is VALID [2022-02-21 04:35:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:13,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:13,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413593578] [2022-02-21 04:35:13,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413593578] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:13,879 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:13,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:35:13,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496122647] [2022-02-21 04:35:13,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:13,881 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:13,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:13,882 INFO L85 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2022-02-21 04:35:13,882 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:13,882 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131475165] [2022-02-21 04:35:13,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:13,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:13,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#true} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {180#(<= (+ |ULTIMATE.start_sort_~i~0#1| |ULTIMATE.start_sort_~pass~0#1| 1) |ULTIMATE.start_sort_~n#1|)} is VALID [2022-02-21 04:35:13,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#(<= (+ |ULTIMATE.start_sort_~i~0#1| |ULTIMATE.start_sort_~pass~0#1| 1) |ULTIMATE.start_sort_~n#1|)} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {179#false} is VALID [2022-02-21 04:35:13,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#false} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {179#false} is VALID [2022-02-21 04:35:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:13,909 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:13,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131475165] [2022-02-21 04:35:13,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131475165] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:13,910 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:13,910 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 04:35:13,910 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035197134] [2022-02-21 04:35:13,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:13,911 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:35:13,911 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:13,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:35:13,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:35:13,913 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:13,937 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 04:35:13,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:35:13,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:13,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:13,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2022-02-21 04:35:13,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:35:13,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2022-02-21 04:35:13,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 04:35:13,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 04:35:13,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-02-21 04:35:13,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:13,944 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 04:35:13,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-02-21 04:35:13,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 04:35:13,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:13,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 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-21 04:35:13,946 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 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-21 04:35:13,946 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 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-21 04:35:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:13,950 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 04:35:13,951 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2022-02-21 04:35:13,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:13,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:13,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 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) Second operand 14 states and 19 transitions. [2022-02-21 04:35:13,951 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 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) Second operand 14 states and 19 transitions. [2022-02-21 04:35:13,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:13,952 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 04:35:13,952 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2022-02-21 04:35:13,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:13,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:13,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:13,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 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-21 04:35:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2022-02-21 04:35:13,955 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 04:35:13,955 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 04:35:13,955 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:13,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2022-02-21 04:35:13,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:35:13,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:13,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:13,956 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:35:13,956 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:35:13,956 INFO L791 eck$LassoCheckResult]: Stem: 195#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 196#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 197#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 198#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 201#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 199#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 200#L515-3 [2022-02-21 04:35:13,957 INFO L793 eck$LassoCheckResult]: Loop: 200#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 204#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 205#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 207#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 208#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 206#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 200#L515-3 [2022-02-21 04:35:13,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:13,957 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2022-02-21 04:35:13,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:13,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578754432] [2022-02-21 04:35:13,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:13,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:14,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {240#true} is VALID [2022-02-21 04:35:14,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {240#true} is VALID [2022-02-21 04:35:14,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {242#(<= 1 |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-21 04:35:14,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {242#(<= 1 |ULTIMATE.start_main_~array_size~0#1|)} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {243#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-21 04:35:14,012 INFO L290 TraceCheckUtils]: 4: Hoare triple {243#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))} assume !(main_~i~1#1 < main_~array_size~0#1); {241#false} is VALID [2022-02-21 04:35:14,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {241#false} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {241#false} is VALID [2022-02-21 04:35:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:14,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:14,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578754432] [2022-02-21 04:35:14,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578754432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:14,014 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:14,014 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:35:14,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091020215] [2022-02-21 04:35:14,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:14,017 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:14,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:14,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2022-02-21 04:35:14,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:14,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241475285] [2022-02-21 04:35:14,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:14,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:14,038 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:14,050 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:14,153 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:14,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:35:14,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:35:14,155 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 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-21 04:35:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:14,188 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-21 04:35:14,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:35:14,189 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-21 04:35:14,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:14,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2022-02-21 04:35:14,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:35:14,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2022-02-21 04:35:14,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 04:35:14,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 04:35:14,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2022-02-21 04:35:14,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:14,195 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-02-21 04:35:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2022-02-21 04:35:14,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-02-21 04:35:14,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:14,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:14,196 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:14,197 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:14,197 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-21 04:35:14,197 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-02-21 04:35:14,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:14,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:14,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 19 transitions. [2022-02-21 04:35:14,198 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 19 transitions. [2022-02-21 04:35:14,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:14,198 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-21 04:35:14,199 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-02-21 04:35:14,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:14,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:14,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:14,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2022-02-21 04:35:14,200 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-02-21 04:35:14,200 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-02-21 04:35:14,200 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:14,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2022-02-21 04:35:14,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:35:14,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:14,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:14,201 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:14,201 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:35:14,201 INFO L791 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 262#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 263#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 264#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 267#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 268#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 269#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 265#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 266#L515-3 [2022-02-21 04:35:14,201 INFO L793 eck$LassoCheckResult]: Loop: 266#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 270#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 271#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 273#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 274#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 272#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 266#L515-3 [2022-02-21 04:35:14,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:14,201 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2022-02-21 04:35:14,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:14,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666889230] [2022-02-21 04:35:14,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:14,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:14,214 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:14,231 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:14,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:14,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2022-02-21 04:35:14,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:14,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311608867] [2022-02-21 04:35:14,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:14,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:14,244 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:14,249 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:14,249 INFO L85 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2022-02-21 04:35:14,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:14,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268695988] [2022-02-21 04:35:14,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:14,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:14,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {312#true} is VALID [2022-02-21 04:35:14,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {312#true} is VALID [2022-02-21 04:35:14,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {312#true} is VALID [2022-02-21 04:35:14,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {314#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* |ULTIMATE.start_main_~array_size~0#1| 4)) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 04:35:14,355 INFO L290 TraceCheckUtils]: 4: Hoare triple {314#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* |ULTIMATE.start_main_~array_size~0#1| 4)) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {314#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* |ULTIMATE.start_main_~array_size~0#1| 4)) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 04:35:14,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* |ULTIMATE.start_main_~array_size~0#1| 4)) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {315#(and (= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (<= (+ (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* |ULTIMATE.start_main_~i~1#1| 4)) (+ 4 (* |ULTIMATE.start_main_~array_size~0#1| 4))))} is VALID [2022-02-21 04:35:14,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {315#(and (= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (<= (+ (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* |ULTIMATE.start_main_~i~1#1| 4)) (+ 4 (* |ULTIMATE.start_main_~array_size~0#1| 4))))} assume !(main_~i~1#1 < main_~array_size~0#1); {316#(and (<= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) 4) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 04:35:14,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {316#(and (<= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) 4) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {317#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sort_~x#1.base|) 4))} is VALID [2022-02-21 04:35:14,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {317#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sort_~x#1.base|) 4))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {318#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0) (<= (select |#length| |ULTIMATE.start_sort_~x#1.base|) 4))} is VALID [2022-02-21 04:35:14,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {318#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0) (<= (select |#length| |ULTIMATE.start_sort_~x#1.base|) 4))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {313#false} is VALID [2022-02-21 04:35:14,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {313#false} assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {313#false} is VALID [2022-02-21 04:35:14,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {313#false} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {313#false} is VALID [2022-02-21 04:35:14,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {313#false} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {313#false} is VALID [2022-02-21 04:35:14,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {313#false} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {313#false} is VALID [2022-02-21 04:35:14,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:14,359 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:14,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268695988] [2022-02-21 04:35:14,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268695988] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:35:14,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067108761] [2022-02-21 04:35:14,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:14,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:14,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:14,361 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-21 04:35:14,362 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-21 04:35:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:14,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 04:35:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:14,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:14,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {312#true} is VALID [2022-02-21 04:35:14,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {312#true} is VALID [2022-02-21 04:35:14,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {312#true} is VALID [2022-02-21 04:35:14,538 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {331#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:14,539 INFO L290 TraceCheckUtils]: 4: Hoare triple {331#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {331#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:14,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {338#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:35:14,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {338#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < main_~array_size~0#1); {342#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} is VALID [2022-02-21 04:35:14,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {342#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {346#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 1))} is VALID [2022-02-21 04:35:14,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {346#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 1))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {313#false} is VALID [2022-02-21 04:35:14,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {313#false} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {313#false} is VALID [2022-02-21 04:35:14,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {313#false} assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {313#false} is VALID [2022-02-21 04:35:14,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {313#false} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {313#false} is VALID [2022-02-21 04:35:14,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {313#false} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {313#false} is VALID [2022-02-21 04:35:14,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {313#false} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {313#false} is VALID [2022-02-21 04:35:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:14,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:35:14,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {313#false} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {313#false} is VALID [2022-02-21 04:35:14,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {313#false} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {313#false} is VALID [2022-02-21 04:35:14,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {313#false} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {313#false} is VALID [2022-02-21 04:35:14,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {313#false} assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {313#false} is VALID [2022-02-21 04:35:14,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {313#false} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {313#false} is VALID [2022-02-21 04:35:14,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {380#(not (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {313#false} is VALID [2022-02-21 04:35:14,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {342#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {380#(not (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 04:35:14,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {338#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < main_~array_size~0#1); {342#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} is VALID [2022-02-21 04:35:14,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {338#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:35:14,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {331#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {331#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:14,628 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {331#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:14,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {312#true} is VALID [2022-02-21 04:35:14,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {312#true} is VALID [2022-02-21 04:35:14,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {312#true} is VALID [2022-02-21 04:35:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:14,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067108761] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:35:14,629 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:35:14,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-02-21 04:35:14,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601609787] [2022-02-21 04:35:14,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:35:14,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:14,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 04:35:14,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-21 04:35:14,725 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-21 04:35:14,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:14,934 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-02-21 04:35:14,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 04:35:14,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-21 04:35:14,955 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-21 04:35:14,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2022-02-21 04:35:14,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:35:14,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 17 states and 20 transitions. [2022-02-21 04:35:14,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 04:35:14,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 04:35:14,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2022-02-21 04:35:14,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:14,957 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 04:35:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2022-02-21 04:35:14,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-21 04:35:14,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:14,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 20 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-21 04:35:14,958 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 20 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-21 04:35:14,958 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-21 04:35:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:14,958 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-21 04:35:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-21 04:35:14,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:14,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:14,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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) Second operand 17 states and 20 transitions. [2022-02-21 04:35:14,959 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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) Second operand 17 states and 20 transitions. [2022-02-21 04:35:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:14,959 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-21 04:35:14,959 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-21 04:35:14,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:14,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:14,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:14,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-21 04:35:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-21 04:35:14,961 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 04:35:14,961 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 04:35:14,961 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:35:14,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-02-21 04:35:14,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:35:14,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:14,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:14,962 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:14,962 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:35:14,962 INFO L791 eck$LassoCheckResult]: Stem: 433#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 434#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 437#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 438#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 439#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 440#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 441#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 442#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 448#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 435#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 436#L515-3 [2022-02-21 04:35:14,962 INFO L793 eck$LassoCheckResult]: Loop: 436#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 443#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 444#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 446#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 447#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 445#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 436#L515-3 [2022-02-21 04:35:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:14,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2022-02-21 04:35:14,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:14,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017990850] [2022-02-21 04:35:14,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:14,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:14,975 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:14,982 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:14,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:14,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2022-02-21 04:35:14,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:14,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138598847] [2022-02-21 04:35:14,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:14,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:14,990 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:15,000 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:15,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:15,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2022-02-21 04:35:15,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:15,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42550030] [2022-02-21 04:35:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:15,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:15,037 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:15,048 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:15,400 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:15,400 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:15,400 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:15,400 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:15,401 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:15,401 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,401 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:15,401 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:15,401 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration5_Lasso [2022-02-21 04:35:15,401 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:15,401 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:15,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:15,602 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:15,603 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:15,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:15,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:15,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:15,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:15,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:15,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:15,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:15,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:15,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:15,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:15,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:15,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:15,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:15,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:15,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:15,982 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:15,983 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:15,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,984 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:15,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:35:15,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:15,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:16,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:16,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:16,044 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:16,064 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-02-21 04:35:16,064 INFO L444 ModelExtractionUtils]: 13 out of 40 variables were initially zero. Simplification set additionally 24 variables to zero. [2022-02-21 04:35:16,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:16,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:16,108 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:16,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:35:16,112 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:16,119 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:16,119 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:16,120 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~n#1, ULTIMATE.start_sort_~pass~0#1) = 1*ULTIMATE.start_sort_~n#1 - 1*ULTIMATE.start_sort_~pass~0#1 Supporting invariants [] [2022-02-21 04:35:16,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:16,193 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:35:16,196 INFO L390 LassoCheck]: Loop: "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);" "sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1;" [2022-02-21 04:35:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:16,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {492#unseeded} is VALID [2022-02-21 04:35:16,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {492#unseeded} is VALID [2022-02-21 04:35:16,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {492#unseeded} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {492#unseeded} is VALID [2022-02-21 04:35:16,282 INFO L290 TraceCheckUtils]: 3: Hoare triple {492#unseeded} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {492#unseeded} is VALID [2022-02-21 04:35:16,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {492#unseeded} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {492#unseeded} is VALID [2022-02-21 04:35:16,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {492#unseeded} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {492#unseeded} is VALID [2022-02-21 04:35:16,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {492#unseeded} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {492#unseeded} is VALID [2022-02-21 04:35:16,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {492#unseeded} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {492#unseeded} is VALID [2022-02-21 04:35:16,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {492#unseeded} assume !(main_~i~1#1 < main_~array_size~0#1); {492#unseeded} is VALID [2022-02-21 04:35:16,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {492#unseeded} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {492#unseeded} is VALID [2022-02-21 04:35:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:16,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {495#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 04:35:16,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 04:35:16,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 04:35:16,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 04:35:16,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 04:35:16,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|)) (< |ULTIMATE.start_sort_~pass~0#1| |ULTIMATE.start_sort_~n#1|))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {535#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|))))} is VALID [2022-02-21 04:35:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:16,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:16,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 04:35:16,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,397 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:16,397 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,431 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 28 transitions. Complement of second has 4 states. [2022-02-21 04:35:16,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:16,431 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:16,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:16,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:16,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:16,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:16,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:16,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:16,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2022-02-21 04:35:16,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:16,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:16,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:16,436 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:16,439 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 04:35:16,439 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:16,439 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:16,439 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 04:35:16,441 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:16,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 6 letters. [2022-02-21 04:35:16,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 04:35:16,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 6 letters. [2022-02-21 04:35:16,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:16,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:16,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:16,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:16,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:16,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:16,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 22 letters. Loop has 22 letters. [2022-02-21 04:35:16,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 22 letters. [2022-02-21 04:35:16,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 22 letters. Loop has 22 letters. [2022-02-21 04:35:16,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:16,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:16,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:16,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:16,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:16,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:16,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 6 letters. [2022-02-21 04:35:16,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 04:35:16,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 6 letters. [2022-02-21 04:35:16,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 6 letters. [2022-02-21 04:35:16,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 6 letters. [2022-02-21 04:35:16,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 6 letters. [2022-02-21 04:35:16,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:16,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:16,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:16,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 6 letters. [2022-02-21 04:35:16,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 04:35:16,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 6 letters. [2022-02-21 04:35:16,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:16,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:16,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:16,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:16,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:16,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:16,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:16,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:16,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:16,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:16,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:16,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:16,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:16,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:16,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:16,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:16,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:16,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:16,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,463 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-02-21 04:35:16,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2022-02-21 04:35:16,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:35:16,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 12 letters. [2022-02-21 04:35:16,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 04:35:16,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:16,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2022-02-21 04:35:16,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 04:35:16,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 04:35:16,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2022-02-21 04:35:16,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:35:16,481 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-21 04:35:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2022-02-21 04:35:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-02-21 04:35:16,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:16,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,482 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,482 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,483 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:16,485 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-21 04:35:16,485 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-21 04:35:16,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:16,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:16,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 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 21 states and 27 transitions. [2022-02-21 04:35:16,486 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 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 21 states and 27 transitions. [2022-02-21 04:35:16,486 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:16,487 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-21 04:35:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-21 04:35:16,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:16,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:16,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:16,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-02-21 04:35:16,488 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-21 04:35:16,488 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-21 04:35:16,488 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:35:16,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2022-02-21 04:35:16,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:16,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:16,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:16,489 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:16,489 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:16,489 INFO L791 eck$LassoCheckResult]: Stem: 611#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 612#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 613#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 614#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 617#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 618#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 619#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 620#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 630#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 615#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 616#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 621#L516-3 [2022-02-21 04:35:16,490 INFO L793 eck$LassoCheckResult]: Loop: 621#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 622#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 627#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 621#L516-3 [2022-02-21 04:35:16,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:16,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2022-02-21 04:35:16,491 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:16,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794808640] [2022-02-21 04:35:16,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:16,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:16,521 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:16,530 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:16,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:16,532 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2022-02-21 04:35:16,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:16,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164819521] [2022-02-21 04:35:16,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:16,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:16,543 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:16,553 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:16,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:16,554 INFO L85 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2022-02-21 04:35:16,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:16,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300020662] [2022-02-21 04:35:16,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:16,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:16,578 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:16,602 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:16,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:17,011 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:17,011 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:17,011 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:17,011 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:17,011 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:17,011 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:17,012 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:17,012 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:17,012 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration6_Lasso [2022-02-21 04:35:17,012 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:17,012 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:17,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,316 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:17,318 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:17,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:17,730 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:17,731 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:17,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:17,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:17,732 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:17,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:35:17,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:17,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:17,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:17,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:17,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:17,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:17,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:17,758 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:17,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 04:35:17,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:17,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:17,775 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:17,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:35:17,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:17,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:17,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:17,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:17,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:17,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:17,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:17,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:17,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:17,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:17,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:17,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:17,825 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:17,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:35:17,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:17,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:17,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:17,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:17,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:17,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:17,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:17,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:17,888 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:17,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:17,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:17,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:17,905 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:17,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:35:17,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:17,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:17,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:17,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:17,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:17,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:17,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:17,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:17,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:17,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:17,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:17,956 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:17,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:35:17,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:17,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:17,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:17,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:17,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:17,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:17,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:17,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:17,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:17,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:17,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:17,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:17,999 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:18,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:35:18,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:18,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:18,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:18,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:18,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:18,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:18,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:18,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:18,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:18,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:18,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:18,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:18,033 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:18,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:35:18,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:18,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:18,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:18,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:18,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:18,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:18,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:18,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:18,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:18,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:18,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:18,129 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:18,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:35:18,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:18,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:18,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:18,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:18,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:18,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:18,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:18,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:18,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:18,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:18,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:18,200 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:18,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:35:18,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:18,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:18,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:18,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:18,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:18,221 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:18,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:18,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:18,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:18,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:18,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:18,279 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:18,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 04:35:18,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:18,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:18,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:18,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:18,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:18,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:18,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:18,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:18,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:18,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:18,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:18,355 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:18,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 04:35:18,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:18,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:18,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:18,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:18,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:18,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:18,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:18,420 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:18,454 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-02-21 04:35:18,454 INFO L444 ModelExtractionUtils]: 6 out of 40 variables were initially zero. Simplification set additionally 30 variables to zero. [2022-02-21 04:35:18,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:18,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:18,455 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:18,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 04:35:18,457 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:18,464 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:18,464 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:18,464 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0#1, ULTIMATE.start_sort_~n#1, ULTIMATE.start_sort_~pass~0#1) = -1*ULTIMATE.start_sort_~i~0#1 + 1*ULTIMATE.start_sort_~n#1 - 1*ULTIMATE.start_sort_~pass~0#1 Supporting invariants [] [2022-02-21 04:35:18,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:18,515 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2022-02-21 04:35:18,518 INFO L390 LassoCheck]: Loop: "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1;" [2022-02-21 04:35:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:18,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:18,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:18,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:18,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {742#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {742#unseeded} is VALID [2022-02-21 04:35:18,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {742#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {742#unseeded} is VALID [2022-02-21 04:35:18,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {742#unseeded} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {742#unseeded} is VALID [2022-02-21 04:35:18,569 INFO L290 TraceCheckUtils]: 3: Hoare triple {742#unseeded} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {742#unseeded} is VALID [2022-02-21 04:35:18,569 INFO L290 TraceCheckUtils]: 4: Hoare triple {742#unseeded} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {742#unseeded} is VALID [2022-02-21 04:35:18,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {742#unseeded} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {742#unseeded} is VALID [2022-02-21 04:35:18,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {742#unseeded} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {742#unseeded} is VALID [2022-02-21 04:35:18,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {742#unseeded} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {742#unseeded} is VALID [2022-02-21 04:35:18,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {742#unseeded} assume !(main_~i~1#1 < main_~array_size~0#1); {742#unseeded} is VALID [2022-02-21 04:35:18,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {742#unseeded} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {742#unseeded} is VALID [2022-02-21 04:35:18,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {742#unseeded} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {742#unseeded} is VALID [2022-02-21 04:35:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:18,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:18,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:18,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {745#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1| (* (- 1) |ULTIMATE.start_sort_~i~0#1|)))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {825#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1| (* |ULTIMATE.start_sort_~i~0#1| (- 1)))) (< (+ |ULTIMATE.start_sort_~i~0#1| |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 04:35:18,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1| (* |ULTIMATE.start_sort_~i~0#1| (- 1)))) (< (+ |ULTIMATE.start_sort_~i~0#1| |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|))} assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {825#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1| (* |ULTIMATE.start_sort_~i~0#1| (- 1)))) (< (+ |ULTIMATE.start_sort_~i~0#1| |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 04:35:18,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1| (* |ULTIMATE.start_sort_~i~0#1| (- 1)))) (< (+ |ULTIMATE.start_sort_~i~0#1| |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1|))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {790#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_sort_~pass~0#1|) |ULTIMATE.start_sort_~n#1| (* (- 1) |ULTIMATE.start_sort_~i~0#1|)))) unseeded)} is VALID [2022-02-21 04:35:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:18,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:18,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:18,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:18,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,623 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:18,623 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:18,659 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 50 transitions. Complement of second has 7 states. [2022-02-21 04:35:18,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:18,659 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:18,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. cyclomatic complexity: 9 [2022-02-21 04:35:18,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:18,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:18,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:18,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:18,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:18,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:18,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 50 transitions. [2022-02-21 04:35:18,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:18,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:18,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:18,661 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 26 transitions. cyclomatic complexity: 9 [2022-02-21 04:35:18,662 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:18,662 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:18,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:18,663 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:18,663 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 50 transitions. cyclomatic complexity: 19 [2022-02-21 04:35:18,663 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:18,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:18,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:18,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:18,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:18,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:18,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:18,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:18,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:18,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:18,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 36 letters. Loop has 36 letters. [2022-02-21 04:35:18,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 36 letters. [2022-02-21 04:35:18,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 36 letters. Loop has 36 letters. [2022-02-21 04:35:18,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:35:18,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:35:18,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:35:18,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:18,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:18,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:18,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:18,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:18,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:18,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:18,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:18,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:18,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:18,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:18,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:18,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:18,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:18,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:18,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:18,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:18,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:18,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2022-02-21 04:35:18,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 04:35:18,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2022-02-21 04:35:18,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2022-02-21 04:35:18,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 04:35:18,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 19 Stem has 19 letters. Loop has 3 letters. [2022-02-21 04:35:18,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,673 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-02-21 04:35:18,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:18,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:18,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2022-02-21 04:35:18,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:18,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. cyclomatic complexity: 19 [2022-02-21 04:35:18,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:18,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 34 transitions. [2022-02-21 04:35:18,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 04:35:18,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 04:35:18,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2022-02-21 04:35:18,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:35:18,676 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-02-21 04:35:18,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2022-02-21 04:35:18,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2022-02-21 04:35:18,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:18,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 34 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:18,678 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 34 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:18,678 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:18,679 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:18,679 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-02-21 04:35:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-21 04:35:18,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:18,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:18,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 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 26 states and 34 transitions. [2022-02-21 04:35:18,680 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 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 26 states and 34 transitions. [2022-02-21 04:35:18,681 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:18,681 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-02-21 04:35:18,682 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-21 04:35:18,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:18,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:18,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:18,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-02-21 04:35:18,683 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-02-21 04:35:18,683 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-02-21 04:35:18,683 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:35:18,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-02-21 04:35:18,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:18,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:18,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:18,684 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:18,684 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:18,684 INFO L791 eck$LassoCheckResult]: Stem: 878#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 879#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 880#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 881#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 884#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 885#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 886#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 887#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 897#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 882#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 883#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 890#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 891#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 895#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 896#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 893#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 892#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 888#L516-3 [2022-02-21 04:35:18,684 INFO L793 eck$LassoCheckResult]: Loop: 888#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 889#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 894#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 888#L516-3 [2022-02-21 04:35:18,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:18,685 INFO L85 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2022-02-21 04:35:18,685 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:18,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75751604] [2022-02-21 04:35:18,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:18,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:18,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {1037#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1037#true} is VALID [2022-02-21 04:35:18,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {1037#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1037#true} is VALID [2022-02-21 04:35:18,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {1037#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {1037#true} is VALID [2022-02-21 04:35:18,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {1037#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1039#(and (<= 1 (select |#valid| |ULTIMATE.start_main_~numbers~0#1.base|)) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-21 04:35:18,747 INFO L290 TraceCheckUtils]: 4: Hoare triple {1039#(and (<= 1 (select |#valid| |ULTIMATE.start_main_~numbers~0#1.base|)) (= |ULTIMATE.start_main_~i~1#1| 0))} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1040#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:18,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {1040#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:35:18,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:35:18,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1042#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-21 04:35:18,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !(main_~i~1#1 < main_~array_size~0#1); {1043#(<= |ULTIMATE.start_main_~array_size~0#1| 2)} is VALID [2022-02-21 04:35:18,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#(<= |ULTIMATE.start_main_~array_size~0#1| 2)} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 04:35:18,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 04:35:18,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 04:35:18,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 04:35:18,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 04:35:18,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 04:35:18,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1045#(<= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_~pass~0#1|)} is VALID [2022-02-21 04:35:18,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {1045#(<= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_~pass~0#1|)} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1038#false} is VALID [2022-02-21 04:35:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:18,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:18,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75751604] [2022-02-21 04:35:18,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75751604] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:35:18,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087241499] [2022-02-21 04:35:18,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:18,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:18,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:18,775 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:35:18,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-02-21 04:35:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:18,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 04:35:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:18,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:19,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {1037#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1037#true} is VALID [2022-02-21 04:35:19,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {1037#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1037#true} is VALID [2022-02-21 04:35:19,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {1037#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {1037#true} is VALID [2022-02-21 04:35:19,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {1037#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1058#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:19,078 INFO L290 TraceCheckUtils]: 4: Hoare triple {1058#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1058#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:19,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {1058#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:35:19,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:35:19,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1042#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-21 04:35:19,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !(main_~i~1#1 < main_~array_size~0#1); {1043#(<= |ULTIMATE.start_main_~array_size~0#1| 2)} is VALID [2022-02-21 04:35:19,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#(<= |ULTIMATE.start_main_~array_size~0#1| 2)} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} is VALID [2022-02-21 04:35:19,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} is VALID [2022-02-21 04:35:19,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} is VALID [2022-02-21 04:35:19,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} is VALID [2022-02-21 04:35:19,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} is VALID [2022-02-21 04:35:19,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} is VALID [2022-02-21 04:35:19,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {1077#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1096#(and (<= 2 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} is VALID [2022-02-21 04:35:19,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {1096#(and (<= 2 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~n#1| 2))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1038#false} is VALID [2022-02-21 04:35:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:19,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:35:19,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:19,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {1045#(<= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_~pass~0#1|)} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1038#false} is VALID [2022-02-21 04:35:19,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1045#(<= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_~pass~0#1|)} is VALID [2022-02-21 04:35:19,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 04:35:19,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 04:35:19,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 04:35:19,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 04:35:19,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 04:35:19,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#(<= |ULTIMATE.start_main_~array_size~0#1| 2)} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1044#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 04:35:19,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !(main_~i~1#1 < main_~array_size~0#1); {1043#(<= |ULTIMATE.start_main_~array_size~0#1| 2)} is VALID [2022-02-21 04:35:19,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1042#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-21 04:35:19,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:35:19,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {1058#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1041#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:35:19,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {1058#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1058#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:19,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {1037#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1058#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:19,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {1037#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {1037#true} is VALID [2022-02-21 04:35:19,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {1037#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1037#true} is VALID [2022-02-21 04:35:19,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {1037#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1037#true} is VALID [2022-02-21 04:35:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:19,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087241499] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:35:19,283 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:35:19,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2022-02-21 04:35:19,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946169519] [2022-02-21 04:35:19,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:35:19,284 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:19,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:19,287 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2022-02-21 04:35:19,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:19,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130382348] [2022-02-21 04:35:19,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:19,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:19,311 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:19,320 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:19,436 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:19,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 04:35:19,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-21 04:35:19,438 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:19,643 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-21 04:35:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 04:35:19,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:19,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:19,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2022-02-21 04:35:19,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:19,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 23 states and 28 transitions. [2022-02-21 04:35:19,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 04:35:19,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 04:35:19,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2022-02-21 04:35:19,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:35:19,680 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-02-21 04:35:19,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2022-02-21 04:35:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-02-21 04:35:19,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:19,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 28 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:19,681 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 28 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:19,681 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:19,682 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:19,682 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-02-21 04:35:19,682 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-02-21 04:35:19,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:19,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:19,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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 and 28 transitions. [2022-02-21 04:35:19,683 INFO L87 Difference]: Start difference. First operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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 and 28 transitions. [2022-02-21 04:35:19,683 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:19,683 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-02-21 04:35:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-02-21 04:35:19,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:19,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:19,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:19,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-02-21 04:35:19,684 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 04:35:19,684 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 04:35:19,684 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 04:35:19,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2022-02-21 04:35:19,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:19,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:19,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:19,685 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:19,685 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:19,685 INFO L791 eck$LassoCheckResult]: Stem: 1184#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1188#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1189#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1190#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1191#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1192#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1193#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1203#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1205#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1204#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1186#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1187#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1196#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1197#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1201#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1202#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1199#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1198#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1194#L516-3 [2022-02-21 04:35:19,685 INFO L793 eck$LassoCheckResult]: Loop: 1194#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1195#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1200#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1194#L516-3 [2022-02-21 04:35:19,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:19,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2022-02-21 04:35:19,685 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:19,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263184748] [2022-02-21 04:35:19,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:19,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:19,791 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; {1356#true} is VALID [2022-02-21 04:35:19,792 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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1356#true} is VALID [2022-02-21 04:35:19,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {1356#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {1356#true} is VALID [2022-02-21 04:35:19,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {1356#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1358#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:19,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {1358#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1358#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:19,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {1358#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1359#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-21 04:35:19,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {1359#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1359#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-21 04:35:19,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {1359#(<= 1 |ULTIMATE.start_main_~i~1#1|)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1360#(<= 2 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-21 04:35:19,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {1360#(<= 2 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1361#(<= 3 |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-21 04:35:19,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {1361#(<= 3 |ULTIMATE.start_main_~array_size~0#1|)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1361#(<= 3 |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-21 04:35:19,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {1361#(<= 3 |ULTIMATE.start_main_~array_size~0#1|)} assume !(main_~i~1#1 < main_~array_size~0#1); {1361#(<= 3 |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-21 04:35:19,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {1361#(<= 3 |ULTIMATE.start_main_~array_size~0#1|)} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1362#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= 3 |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 04:35:19,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {1362#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= 3 |ULTIMATE.start_sort_~n#1|))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1363#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= 3 |ULTIMATE.start_sort_~n#1|) (= |ULTIMATE.start_sort_~i~0#1| 0))} is VALID [2022-02-21 04:35:19,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {1363#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= 3 |ULTIMATE.start_sort_~n#1|) (= |ULTIMATE.start_sort_~i~0#1| 0))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1363#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= 3 |ULTIMATE.start_sort_~n#1|) (= |ULTIMATE.start_sort_~i~0#1| 0))} is VALID [2022-02-21 04:35:19,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {1363#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= 3 |ULTIMATE.start_sort_~n#1|) (= |ULTIMATE.start_sort_~i~0#1| 0))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1363#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= 3 |ULTIMATE.start_sort_~n#1|) (= |ULTIMATE.start_sort_~i~0#1| 0))} is VALID [2022-02-21 04:35:19,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {1363#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= 3 |ULTIMATE.start_sort_~n#1|) (= |ULTIMATE.start_sort_~i~0#1| 0))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1364#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= (+ |ULTIMATE.start_sort_~i~0#1| 2) |ULTIMATE.start_sort_~n#1|))} is VALID [2022-02-21 04:35:19,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {1364#(and (= (+ (- 1) |ULTIMATE.start_sort_~pass~0#1|) 0) (<= (+ |ULTIMATE.start_sort_~i~0#1| 2) |ULTIMATE.start_sort_~n#1|))} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1357#false} is VALID [2022-02-21 04:35:19,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {1357#false} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1357#false} is VALID [2022-02-21 04:35:19,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {1357#false} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1357#false} is VALID [2022-02-21 04:35:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:19,799 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:19,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263184748] [2022-02-21 04:35:19,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263184748] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:35:19,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289885457] [2022-02-21 04:35:19,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 04:35:19,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:19,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:19,801 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:35:19,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-02-21 04:35:19,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 04:35:19,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 04:35:19,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 04:35:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:19,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:19,943 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; {1356#true} is VALID [2022-02-21 04:35:19,944 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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1356#true} is VALID [2022-02-21 04:35:19,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {1356#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {1356#true} is VALID [2022-02-21 04:35:19,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {1356#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1356#true} is VALID [2022-02-21 04:35:19,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {1356#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1356#true} is VALID [2022-02-21 04:35:19,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {1356#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1356#true} is VALID [2022-02-21 04:35:19,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {1356#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1356#true} is VALID [2022-02-21 04:35:19,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {1356#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1356#true} is VALID [2022-02-21 04:35:19,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {1356#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1356#true} is VALID [2022-02-21 04:35:19,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {1356#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1356#true} is VALID [2022-02-21 04:35:19,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {1356#true} assume !(main_~i~1#1 < main_~array_size~0#1); {1356#true} is VALID [2022-02-21 04:35:19,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {1356#true} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1356#true} is VALID [2022-02-21 04:35:19,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {1356#true} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} is VALID [2022-02-21 04:35:19,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} is VALID [2022-02-21 04:35:19,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} is VALID [2022-02-21 04:35:19,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1414#(<= |ULTIMATE.start_sort_~i~0#1| 1)} is VALID [2022-02-21 04:35:19,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {1414#(<= |ULTIMATE.start_sort_~i~0#1| 1)} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1418#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 04:35:19,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {1418#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1422#(<= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_~pass~0#1|)} is VALID [2022-02-21 04:35:19,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {1422#(<= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_~pass~0#1|)} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1357#false} is VALID [2022-02-21 04:35:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 04:35:19,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:35:20,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {1422#(<= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_~pass~0#1|)} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1357#false} is VALID [2022-02-21 04:35:20,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {1418#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1422#(<= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_~pass~0#1|)} is VALID [2022-02-21 04:35:20,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {1414#(<= |ULTIMATE.start_sort_~i~0#1| 1)} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1418#(<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~pass~0#1| 1))} is VALID [2022-02-21 04:35:20,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1414#(<= |ULTIMATE.start_sort_~i~0#1| 1)} is VALID [2022-02-21 04:35:20,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} is VALID [2022-02-21 04:35:20,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} is VALID [2022-02-21 04:35:20,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {1356#true} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1404#(<= |ULTIMATE.start_sort_~i~0#1| 0)} is VALID [2022-02-21 04:35:20,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {1356#true} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1356#true} is VALID [2022-02-21 04:35:20,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {1356#true} assume !(main_~i~1#1 < main_~array_size~0#1); {1356#true} is VALID [2022-02-21 04:35:20,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {1356#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1356#true} is VALID [2022-02-21 04:35:20,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {1356#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1356#true} is VALID [2022-02-21 04:35:20,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {1356#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1356#true} is VALID [2022-02-21 04:35:20,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {1356#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1356#true} is VALID [2022-02-21 04:35:20,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {1356#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1356#true} is VALID [2022-02-21 04:35:20,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {1356#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1356#true} is VALID [2022-02-21 04:35:20,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {1356#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1356#true} is VALID [2022-02-21 04:35:20,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {1356#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {1356#true} is VALID [2022-02-21 04:35:20,043 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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1356#true} is VALID [2022-02-21 04:35:20,043 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; {1356#true} is VALID [2022-02-21 04:35:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 04:35:20,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289885457] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:35:20,044 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:35:20,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2022-02-21 04:35:20,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83582163] [2022-02-21 04:35:20,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:35:20,045 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:20,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:20,045 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2022-02-21 04:35:20,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:20,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919546175] [2022-02-21 04:35:20,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:20,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:20,051 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:20,054 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:20,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:20,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 04:35:20,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-02-21 04:35:20,129 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:20,536 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-02-21 04:35:20,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-21 04:35:20,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:20,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2022-02-21 04:35:20,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:20,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 43 states and 56 transitions. [2022-02-21 04:35:20,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 04:35:20,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 04:35:20,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 56 transitions. [2022-02-21 04:35:20,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:35:20,574 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 56 transitions. [2022-02-21 04:35:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 56 transitions. [2022-02-21 04:35:20,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2022-02-21 04:35:20,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:20,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states and 56 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,577 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states and 56 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,578 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,579 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:20,581 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-02-21 04:35:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-02-21 04:35:20,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:20,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:20,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 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 43 states and 56 transitions. [2022-02-21 04:35:20,582 INFO L87 Difference]: Start difference. First operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 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 43 states and 56 transitions. [2022-02-21 04:35:20,588 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:20,594 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-02-21 04:35:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-02-21 04:35:20,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:20,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:20,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:20,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-02-21 04:35:20,596 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-21 04:35:20,596 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-21 04:35:20,596 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 04:35:20,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2022-02-21 04:35:20,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:20,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:20,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:20,598 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:20,598 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:20,598 INFO L791 eck$LassoCheckResult]: Stem: 1544#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1545#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1546#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1547#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1550#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1551#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1552#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1553#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1563#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1566#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1565#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1548#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1549#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1560#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1568#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1562#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1556#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1557#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1564#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1567#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1558#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1559#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1554#L516-3 [2022-02-21 04:35:20,598 INFO L793 eck$LassoCheckResult]: Loop: 1554#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1555#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1561#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1554#L516-3 [2022-02-21 04:35:20,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2022-02-21 04:35:20,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:20,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806186766] [2022-02-21 04:35:20,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:20,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:20,624 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:20,633 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:20,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:20,634 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2022-02-21 04:35:20,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:20,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936714199] [2022-02-21 04:35:20,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:20,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:20,640 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:20,642 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:20,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:20,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 1 times [2022-02-21 04:35:20,642 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:20,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202432896] [2022-02-21 04:35:20,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:20,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:20,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {1777#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1777#true} is VALID [2022-02-21 04:35:20,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {1777#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1777#true} is VALID [2022-02-21 04:35:20,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {1777#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {1777#true} is VALID [2022-02-21 04:35:20,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {1777#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1779#(and (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 04:35:20,921 INFO L290 TraceCheckUtils]: 4: Hoare triple {1779#(and (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1779#(and (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 04:35:20,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {1779#(and (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1780#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 04:35:20,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {1780#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1780#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 04:35:20,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {1780#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1781#(= |ULTIMATE.start_main_~numbers~0#1.offset| 0)} is VALID [2022-02-21 04:35:20,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {1781#(= |ULTIMATE.start_main_~numbers~0#1.offset| 0)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1781#(= |ULTIMATE.start_main_~numbers~0#1.offset| 0)} is VALID [2022-02-21 04:35:20,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {1781#(= |ULTIMATE.start_main_~numbers~0#1.offset| 0)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1781#(= |ULTIMATE.start_main_~numbers~0#1.offset| 0)} is VALID [2022-02-21 04:35:20,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {1781#(= |ULTIMATE.start_main_~numbers~0#1.offset| 0)} assume !(main_~i~1#1 < main_~array_size~0#1); {1781#(= |ULTIMATE.start_main_~numbers~0#1.offset| 0)} is VALID [2022-02-21 04:35:20,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {1781#(= |ULTIMATE.start_main_~numbers~0#1.offset| 0)} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1782#(= |ULTIMATE.start_sort_~x#1.offset| 0)} is VALID [2022-02-21 04:35:20,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {1782#(= |ULTIMATE.start_sort_~x#1.offset| 0)} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1783#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0))} is VALID [2022-02-21 04:35:20,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {1783#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1784#(and (= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset| 4)) |ULTIMATE.start_sort_#t~mem5#1|) (= |ULTIMATE.start_sort_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|))) (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0))} is VALID [2022-02-21 04:35:20,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {1784#(and (= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset| 4)) |ULTIMATE.start_sort_#t~mem5#1|) (= |ULTIMATE.start_sort_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|))) (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1785#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset| 4))))} is VALID [2022-02-21 04:35:20,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {1785#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset| 4))))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1786#(and (= (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|) 4) (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|))))} is VALID [2022-02-21 04:35:20,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {1786#(and (= (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|) 4) (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|))))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1787#(and (= (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|) 4) (= |ULTIMATE.start_sort_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) |ULTIMATE.start_sort_#t~mem4#1|) (= |ULTIMATE.start_sort_~x#1.offset| 0))} is VALID [2022-02-21 04:35:20,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {1787#(and (= (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|) 4) (= |ULTIMATE.start_sort_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) |ULTIMATE.start_sort_#t~mem4#1|) (= |ULTIMATE.start_sort_~x#1.offset| 0))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1786#(and (= (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|) 4) (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|))))} is VALID [2022-02-21 04:35:20,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {1786#(and (= (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|) 4) (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|))))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1788#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 4)))} is VALID [2022-02-21 04:35:20,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {1788#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 4)))} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1788#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 4)))} is VALID [2022-02-21 04:35:20,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {1788#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 4)))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1788#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 4)))} is VALID [2022-02-21 04:35:20,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {1788#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) 4)))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1785#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset| 4))))} is VALID [2022-02-21 04:35:20,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {1785#(and (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset| 4))))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1789#(and (<= |ULTIMATE.start_sort_#t~mem4#1| |ULTIMATE.start_sort_#t~mem5#1|) (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0))} is VALID [2022-02-21 04:35:20,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {1789#(and (<= |ULTIMATE.start_sort_#t~mem4#1| |ULTIMATE.start_sort_#t~mem5#1|) (= |ULTIMATE.start_sort_~x#1.offset| 0) (= |ULTIMATE.start_sort_~i~0#1| 0))} assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1778#false} is VALID [2022-02-21 04:35:20,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {1778#false} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1778#false} is VALID [2022-02-21 04:35:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:20,930 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:20,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202432896] [2022-02-21 04:35:20,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202432896] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:35:20,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223533216] [2022-02-21 04:35:20,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:20,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:20,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:20,932 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:35:20,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-02-21 04:35:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:20,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 04:35:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:21,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:21,234 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-02-21 04:35:21,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2022-02-21 04:35:21,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {1777#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1777#true} is VALID [2022-02-21 04:35:21,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {1777#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1777#true} is VALID [2022-02-21 04:35:21,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {1777#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {1777#true} is VALID [2022-02-21 04:35:21,265 INFO L290 TraceCheckUtils]: 3: Hoare triple {1777#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1802#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:21,265 INFO L290 TraceCheckUtils]: 4: Hoare triple {1802#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1802#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:35:21,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {1802#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1777#true} is VALID [2022-02-21 04:35:21,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {1777#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1777#true} is VALID [2022-02-21 04:35:21,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {1777#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1777#true} is VALID [2022-02-21 04:35:21,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {1777#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1777#true} is VALID [2022-02-21 04:35:21,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {1777#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1777#true} is VALID [2022-02-21 04:35:21,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {1777#true} assume !(main_~i~1#1 < main_~array_size~0#1); {1777#true} is VALID [2022-02-21 04:35:21,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {1777#true} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1777#true} is VALID [2022-02-21 04:35:21,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {1777#true} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1830#(= |ULTIMATE.start_sort_~i~0#1| 0)} is VALID [2022-02-21 04:35:21,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {1830#(= |ULTIMATE.start_sort_~i~0#1| 0)} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1834#(and (<= |ULTIMATE.start_sort_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) |ULTIMATE.start_sort_#t~mem4#1|))} is VALID [2022-02-21 04:35:21,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {1834#(and (<= |ULTIMATE.start_sort_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) |ULTIMATE.start_sort_#t~mem4#1|))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 04:35:21,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 04:35:21,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 04:35:21,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 04:35:21,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 04:35:21,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 04:35:21,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 04:35:21,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1860#(and (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4))) (= |ULTIMATE.start_sort_~i~0#1| 0))} is VALID [2022-02-21 04:35:21,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {1860#(and (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4))) (= |ULTIMATE.start_sort_~i~0#1| 0))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1864#(<= |ULTIMATE.start_sort_#t~mem4#1| |ULTIMATE.start_sort_#t~mem5#1|)} is VALID [2022-02-21 04:35:21,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {1864#(<= |ULTIMATE.start_sort_#t~mem4#1| |ULTIMATE.start_sort_#t~mem5#1|)} assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1778#false} is VALID [2022-02-21 04:35:21,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {1778#false} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1778#false} is VALID [2022-02-21 04:35:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-21 04:35:21,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:35:21,464 INFO L356 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-02-21 04:35:21,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 34 [2022-02-21 04:35:21,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {1778#false} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1778#false} is VALID [2022-02-21 04:35:21,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {1864#(<= |ULTIMATE.start_sort_#t~mem4#1| |ULTIMATE.start_sort_#t~mem5#1|)} assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1778#false} is VALID [2022-02-21 04:35:21,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {1877#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1864#(<= |ULTIMATE.start_sort_#t~mem4#1| |ULTIMATE.start_sort_#t~mem5#1|)} is VALID [2022-02-21 04:35:21,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1877#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ (* |ULTIMATE.start_sort_~i~0#1| 4) |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 04:35:21,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 04:35:21,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 04:35:21,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 04:35:21,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 04:35:21,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 04:35:21,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 04:35:21,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {1902#(or (< |ULTIMATE.start_sort_#t~mem5#1| |ULTIMATE.start_sort_#t~mem4#1|) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4))))} assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; {1838#(<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4)))} is VALID [2022-02-21 04:35:21,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {1830#(= |ULTIMATE.start_sort_~i~0#1| 0)} assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); {1902#(or (< |ULTIMATE.start_sort_#t~mem5#1| |ULTIMATE.start_sort_#t~mem4#1|) (<= (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) |ULTIMATE.start_sort_~x#1.offset|) (select (select |#memory_int| |ULTIMATE.start_sort_~x#1.base|) (+ |ULTIMATE.start_sort_~x#1.offset| 4))))} is VALID [2022-02-21 04:35:21,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {1777#true} assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; {1830#(= |ULTIMATE.start_sort_~i~0#1| 0)} is VALID [2022-02-21 04:35:21,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {1777#true} assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; {1777#true} is VALID [2022-02-21 04:35:21,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {1777#true} assume !(main_~i~1#1 < main_~array_size~0#1); {1777#true} is VALID [2022-02-21 04:35:21,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {1777#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1777#true} is VALID [2022-02-21 04:35:21,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {1777#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1777#true} is VALID [2022-02-21 04:35:21,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {1777#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1777#true} is VALID [2022-02-21 04:35:21,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {1777#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1777#true} is VALID [2022-02-21 04:35:21,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {1777#true} main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1777#true} is VALID [2022-02-21 04:35:21,631 INFO L290 TraceCheckUtils]: 4: Hoare triple {1777#true} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; {1777#true} is VALID [2022-02-21 04:35:21,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {1777#true} call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; {1777#true} is VALID [2022-02-21 04:35:21,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {1777#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {1777#true} is VALID [2022-02-21 04:35:21,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {1777#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1777#true} is VALID [2022-02-21 04:35:21,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {1777#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1777#true} is VALID [2022-02-21 04:35:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 04:35:21,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223533216] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:35:21,632 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:35:21,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 21 [2022-02-21 04:35:21,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622174400] [2022-02-21 04:35:21,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:35:21,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:21,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-21 04:35:21,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-02-21 04:35:21,728 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 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-21 04:35:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:22,212 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-02-21 04:35:22,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 04:35:22,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 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-21 04:35:22,249 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-21 04:35:22,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2022-02-21 04:35:22,250 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 04:35:22,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 58 transitions. [2022-02-21 04:35:22,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-02-21 04:35:22,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-02-21 04:35:22,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2022-02-21 04:35:22,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:35:22,251 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2022-02-21 04:35:22,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2022-02-21 04:35:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-02-21 04:35:22,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:22,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states and 58 transitions. Second operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 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-21 04:35:22,253 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states and 58 transitions. Second operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 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-21 04:35:22,253 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 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-21 04:35:22,253 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:22,254 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2022-02-21 04:35:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2022-02-21 04:35:22,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:22,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:22,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 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 45 states and 58 transitions. [2022-02-21 04:35:22,255 INFO L87 Difference]: Start difference. First operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 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 45 states and 58 transitions. [2022-02-21 04:35:22,255 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:22,257 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2022-02-21 04:35:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2022-02-21 04:35:22,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:22,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:22,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:22,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 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-21 04:35:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-02-21 04:35:22,258 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-02-21 04:35:22,258 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-02-21 04:35:22,258 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 04:35:22,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2022-02-21 04:35:22,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:22,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:22,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:22,259 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:22,259 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:22,259 INFO L791 eck$LassoCheckResult]: Stem: 2004#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2005#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 2006#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2007#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 2010#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2011#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2012#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2013#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2025#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2030#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2029#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2008#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 2009#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2018#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2032#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 2024#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2016#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2017#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2027#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2036#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 2035#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 2034#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2014#L516-3 [2022-02-21 04:35:22,259 INFO L793 eck$LassoCheckResult]: Loop: 2014#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2015#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2023#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2014#L516-3 [2022-02-21 04:35:22,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 2 times [2022-02-21 04:35:22,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:22,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118829401] [2022-02-21 04:35:22,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:22,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,277 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,286 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:22,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:22,286 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2022-02-21 04:35:22,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:22,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87480614] [2022-02-21 04:35:22,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:22,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,292 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,294 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:22,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:22,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 3 times [2022-02-21 04:35:22,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:22,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909577750] [2022-02-21 04:35:22,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:22,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,316 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,327 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:23,263 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:23,263 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:23,263 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:23,263 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:23,263 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:23,263 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,264 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:23,264 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:23,264 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration10_Lasso [2022-02-21 04:35:23,264 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:23,264 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:23,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,741 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* 4 ULTIMATE.start_main_~i~1#1) (- 4) ULTIMATE.start_main_~numbers~0#1.offset))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 04:35:23,744 INFO L158 Benchmark]: Toolchain (without parser) took 12935.75ms. Allocated memory was 86.0MB in the beginning and 234.9MB in the end (delta: 148.9MB). Free memory was 47.0MB in the beginning and 179.5MB in the end (delta: -132.4MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. [2022-02-21 04:35:23,744 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:23,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.61ms. Allocated memory is still 86.0MB. Free memory was 46.8MB in the beginning and 56.6MB in the end (delta: -9.8MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2022-02-21 04:35:23,745 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.11ms. Allocated memory is still 86.0MB. Free memory was 56.6MB in the beginning and 54.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:23,745 INFO L158 Benchmark]: Boogie Preprocessor took 22.45ms. Allocated memory is still 86.0MB. Free memory was 54.5MB in the beginning and 52.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:23,745 INFO L158 Benchmark]: RCFGBuilder took 430.33ms. Allocated memory was 86.0MB in the beginning and 121.6MB in the end (delta: 35.7MB). Free memory was 52.8MB in the beginning and 94.2MB in the end (delta: -41.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 04:35:23,745 INFO L158 Benchmark]: BuchiAutomizer took 12054.65ms. Allocated memory was 121.6MB in the beginning and 234.9MB in the end (delta: 113.2MB). Free memory was 94.2MB in the beginning and 179.5MB in the end (delta: -85.3MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. [2022-02-21 04:35:23,746 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.61ms. Allocated memory is still 86.0MB. Free memory was 46.8MB in the beginning and 56.6MB in the end (delta: -9.8MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.11ms. Allocated memory is still 86.0MB. Free memory was 56.6MB in the beginning and 54.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.45ms. Allocated memory is still 86.0MB. Free memory was 54.5MB in the beginning and 52.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 430.33ms. Allocated memory was 86.0MB in the beginning and 121.6MB in the end (delta: 35.7MB). Free memory was 52.8MB in the beginning and 94.2MB in the end (delta: -41.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 12054.65ms. Allocated memory was 121.6MB in the beginning and 234.9MB in the end (delta: 113.2MB). Free memory was 94.2MB in the beginning and 179.5MB in the end (delta: -85.3MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* 4 ULTIMATE.start_main_~i~1#1) (- 4) ULTIMATE.start_main_~numbers~0#1.offset))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* 4 ULTIMATE.start_main_~i~1#1) (- 4) ULTIMATE.start_main_~numbers~0#1.offset))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 04:35:23,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:23,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:24,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-02-21 04:35:24,378 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-21 04:35:24,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* 4 ULTIMATE.start_main_~i~1#1) (- 4) ULTIMATE.start_main_~numbers~0#1.offset))_1 was not added to the transformula!