./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/max10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/reducercommutativity/max10-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 1223a7fef027dae15fda123c8ce40ec49dc779b7d5d627ded9a670697417439e --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 16:02:01,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 16:02:01,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 16:02:01,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 16:02:01,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 16:02:01,533 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 16:02:01,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 16:02:01,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 16:02:01,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 16:02:01,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 16:02:01,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 16:02:01,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 16:02:01,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 16:02:01,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 16:02:01,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 16:02:01,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 16:02:01,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 16:02:01,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 16:02:01,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 16:02:01,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 16:02:01,544 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 16:02:01,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 16:02:01,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 16:02:01,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 16:02:01,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 16:02:01,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 16:02:01,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 16:02:01,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 16:02:01,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 16:02:01,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 16:02:01,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 16:02:01,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 16:02:01,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 16:02:01,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 16:02:01,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 16:02:01,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 16:02:01,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 16:02:01,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 16:02:01,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 16:02:01,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 16:02:01,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 16:02:01,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 16:02:01,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 16:02:01,597 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 16:02:01,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 16:02:01,597 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 16:02:01,598 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 16:02:01,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 16:02:01,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 16:02:01,599 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 16:02:01,599 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 16:02:01,599 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 16:02:01,600 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 16:02:01,600 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 16:02:01,600 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 16:02:01,600 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 16:02:01,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 16:02:01,601 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 16:02:01,602 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 16:02:01,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 16:02:01,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 16:02:01,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 16:02:01,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 16:02:01,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 16:02:01,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 16:02:01,603 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 16:02:01,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 16:02:01,603 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 16:02:01,603 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 16:02:01,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 16:02:01,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 16:02:01,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 16:02:01,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 16:02:01,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 16:02:01,604 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 16:02:01,605 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 -> 1223a7fef027dae15fda123c8ce40ec49dc779b7d5d627ded9a670697417439e [2022-07-23 16:02:01,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 16:02:01,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 16:02:01,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 16:02:01,841 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 16:02:01,842 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 16:02:01,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max10-1.i [2022-07-23 16:02:01,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8c2c95f4/8d40e2e257754a7199ddf8689b5712fb/FLAG0bb9baec3 [2022-07-23 16:02:02,214 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 16:02:02,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i [2022-07-23 16:02:02,220 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8c2c95f4/8d40e2e257754a7199ddf8689b5712fb/FLAG0bb9baec3 [2022-07-23 16:02:02,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8c2c95f4/8d40e2e257754a7199ddf8689b5712fb [2022-07-23 16:02:02,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 16:02:02,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 16:02:02,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 16:02:02,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 16:02:02,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 16:02:02,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:02:02" (1/1) ... [2022-07-23 16:02:02,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48640ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:02, skipping insertion in model container [2022-07-23 16:02:02,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:02:02" (1/1) ... [2022-07-23 16:02:02,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 16:02:02,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 16:02:02,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i[1290,1303] [2022-07-23 16:02:02,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 16:02:02,839 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 16:02:02,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i[1290,1303] [2022-07-23 16:02:02,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 16:02:02,866 INFO L208 MainTranslator]: Completed translation [2022-07-23 16:02:02,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:02 WrapperNode [2022-07-23 16:02:02,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 16:02:02,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 16:02:02,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 16:02:02,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 16:02:02,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:02" (1/1) ... [2022-07-23 16:02:02,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:02" (1/1) ... [2022-07-23 16:02:02,892 INFO L137 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-07-23 16:02:02,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 16:02:02,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 16:02:02,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 16:02:02,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 16:02:02,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:02" (1/1) ... [2022-07-23 16:02:02,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:02" (1/1) ... [2022-07-23 16:02:02,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:02" (1/1) ... [2022-07-23 16:02:02,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:02" (1/1) ... [2022-07-23 16:02:02,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:02" (1/1) ... [2022-07-23 16:02:02,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:02" (1/1) ... [2022-07-23 16:02:02,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:02" (1/1) ... [2022-07-23 16:02:02,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 16:02:02,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 16:02:02,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 16:02:02,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 16:02:02,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:02" (1/1) ... [2022-07-23 16:02:02,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:02,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:02,956 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-07-23 16:02:02,988 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-07-23 16:02:03,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 16:02:03,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 16:02:03,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 16:02:03,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 16:02:03,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 16:02:03,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 16:02:03,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 16:02:03,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 16:02:03,056 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 16:02:03,058 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 16:02:03,183 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 16:02:03,187 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 16:02:03,188 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-23 16:02:03,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:02:03 BoogieIcfgContainer [2022-07-23 16:02:03,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 16:02:03,190 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 16:02:03,190 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 16:02:03,192 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 16:02:03,193 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:02:03,193 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 04:02:02" (1/3) ... [2022-07-23 16:02:03,194 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5649a170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 04:02:03, skipping insertion in model container [2022-07-23 16:02:03,194 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:02:03,194 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:02" (2/3) ... [2022-07-23 16:02:03,195 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5649a170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 04:02:03, skipping insertion in model container [2022-07-23 16:02:03,195 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:02:03,195 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:02:03" (3/3) ... [2022-07-23 16:02:03,196 INFO L354 chiAutomizerObserver]: Analyzing ICFG max10-1.i [2022-07-23 16:02:03,241 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 16:02:03,241 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 16:02:03,241 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 16:02:03,241 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 16:02:03,241 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 16:02:03,242 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 16:02:03,242 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 16:02:03,242 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 16:02:03,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:03,263 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2022-07-23 16:02:03,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:03,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:03,269 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:02:03,270 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:02:03,270 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 16:02:03,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:03,275 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2022-07-23 16:02:03,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:03,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:03,276 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:02:03,276 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:02:03,280 INFO L752 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 16#L34-3true [2022-07-23 16:02:03,281 INFO L754 eck$LassoCheckResult]: Loop: 16#L34-3true assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 10#L34-2true main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16#L34-3true [2022-07-23 16:02:03,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:03,290 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-23 16:02:03,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:03,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743482576] [2022-07-23 16:02:03,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:03,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:03,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:03,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:03,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:03,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-23 16:02:03,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:03,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535483841] [2022-07-23 16:02:03,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:03,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:03,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:03,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:03,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:03,448 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-23 16:02:03,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:03,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363366138] [2022-07-23 16:02:03,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:03,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:03,469 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:03,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:03,720 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:02:03,720 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:02:03,720 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:02:03,721 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:02:03,721 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:02:03,721 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:03,721 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:02:03,721 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:02:03,722 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration1_Lasso [2022-07-23 16:02:03,722 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:02:03,722 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:02:03,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:03,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:04,174 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 16:02:04,177 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 16:02:04,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:04,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:04,179 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-07-23 16:02:04,180 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-07-23 16:02:04,182 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-07-23 16:02:04,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:04,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:02:04,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:04,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:04,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:04,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:02:04,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:02:04,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:04,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:04,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:04,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:04,232 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-07-23 16:02:04,234 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-07-23 16:02:04,235 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-07-23 16:02:04,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:04,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:02:04,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:04,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:04,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:04,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:02:04,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:02:04,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:04,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:04,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:04,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:04,269 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-07-23 16:02:04,270 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-07-23 16:02:04,276 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-07-23 16:02:04,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:04,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:02:04,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:04,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:04,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:04,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:02:04,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:02:04,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:04,314 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-07-23 16:02:04,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:04,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:04,316 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-07-23 16:02:04,317 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-07-23 16:02:04,318 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-07-23 16:02:04,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:04,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:04,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:04,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:04,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:04,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:04,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:04,358 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-07-23 16:02:04,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:04,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:04,360 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-07-23 16:02:04,361 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-07-23 16:02:04,362 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-07-23 16:02:04,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:04,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:02:04,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:04,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:04,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:04,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:02:04,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:02:04,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:04,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-23 16:02:04,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:04,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:04,401 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-07-23 16:02:04,403 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-07-23 16:02:04,405 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-07-23 16:02:04,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:04,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:02:04,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:04,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:04,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:04,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:02:04,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:02:04,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:04,429 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-07-23 16:02:04,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:04,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:04,431 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-07-23 16:02:04,432 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-07-23 16:02:04,433 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-07-23 16:02:04,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:04,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:04,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:04,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:04,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:04,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:04,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:04,483 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-07-23 16:02:04,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:04,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:04,484 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-07-23 16:02:04,488 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-07-23 16:02:04,489 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-07-23 16:02:04,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:04,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:04,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:04,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:04,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:04,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:04,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:04,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-23 16:02:04,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:04,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:04,532 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-07-23 16:02:04,533 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-07-23 16:02:04,534 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-07-23 16:02:04,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:04,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:04,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:04,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:04,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:04,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:04,552 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 16:02:04,598 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-23 16:02:04,598 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-23 16:02:04,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:04,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:04,600 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-07-23 16:02:04,601 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-07-23 16:02:04,603 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 16:02:04,625 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 16:02:04,625 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 16:02:04,625 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2022-07-23 16:02:04,644 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-07-23 16:02:04,657 INFO L293 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-07-23 16:02:04,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:04,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 16:02:04,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:02:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:04,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 16:02:04,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:02:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:04,781 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-07-23 16:02:04,782 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:04,872 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 84 states and 119 transitions. Complement of second has 8 states. [2022-07-23 16:02:04,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 16:02:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-07-23 16:02:04,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-23 16:02:04,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:02:04,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-23 16:02:04,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:02:04,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-23 16:02:04,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:02:04,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 119 transitions. [2022-07-23 16:02:04,885 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-23 16:02:04,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 25 states and 33 transitions. [2022-07-23 16:02:04,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-07-23 16:02:04,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-07-23 16:02:04,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2022-07-23 16:02:04,889 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-07-23 16:02:04,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:02:04,891 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-07-23 16:02:04,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2022-07-23 16:02:04,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-23 16:02:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-07-23 16:02:04,929 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-07-23 16:02:04,930 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-07-23 16:02:04,930 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 16:02:04,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2022-07-23 16:02:04,932 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-23 16:02:04,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:04,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:04,932 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-23 16:02:04,932 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 16:02:04,933 INFO L752 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 178#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 188#L34-3 assume !(main_~i~1#1 < 10); 181#L34-4 assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 182#L20-3 [2022-07-23 16:02:04,933 INFO L754 eck$LassoCheckResult]: Loop: 182#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 195#L21 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 196#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 197#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 182#L20-3 [2022-07-23 16:02:04,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:04,935 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-07-23 16:02:04,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:04,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221301863] [2022-07-23 16:02:04,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:04,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:04,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:02:04,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221301863] [2022-07-23 16:02:04,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221301863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 16:02:04,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 16:02:04,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 16:02:04,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693797457] [2022-07-23 16:02:04,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 16:02:04,967 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:02:04,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:04,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2022-07-23 16:02:04,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:04,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870799210] [2022-07-23 16:02:04,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:04,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:04,973 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:04,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:05,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:02:05,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 16:02:05,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 16:02:05,015 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:02:05,024 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-07-23 16:02:05,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 16:02:05,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2022-07-23 16:02:05,026 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-23 16:02:05,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2022-07-23 16:02:05,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-07-23 16:02:05,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-07-23 16:02:05,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2022-07-23 16:02:05,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:02:05,027 INFO L369 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-07-23 16:02:05,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2022-07-23 16:02:05,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-07-23 16:02:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-07-23 16:02:05,029 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-07-23 16:02:05,029 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-07-23 16:02:05,029 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 16:02:05,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2022-07-23 16:02:05,030 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-23 16:02:05,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:05,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:05,030 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-23 16:02:05,031 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 16:02:05,031 INFO L752 eck$LassoCheckResult]: Stem: 234#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 235#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 245#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 248#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 249#L34-3 assume !(main_~i~1#1 < 10); 238#L34-4 assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 239#L20-3 [2022-07-23 16:02:05,031 INFO L754 eck$LassoCheckResult]: Loop: 239#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 252#L21 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 253#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 254#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 239#L20-3 [2022-07-23 16:02:05,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:05,031 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2022-07-23 16:02:05,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:05,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910110961] [2022-07-23 16:02:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:05,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:05,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:05,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:02:05,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910110961] [2022-07-23 16:02:05,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910110961] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:02:05,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10019884] [2022-07-23 16:02:05,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:05,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:02:05,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:05,062 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:02:05,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-23 16:02:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:05,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 16:02:05,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:02:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:05,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:02:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:05,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10019884] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:02:05,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:02:05,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-23 16:02:05,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637212524] [2022-07-23 16:02:05,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:02:05,136 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:02:05,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:05,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2022-07-23 16:02:05,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:05,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689143641] [2022-07-23 16:02:05,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:05,140 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:05,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:05,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:02:05,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 16:02:05,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-23 16:02:05,191 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:02:05,220 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-07-23 16:02:05,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 16:02:05,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2022-07-23 16:02:05,224 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-23 16:02:05,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. [2022-07-23 16:02:05,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-07-23 16:02:05,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-07-23 16:02:05,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2022-07-23 16:02:05,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:02:05,225 INFO L369 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-23 16:02:05,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2022-07-23 16:02:05,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-23 16:02:05,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:05,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-07-23 16:02:05,230 INFO L392 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-23 16:02:05,230 INFO L374 stractBuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-23 16:02:05,230 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 16:02:05,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2022-07-23 16:02:05,232 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-23 16:02:05,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:05,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:05,232 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2022-07-23 16:02:05,232 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 16:02:05,233 INFO L752 eck$LassoCheckResult]: Stem: 330#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 331#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 341#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 344#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 345#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 353#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 358#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 357#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 356#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 355#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 354#L34-3 assume !(main_~i~1#1 < 10); 334#L34-4 assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 335#L20-3 [2022-07-23 16:02:05,233 INFO L754 eck$LassoCheckResult]: Loop: 335#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 348#L21 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 349#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 350#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 335#L20-3 [2022-07-23 16:02:05,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:05,233 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2022-07-23 16:02:05,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:05,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654575201] [2022-07-23 16:02:05,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:05,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:05,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:02:05,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654575201] [2022-07-23 16:02:05,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654575201] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:02:05,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125866502] [2022-07-23 16:02:05,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 16:02:05,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:02:05,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:05,305 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-07-23 16:02:05,306 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-07-23 16:02:05,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 16:02:05,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 16:02:05,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 16:02:05,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:02:05,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:05,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:02:05,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:05,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125866502] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:02:05,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:02:05,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-23 16:02:05,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622908907] [2022-07-23 16:02:05,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:02:05,404 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:02:05,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:05,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2022-07-23 16:02:05,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:05,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597009217] [2022-07-23 16:02:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:05,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:05,408 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:05,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:05,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:02:05,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 16:02:05,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-23 16:02:05,445 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-07-23 16:02:05,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:02:05,472 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-07-23 16:02:05,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 16:02:05,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2022-07-23 16:02:05,473 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-23 16:02:05,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 50 transitions. [2022-07-23 16:02:05,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-07-23 16:02:05,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-07-23 16:02:05,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2022-07-23 16:02:05,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:02:05,474 INFO L369 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-07-23 16:02:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2022-07-23 16:02:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-23 16:02:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-07-23 16:02:05,476 INFO L392 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-07-23 16:02:05,476 INFO L374 stractBuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-07-23 16:02:05,476 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 16:02:05,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2022-07-23 16:02:05,477 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-23 16:02:05,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:05,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:05,477 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2022-07-23 16:02:05,477 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 16:02:05,477 INFO L752 eck$LassoCheckResult]: Stem: 488#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 489#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 497#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 509#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 510#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 500#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 501#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 526#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 525#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 524#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 523#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 522#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 521#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 520#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 519#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 518#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 517#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 516#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 515#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 514#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 513#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 512#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 511#L34-3 assume !(main_~i~1#1 < 10); 490#L34-4 assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 491#L20-3 [2022-07-23 16:02:05,477 INFO L754 eck$LassoCheckResult]: Loop: 491#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 504#L21 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 505#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 506#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 491#L20-3 [2022-07-23 16:02:05,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:05,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2022-07-23 16:02:05,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:05,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780654435] [2022-07-23 16:02:05,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:05,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:05,496 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:05,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:05,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:05,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2022-07-23 16:02:05,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:05,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693791506] [2022-07-23 16:02:05,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:05,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:05,514 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:05,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:05,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:05,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1776090044, now seen corresponding path program 1 times [2022-07-23 16:02:05,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:05,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893541665] [2022-07-23 16:02:05,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:05,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:05,550 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:05,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:09,173 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:02:09,173 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:02:09,173 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:02:09,173 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:02:09,173 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:02:09,173 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:09,173 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:02:09,173 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:02:09,173 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration5_Lasso [2022-07-23 16:02:09,173 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:02:09,174 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:02:09,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:09,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:09,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:09,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:09,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:09,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:09,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:09,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:09,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:09,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:09,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:09,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:09,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:09,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:09,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:09,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:09,555 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) 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:109) 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:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) 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-07-23 16:02:09,558 INFO L158 Benchmark]: Toolchain (without parser) took 6922.50ms. Allocated memory was 117.4MB in the beginning and 153.1MB in the end (delta: 35.7MB). Free memory was 78.8MB in the beginning and 45.0MB in the end (delta: 33.7MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. [2022-07-23 16:02:09,558 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 117.4MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 16:02:09,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.74ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 90.7MB in the end (delta: -12.1MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-07-23 16:02:09,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.59ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 88.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 16:02:09,559 INFO L158 Benchmark]: Boogie Preprocessor took 27.35ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 87.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 16:02:09,578 INFO L158 Benchmark]: RCFGBuilder took 267.28ms. Allocated memory is still 117.4MB. Free memory was 87.5MB in the beginning and 74.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-23 16:02:09,579 INFO L158 Benchmark]: BuchiAutomizer took 6367.06ms. Allocated memory was 117.4MB in the beginning and 153.1MB in the end (delta: 35.7MB). Free memory was 74.5MB in the beginning and 45.0MB in the end (delta: 29.5MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2022-07-23 16:02:09,581 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.54ms. Allocated memory is still 117.4MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.74ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 90.7MB in the end (delta: -12.1MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.59ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 88.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.35ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 87.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 267.28ms. Allocated memory is still 117.4MB. Free memory was 87.5MB in the beginning and 74.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 6367.06ms. Allocated memory was 117.4MB in the beginning and 153.1MB in the end (delta: 35.7MB). Free memory was 74.5MB in the beginning and 45.0MB in the end (delta: 29.5MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-23 16:02:09,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-23 16:02:09,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:10,033 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: IllegalArgumentException: null