./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d63463173b27a3cdf96cbee1d161c9afc7e48dc9addc6b012fc924aa2db5e8d7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:31:40,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:31:40,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:31:40,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:31:40,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:31:40,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:31:40,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:31:40,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:31:40,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:31:40,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:31:40,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:31:40,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:31:40,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:31:40,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:31:40,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:31:40,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:31:40,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:31:40,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:31:40,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:31:40,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:31:40,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:31:40,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:31:40,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:31:40,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:31:40,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:31:40,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:31:40,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:31:40,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:31:40,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:31:40,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:31:40,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:31:40,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:31:40,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:31:40,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:31:40,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:31:40,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:31:40,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:31:40,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:31:40,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:31:40,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:31:40,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:31:40,885 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:31:40,907 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:31:40,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:31:40,908 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:31:40,908 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:31:40,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:31:40,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:31:40,909 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:31:40,910 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:31:40,910 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:31:40,910 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:31:40,910 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:31:40,910 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:31:40,910 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:31:40,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:31:40,911 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:31:40,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:31:40,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:31:40,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:31:40,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:31:40,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:31:40,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:31:40,912 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:31:40,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:31:40,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:31:40,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:31:40,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:31:40,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:31:40,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:31:40,913 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:31:40,913 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d63463173b27a3cdf96cbee1d161c9afc7e48dc9addc6b012fc924aa2db5e8d7 [2022-02-21 03:31:41,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:31:41,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:31:41,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:31:41,124 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:31:41,126 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:31:41,127 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i [2022-02-21 03:31:41,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04b0607fe/48f1c4d8d3164aa4a12326347a111bad/FLAG25748941f [2022-02-21 03:31:41,544 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:31:41,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i [2022-02-21 03:31:41,558 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04b0607fe/48f1c4d8d3164aa4a12326347a111bad/FLAG25748941f [2022-02-21 03:31:41,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04b0607fe/48f1c4d8d3164aa4a12326347a111bad [2022-02-21 03:31:41,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:31:41,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:31:41,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:31:41,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:31:41,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:31:41,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:31:41" (1/1) ... [2022-02-21 03:31:41,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b66252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:41, skipping insertion in model container [2022-02-21 03:31:41,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:31:41" (1/1) ... [2022-02-21 03:31:41,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:31:41,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:31:42,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:31:42,249 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:31:42,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:31:42,305 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:31:42,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:42 WrapperNode [2022-02-21 03:31:42,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:31:42,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:31:42,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:31:42,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:31:42,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:42" (1/1) ... [2022-02-21 03:31:42,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:42" (1/1) ... [2022-02-21 03:31:42,365 INFO L137 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-02-21 03:31:42,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:31:42,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:31:42,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:31:42,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:31:42,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:42" (1/1) ... [2022-02-21 03:31:42,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:42" (1/1) ... [2022-02-21 03:31:42,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:42" (1/1) ... [2022-02-21 03:31:42,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:42" (1/1) ... [2022-02-21 03:31:42,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:42" (1/1) ... [2022-02-21 03:31:42,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:42" (1/1) ... [2022-02-21 03:31:42,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:42" (1/1) ... [2022-02-21 03:31:42,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:31:42,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:31:42,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:31:42,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:31:42,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:42" (1/1) ... [2022-02-21 03:31:42,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:42,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:42,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:42,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:31:42,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:31:42,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:31:42,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:31:42,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:31:42,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:31:42,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:31:42,580 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:31:42,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:31:42,709 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:31:42,713 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:31:42,714 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:31:42,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:31:42 BoogieIcfgContainer [2022-02-21 03:31:42,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:31:42,716 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:31:42,716 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:31:42,718 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:31:42,719 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:31:42,719 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:31:41" (1/3) ... [2022-02-21 03:31:42,720 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@371b9688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:31:42, skipping insertion in model container [2022-02-21 03:31:42,721 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:31:42,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:42" (2/3) ... [2022-02-21 03:31:42,721 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@371b9688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:31:42, skipping insertion in model container [2022-02-21 03:31:42,721 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:31:42,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:31:42" (3/3) ... [2022-02-21 03:31:42,722 INFO L388 chiAutomizerObserver]: Analyzing ICFG array03-alloca-1.i [2022-02-21 03:31:42,753 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:31:42,753 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:31:42,753 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:31:42,754 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:31:42,754 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:31:42,754 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:31:42,754 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:31:42,754 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:31:42,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:42,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:31:42,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:42,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:42,790 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:31:42,790 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:31:42,790 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:31:42,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:42,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:31:42,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:42,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:42,796 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:31:42,803 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:31:42,808 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 15#L567true assume !(main_~array_size~0#1 < 1); 16#L567-2true call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 8#L551-3true [2022-02-21 03:31:42,809 INFO L793 eck$LassoCheckResult]: Loop: 8#L551-3true assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11#L553true assume 0 == test_fun_#t~mem3#1;havoc test_fun_#t~mem3#1;test_fun_~res~0#1 := 1; 9#L558-2true assume !true; 7#L558-3true call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13#L551-2true test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 8#L551-3true [2022-02-21 03:31:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:42,813 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-02-21 03:31:42,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:42,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144046003] [2022-02-21 03:31:42,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:42,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:42,927 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:42,971 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:42,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:42,977 INFO L85 PathProgramCache]: Analyzing trace with hash 44963621, now seen corresponding path program 1 times [2022-02-21 03:31:42,977 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:42,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258218816] [2022-02-21 03:31:42,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:42,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:43,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#true} assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {21#true} is VALID [2022-02-21 03:31:43,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume 0 == test_fun_#t~mem3#1;havoc test_fun_#t~mem3#1;test_fun_~res~0#1 := 1; {21#true} is VALID [2022-02-21 03:31:43,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-02-21 03:31:43,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#false} call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {22#false} is VALID [2022-02-21 03:31:43,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {22#false} test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; {22#false} is VALID [2022-02-21 03:31:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:31:43,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:43,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258218816] [2022-02-21 03:31:43,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258218816] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:43,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:43,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:31:43,051 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307829118] [2022-02-21 03:31:43,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:43,057 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:31:43,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:43,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:31:43,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:31:43,093 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:43,128 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-21 03:31:43,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:31:43,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:43,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:43,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2022-02-21 03:31:43,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:31:43,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2022-02-21 03:31:43,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:31:43,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:31:43,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2022-02-21 03:31:43,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:43,155 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-02-21 03:31:43,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2022-02-21 03:31:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-21 03:31:43,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:43,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:43,182 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:43,183 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:43,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:43,185 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2022-02-21 03:31:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-02-21 03:31:43,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:43,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:43,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 15 transitions. [2022-02-21 03:31:43,196 INFO L87 Difference]: Start difference. First operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 15 transitions. [2022-02-21 03:31:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:43,199 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2022-02-21 03:31:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-02-21 03:31:43,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:43,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:43,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:43,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2022-02-21 03:31:43,205 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-02-21 03:31:43,205 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-02-21 03:31:43,205 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:31:43,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2022-02-21 03:31:43,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:31:43,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:43,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:43,209 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:31:43,210 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:31:43,211 INFO L791 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 42#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 47#L567 assume !(main_~array_size~0#1 < 1); 48#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 44#L551-3 [2022-02-21 03:31:43,211 INFO L793 eck$LassoCheckResult]: Loop: 44#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 38#L553 assume 0 == test_fun_#t~mem3#1;havoc test_fun_#t~mem3#1;test_fun_~res~0#1 := 1; 39#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45#L558 assume !(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1; 46#L558-3 call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 43#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44#L551-3 [2022-02-21 03:31:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:43,212 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2022-02-21 03:31:43,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:43,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127449749] [2022-02-21 03:31:43,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:43,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:43,239 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:43,252 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:43,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1393657929, now seen corresponding path program 1 times [2022-02-21 03:31:43,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:43,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936372994] [2022-02-21 03:31:43,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:43,292 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:43,300 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:43,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:43,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1898369747, now seen corresponding path program 1 times [2022-02-21 03:31:43,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:43,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011627989] [2022-02-21 03:31:43,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:43,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:43,337 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:43,357 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:43,669 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:31:43,670 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:31:43,670 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:31:43,670 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:31:43,670 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:31:43,670 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:43,671 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:31:43,671 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:31:43,671 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-1.i_Iteration2_Lasso [2022-02-21 03:31:43,671 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:31:43,671 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:31:43,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:43,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:43,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:43,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:43,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:43,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:43,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:43,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:43,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:43,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:43,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:43,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:43,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:43,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:43,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:44,172 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:31:44,175 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:31:44,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:44,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:44,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:44,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:44,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:44,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:44,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:44,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:44,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:44,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:44,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:31:44,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:44,236 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-02-21 03:31:44,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:44,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:44,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:44,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:31:44,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:44,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:44,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:44,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:44,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:44,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:44,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:44,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:44,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:44,310 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-02-21 03:31:44,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:44,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:44,312 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:44,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:31:44,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:44,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:44,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:44,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:44,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:44,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:44,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:44,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:44,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:44,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:44,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:44,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:44,384 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:44,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:31:44,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:44,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:44,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:44,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:44,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:44,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:44,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:44,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:44,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:44,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:31:44,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:44,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:44,412 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:44,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:31:44,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:44,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:44,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:44,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:44,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:44,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:44,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:44,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:44,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:44,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:44,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:44,452 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:44,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:31:44,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:44,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:44,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:44,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:44,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:44,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:44,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:44,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:44,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:44,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:44,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:44,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:44,525 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:44,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:31:44,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:44,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:44,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:44,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:44,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:44,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:44,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:44,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:44,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:44,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:44,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:44,572 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:44,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:31:44,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:44,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:44,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:44,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:44,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:44,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:44,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:44,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:44,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:44,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:44,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:44,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:44,602 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:44,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:31:44,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:44,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:44,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:44,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:44,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:44,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:44,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:44,644 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:31:44,671 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-02-21 03:31:44,672 INFO L444 ModelExtractionUtils]: 11 out of 34 variables were initially zero. Simplification set additionally 19 variables to zero. [2022-02-21 03:31:44,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:44,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:44,695 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:44,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:31:44,739 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:31:44,764 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:31:44,764 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:31:44,766 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_test_fun_~a#1.base)_1, ULTIMATE.start_test_fun_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_test_fun_~a#1.base)_1 - 4*ULTIMATE.start_test_fun_~i~0#1 Supporting invariants [1*ULTIMATE.start_test_fun_~a#1.offset >= 0] [2022-02-21 03:31:44,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:44,832 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2022-02-21 03:31:44,840 INFO L390 LassoCheck]: Loop: "assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume 0 == test_fun_#t~mem3#1;havoc test_fun_#t~mem3#1;test_fun_~res~0#1 := 1;" "call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;" "call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1;" [2022-02-21 03:31:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:44,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:44,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:31:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:44,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:44,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {80#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {80#unseeded} is VALID [2022-02-21 03:31:44,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {80#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {80#unseeded} is VALID [2022-02-21 03:31:44,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {80#unseeded} assume !(main_~array_size~0#1 < 1); {80#unseeded} is VALID [2022-02-21 03:31:44,908 INFO L290 TraceCheckUtils]: 3: Hoare triple {80#unseeded} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; {114#(and unseeded (>= |ULTIMATE.start_test_fun_~a#1.offset| 0))} is VALID [2022-02-21 03:31:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:44,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:31:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:44,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:45,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {115#(and (>= oldRank0 (+ (* (- 4) |ULTIMATE.start_test_fun_~i~0#1|) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|))) (>= |ULTIMATE.start_test_fun_~a#1.offset| 0))} assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {132#(and (>= oldRank0 (+ (* (- 4) |ULTIMATE.start_test_fun_~i~0#1|) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|))) (>= |ULTIMATE.start_test_fun_~a#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|)))} is VALID [2022-02-21 03:31:45,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#(and (>= oldRank0 (+ (* (- 4) |ULTIMATE.start_test_fun_~i~0#1|) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|))) (>= |ULTIMATE.start_test_fun_~a#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|)))} assume 0 == test_fun_#t~mem3#1;havoc test_fun_#t~mem3#1;test_fun_~res~0#1 := 1; {132#(and (>= oldRank0 (+ (* (- 4) |ULTIMATE.start_test_fun_~i~0#1|) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|))) (>= |ULTIMATE.start_test_fun_~a#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|)))} is VALID [2022-02-21 03:31:45,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#(and (>= oldRank0 (+ (* (- 4) |ULTIMATE.start_test_fun_~i~0#1|) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|))) (>= |ULTIMATE.start_test_fun_~a#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|)))} call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {132#(and (>= oldRank0 (+ (* (- 4) |ULTIMATE.start_test_fun_~i~0#1|) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|))) (>= |ULTIMATE.start_test_fun_~a#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|)))} is VALID [2022-02-21 03:31:45,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {132#(and (>= oldRank0 (+ (* (- 4) |ULTIMATE.start_test_fun_~i~0#1|) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|))) (>= |ULTIMATE.start_test_fun_~a#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|)))} assume !(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1; {132#(and (>= oldRank0 (+ (* (- 4) |ULTIMATE.start_test_fun_~i~0#1|) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|))) (>= |ULTIMATE.start_test_fun_~a#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|)))} is VALID [2022-02-21 03:31:45,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {132#(and (>= oldRank0 (+ (* (- 4) |ULTIMATE.start_test_fun_~i~0#1|) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|))) (>= |ULTIMATE.start_test_fun_~a#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|)))} call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {132#(and (>= oldRank0 (+ (* (- 4) |ULTIMATE.start_test_fun_~i~0#1|) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|))) (>= |ULTIMATE.start_test_fun_~a#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|)))} is VALID [2022-02-21 03:31:45,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#(and (>= oldRank0 (+ (* (- 4) |ULTIMATE.start_test_fun_~i~0#1|) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|))) (>= |ULTIMATE.start_test_fun_~a#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|)))} test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; {117#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 4) |ULTIMATE.start_test_fun_~i~0#1|) (select |#length| |ULTIMATE.start_test_fun_~a#1.base|))))) (>= |ULTIMATE.start_test_fun_~a#1.offset| 0))} is VALID [2022-02-21 03:31:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:31:45,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:45,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:45,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:31:45,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,039 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:31:45,039 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:45,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:45,136 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 18 states and 26 transitions. Complement of second has 4 states. [2022-02-21 03:31:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:31:45,136 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:45,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 03:31:45,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:45,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:45,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:45,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:45,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:45,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:45,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2022-02-21 03:31:45,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:45,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:45,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:45,139 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 03:31:45,140 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:31:45,140 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:45,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:45,141 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:31:45,141 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 26 transitions. cyclomatic complexity: 10 [2022-02-21 03:31:45,141 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:31:45,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:31:45,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:31:45,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:31:45,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:45,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:45,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:45,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:31:45,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:31:45,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:31:45,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:31:45,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:31:45,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:31:45,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:31:45,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:31:45,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:31:45,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:31:45,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:31:45,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:31:45,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:31:45,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:31:45,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:31:45,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:31:45,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:31:45,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:31:45,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:31:45,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:31:45,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:31:45,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:31:45,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:31:45,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:31:45,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:31:45,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:31:45,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:31:45,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:45,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:45,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:45,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:31:45,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:31:45,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:31:45,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:45,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:45,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:45,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:31:45,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:31:45,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:31:45,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:45,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:45,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:45,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,148 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-02-21 03:31:45,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:31:45,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:31:45,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 12 letters. [2022-02-21 03:31:45,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:45,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 26 transitions. cyclomatic complexity: 10 [2022-02-21 03:31:45,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:45,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 24 transitions. [2022-02-21 03:31:45,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:31:45,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:31:45,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2022-02-21 03:31:45,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:31:45,152 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2022-02-21 03:31:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2022-02-21 03:31:45,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-21 03:31:45,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:45,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:45,153 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:45,153 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:45,153 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:31:45,155 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2022-02-21 03:31:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 24 transitions. [2022-02-21 03:31:45,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:45,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:45,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 24 transitions. [2022-02-21 03:31:45,155 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 24 transitions. [2022-02-21 03:31:45,156 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:31:45,157 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2022-02-21 03:31:45,157 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 24 transitions. [2022-02-21 03:31:45,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:45,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:45,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:45,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2022-02-21 03:31:45,158 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2022-02-21 03:31:45,158 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2022-02-21 03:31:45,158 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:31:45,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2022-02-21 03:31:45,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:45,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:45,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:45,158 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:31:45,158 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:31:45,159 INFO L791 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 180#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 186#L567 assume !(main_~array_size~0#1 < 1); 187#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 188#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 173#L553 assume 0 == test_fun_#t~mem3#1;havoc test_fun_#t~mem3#1;test_fun_~res~0#1 := 1; 174#L558-2 [2022-02-21 03:31:45,159 INFO L793 eck$LassoCheckResult]: Loop: 174#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 183#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 174#L558-2 [2022-02-21 03:31:45,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:45,159 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2022-02-21 03:31:45,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:45,159 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103366061] [2022-02-21 03:31:45,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:45,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:45,169 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:45,177 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:45,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:45,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2022-02-21 03:31:45,178 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:45,178 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352716691] [2022-02-21 03:31:45,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:45,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:45,183 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:31:45,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [230368495] [2022-02-21 03:31:45,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:45,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:31:45,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:45,185 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:31:45,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:31:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:45,215 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:45,220 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:45,220 INFO L85 PathProgramCache]: Analyzing trace with hash 176795341, now seen corresponding path program 1 times [2022-02-21 03:31:45,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:45,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413760519] [2022-02-21 03:31:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:45,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:45,230 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:31:45,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1382691246] [2022-02-21 03:31:45,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:45,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:31:45,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:45,231 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:31:45,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 03:31:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:45,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:31:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:45,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:45,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-21 03:31:45,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {266#true} is VALID [2022-02-21 03:31:45,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {266#true} is VALID [2022-02-21 03:31:45,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {266#true} assume !(main_~array_size~0#1 < 1); {266#true} is VALID [2022-02-21 03:31:45,376 INFO L290 TraceCheckUtils]: 3: Hoare triple {266#true} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; {266#true} is VALID [2022-02-21 03:31:45,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {266#true} assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {283#(<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4))) |ULTIMATE.start_test_fun_#t~mem3#1|)} is VALID [2022-02-21 03:31:45,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {283#(<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4))) |ULTIMATE.start_test_fun_#t~mem3#1|)} assume 0 == test_fun_#t~mem3#1;havoc test_fun_#t~mem3#1;test_fun_~res~0#1 := 1; {287#(<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4))) 0)} is VALID [2022-02-21 03:31:45,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {287#(<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4))) 0)} call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {291#(<= |ULTIMATE.start_test_fun_#t~mem5#1| 0)} is VALID [2022-02-21 03:31:45,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#(<= |ULTIMATE.start_test_fun_#t~mem5#1| 0)} assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; {267#false} is VALID [2022-02-21 03:31:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:31:45,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:31:45,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:45,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413760519] [2022-02-21 03:31:45,378 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:31:45,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382691246] [2022-02-21 03:31:45,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382691246] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:45,378 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:45,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:31:45,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550309171] [2022-02-21 03:31:45,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:45,417 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:45,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:31:45,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:31:45,417 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. cyclomatic complexity: 10 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:45,483 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2022-02-21 03:31:45,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:31:45,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:45,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:45,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2022-02-21 03:31:45,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:45,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2022-02-21 03:31:45,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:31:45,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:31:45,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-02-21 03:31:45,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:31:45,492 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:31:45,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-02-21 03:31:45,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-02-21 03:31:45,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:45,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:45,493 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:45,493 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:45,494 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:31:45,494 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-02-21 03:31:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2022-02-21 03:31:45,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:45,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:45,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 26 transitions. [2022-02-21 03:31:45,495 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 26 transitions. [2022-02-21 03:31:45,495 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:31:45,496 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-02-21 03:31:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2022-02-21 03:31:45,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:45,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:45,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:45,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-02-21 03:31:45,497 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:31:45,497 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:31:45,497 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:31:45,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:31:45,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:45,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:45,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:45,497 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:45,497 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:31:45,497 INFO L791 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 323#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 329#L567 assume !(main_~array_size~0#1 < 1); 330#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 331#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 315#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 316#L555 assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; 320#L558-2 [2022-02-21 03:31:45,497 INFO L793 eck$LassoCheckResult]: Loop: 320#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 326#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 320#L558-2 [2022-02-21 03:31:45,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2022-02-21 03:31:45,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:45,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856825146] [2022-02-21 03:31:45,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:45,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:45,508 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:45,514 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:45,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:45,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 2 times [2022-02-21 03:31:45,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:45,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472215147] [2022-02-21 03:31:45,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:45,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:45,518 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:31:45,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1788502431] [2022-02-21 03:31:45,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:31:45,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:31:45,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:45,520 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:31:45,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-21 03:31:45,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:31:45,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-21 03:31:45,549 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:45,554 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:45,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:45,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1185742934, now seen corresponding path program 1 times [2022-02-21 03:31:45,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:45,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446064941] [2022-02-21 03:31:45,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:45,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:45,564 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:31:45,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1663558520] [2022-02-21 03:31:45,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:45,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:31:45,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:45,566 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:31:45,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-21 03:31:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:45,605 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:45,615 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:45,877 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:31:45,877 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:31:45,877 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:31:45,877 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:31:45,877 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:31:45,877 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:45,877 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:31:45,877 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:31:45,877 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-1.i_Iteration4_Lasso [2022-02-21 03:31:45,877 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:31:45,877 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:31:45,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:45,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:45,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:45,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:46,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:46,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:46,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:46,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:46,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:46,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:46,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:46,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:46,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:46,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:46,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:46,330 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:31:46,330 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:31:46,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:46,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:46,332 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:46,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:31:46,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:46,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:46,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:46,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:46,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:46,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:46,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:46,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:46,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:46,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:46,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:46,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:46,380 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:46,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:46,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:46,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:46,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:46,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:46,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:46,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:46,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:31:46,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:46,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:46,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:46,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:46,428 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:46,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:31:46,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:46,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:46,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:46,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:46,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:46,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:46,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:46,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:46,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:46,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 03:31:46,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:46,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:46,474 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:46,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:31:46,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:46,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:46,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:46,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:46,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:46,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:46,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:46,498 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:46,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:46,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:46,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:46,515 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:46,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:31:46,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:46,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:46,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:46,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:46,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:46,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:46,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:46,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:46,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:46,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:46,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:46,567 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:46,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:31:46,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:46,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:46,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:46,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:46,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:46,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:46,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:46,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:46,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:46,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:46,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:46,616 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:46,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:31:46,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:46,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:46,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:46,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:46,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:46,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:46,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:46,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:46,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:31:46,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:46,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:46,668 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:46,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:31:46,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:46,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:46,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:46,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:46,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:46,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:46,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:46,720 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:31:46,725 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:31:46,725 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:31:46,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:46,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:46,751 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:46,752 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:31:46,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:31:46,777 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:31:46,778 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:31:46,778 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a#1.base) (+ (* ULTIMATE.start_test_fun_~i~0#1 4) ULTIMATE.start_test_fun_~a#1.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a#1.base) (+ (* ULTIMATE.start_test_fun_~i~0#1 4) ULTIMATE.start_test_fun_~a#1.offset))_2 Supporting invariants [] [2022-02-21 03:31:46,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:46,830 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 03:31:46,833 INFO L390 LassoCheck]: Loop: "call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1;" [2022-02-21 03:31:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:46,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:46,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:31:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:46,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:46,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {423#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {423#unseeded} is VALID [2022-02-21 03:31:46,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {423#unseeded} is VALID [2022-02-21 03:31:46,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#unseeded} assume !(main_~array_size~0#1 < 1); {423#unseeded} is VALID [2022-02-21 03:31:46,880 INFO L290 TraceCheckUtils]: 3: Hoare triple {423#unseeded} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; {423#unseeded} is VALID [2022-02-21 03:31:46,880 INFO L290 TraceCheckUtils]: 4: Hoare triple {423#unseeded} assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {423#unseeded} is VALID [2022-02-21 03:31:46,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#unseeded} assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {423#unseeded} is VALID [2022-02-21 03:31:46,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {423#unseeded} assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; {423#unseeded} is VALID [2022-02-21 03:31:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:46,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:31:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:46,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:46,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {426#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ (* |ULTIMATE.start_test_fun_~i~0#1| 4) |ULTIMATE.start_test_fun_~a#1.offset|)))} call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {474#(and (<= |ULTIMATE.start_test_fun_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))))} is VALID [2022-02-21 03:31:46,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#(and (<= |ULTIMATE.start_test_fun_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))))} assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; {451#(or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ (* |ULTIMATE.start_test_fun_~i~0#1| 4) |ULTIMATE.start_test_fun_~a#1.offset|)))) unseeded)} is VALID [2022-02-21 03:31:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:31:46,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:46,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:46,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:46,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,920 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:31:46,920 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:46,961 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 54 transitions. Complement of second has 7 states. [2022-02-21 03:31:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:31:46,961 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:46,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:31:46,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:46,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:46,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:46,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:46,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:46,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:46,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. [2022-02-21 03:31:46,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:31:46,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:46,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:46,963 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:31:46,963 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:31:46,963 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:46,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:46,964 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:31:46,964 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 54 transitions. cyclomatic complexity: 20 [2022-02-21 03:31:46,965 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:31:46,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:46,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:46,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:46,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:46,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:46,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:46,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:46,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:46,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:46,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:31:46,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:31:46,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 20 Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:31:46,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:31:46,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:31:46,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 20 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:31:46,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:31:46,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:31:46,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:31:46,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:46,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:46,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:46,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:31:46,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:31:46,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:31:46,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:46,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:46,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:46,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:31:46,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:31:46,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:31:46,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:31:46,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:31:46,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:31:46,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:31:46,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:31:46,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:31:46,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:46,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:46,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:46,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,970 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:46,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:46,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:31:46,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:46,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:31:46,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:31:46,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:46,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. cyclomatic complexity: 20 [2022-02-21 03:31:46,973 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:31:46,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 47 transitions. [2022-02-21 03:31:46,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:31:46,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:31:46,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2022-02-21 03:31:46,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:31:46,974 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-02-21 03:31:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2022-02-21 03:31:46,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-02-21 03:31:46,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:46,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states and 47 transitions. Second operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:46,975 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states and 47 transitions. Second operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:46,975 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. Second operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:46,976 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:31:46,977 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-02-21 03:31:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-02-21 03:31:46,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:46,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:46,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 35 states and 47 transitions. [2022-02-21 03:31:46,977 INFO L87 Difference]: Start difference. First operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 35 states and 47 transitions. [2022-02-21 03:31:46,977 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:31:46,979 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-02-21 03:31:46,979 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-02-21 03:31:46,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:46,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:46,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:46,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-02-21 03:31:46,980 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2022-02-21 03:31:46,980 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2022-02-21 03:31:46,980 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:31:46,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2022-02-21 03:31:46,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:46,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:46,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:46,981 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:46,981 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:31:46,981 INFO L791 eck$LassoCheckResult]: Stem: 537#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 538#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 546#L567 assume !(main_~array_size~0#1 < 1); 547#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 548#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 549#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 533#L555 assume test_fun_#t~mem4#1 < 0;havoc test_fun_#t~mem4#1;test_fun_~res~0#1 := 0; 534#L558-2 [2022-02-21 03:31:46,981 INFO L793 eck$LassoCheckResult]: Loop: 534#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 543#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 534#L558-2 [2022-02-21 03:31:46,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:46,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2022-02-21 03:31:46,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:46,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246441877] [2022-02-21 03:31:46,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:46,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:46,990 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:46,996 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:46,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:46,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 3 times [2022-02-21 03:31:46,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:46,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744068166] [2022-02-21 03:31:46,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:46,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:47,000 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:31:47,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [896695980] [2022-02-21 03:31:47,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:31:47,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:31:47,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:47,001 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:31:47,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-02-21 03:31:47,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-21 03:31:47,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-21 03:31:47,029 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:47,033 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:47,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:47,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1185741012, now seen corresponding path program 1 times [2022-02-21 03:31:47,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:47,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236520612] [2022-02-21 03:31:47,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:47,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:47,045 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:31:47,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1797475965] [2022-02-21 03:31:47,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:47,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:31:47,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:47,047 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:31:47,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-02-21 03:31:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:47,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:31:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:47,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:47,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-21 03:31:47,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {701#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {701#true} is VALID [2022-02-21 03:31:47,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {701#true} is VALID [2022-02-21 03:31:47,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {701#true} assume !(main_~array_size~0#1 < 1); {701#true} is VALID [2022-02-21 03:31:47,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {701#true} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; {701#true} is VALID [2022-02-21 03:31:47,198 INFO L290 TraceCheckUtils]: 4: Hoare triple {701#true} assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {701#true} is VALID [2022-02-21 03:31:47,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {701#true} assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {721#(<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4))) |ULTIMATE.start_test_fun_#t~mem4#1|)} is VALID [2022-02-21 03:31:47,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {721#(<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4))) |ULTIMATE.start_test_fun_#t~mem4#1|)} assume test_fun_#t~mem4#1 < 0;havoc test_fun_#t~mem4#1;test_fun_~res~0#1 := 0; {725#(< (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4))) 0)} is VALID [2022-02-21 03:31:47,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {725#(< (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4))) 0)} call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {729#(< |ULTIMATE.start_test_fun_#t~mem5#1| 0)} is VALID [2022-02-21 03:31:47,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {729#(< |ULTIMATE.start_test_fun_#t~mem5#1| 0)} assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; {702#false} is VALID [2022-02-21 03:31:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:31:47,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:31:47,200 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:47,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236520612] [2022-02-21 03:31:47,200 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:31:47,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797475965] [2022-02-21 03:31:47,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797475965] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:47,201 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:47,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:31:47,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297292938] [2022-02-21 03:31:47,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:47,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:47,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:31:47,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:31:47,244 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. cyclomatic complexity: 16 Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:47,314 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-02-21 03:31:47,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:31:47,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:47,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:47,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2022-02-21 03:31:47,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:47,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 41 transitions. [2022-02-21 03:31:47,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:31:47,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:31:47,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2022-02-21 03:31:47,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:31:47,324 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-02-21 03:31:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2022-02-21 03:31:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-02-21 03:31:47,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:47,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 41 transitions. Second operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:47,325 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 41 transitions. Second operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:47,326 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:47,326 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:31:47,327 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-21 03:31:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-21 03:31:47,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:47,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:47,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states and 41 transitions. [2022-02-21 03:31:47,327 INFO L87 Difference]: Start difference. First operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states and 41 transitions. [2022-02-21 03:31:47,328 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:31:47,329 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-21 03:31:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-21 03:31:47,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:47,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:47,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:47,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:47,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:47,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-02-21 03:31:47,330 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-02-21 03:31:47,330 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-02-21 03:31:47,330 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:31:47,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2022-02-21 03:31:47,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:47,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:47,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:47,330 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:47,330 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:31:47,330 INFO L791 eck$LassoCheckResult]: Stem: 778#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 779#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 786#L567 assume !(main_~array_size~0#1 < 1); 787#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 788#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 771#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 773#L555 assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; 785#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 789#L558 assume !(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1; 793#L558-3 call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 792#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 790#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 769#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 770#L555 assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; 774#L558-2 [2022-02-21 03:31:47,330 INFO L793 eck$LassoCheckResult]: Loop: 774#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 783#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 774#L558-2 [2022-02-21 03:31:47,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:47,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1864345184, now seen corresponding path program 1 times [2022-02-21 03:31:47,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:47,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377645776] [2022-02-21 03:31:47,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:47,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:47,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {949#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {949#true} is VALID [2022-02-21 03:31:47,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {949#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {949#true} is VALID [2022-02-21 03:31:47,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {949#true} assume !(main_~array_size~0#1 < 1); {949#true} is VALID [2022-02-21 03:31:47,426 INFO L290 TraceCheckUtils]: 3: Hoare triple {949#true} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; {949#true} is VALID [2022-02-21 03:31:47,426 INFO L290 TraceCheckUtils]: 4: Hoare triple {949#true} assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {951#(= |ULTIMATE.start_test_fun_#t~mem3#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4))))} is VALID [2022-02-21 03:31:47,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {951#(= |ULTIMATE.start_test_fun_#t~mem3#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4))))} assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {952#(and (= |ULTIMATE.start_test_fun_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))) (not (= |ULTIMATE.start_test_fun_#t~mem4#1| 0)))} is VALID [2022-02-21 03:31:47,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {952#(and (= |ULTIMATE.start_test_fun_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))) (not (= |ULTIMATE.start_test_fun_#t~mem4#1| 0)))} assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; {953#(<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4))))} is VALID [2022-02-21 03:31:47,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {953#(<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4))))} call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {954#(<= 1 |ULTIMATE.start_test_fun_#t~mem5#1|)} is VALID [2022-02-21 03:31:47,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {954#(<= 1 |ULTIMATE.start_test_fun_#t~mem5#1|)} assume !(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1; {950#false} is VALID [2022-02-21 03:31:47,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {950#false} call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {950#false} is VALID [2022-02-21 03:31:47,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {950#false} test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; {950#false} is VALID [2022-02-21 03:31:47,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {950#false} assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {950#false} is VALID [2022-02-21 03:31:47,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {950#false} assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {950#false} is VALID [2022-02-21 03:31:47,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#false} assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; {950#false} is VALID [2022-02-21 03:31:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:31:47,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:47,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377645776] [2022-02-21 03:31:47,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377645776] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:47,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:47,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:31:47,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727837550] [2022-02-21 03:31:47,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:47,429 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:31:47,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 4 times [2022-02-21 03:31:47,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:47,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407684549] [2022-02-21 03:31:47,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:47,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:47,433 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:31:47,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [597219579] [2022-02-21 03:31:47,434 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:31:47,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:31:47,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:47,435 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:31:47,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-02-21 03:31:47,463 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:31:47,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-21 03:31:47,463 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:47,467 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:47,503 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:47,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:31:47,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:31:47,504 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:47,604 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-21 03:31:47,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:31:47,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:47,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:47,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2022-02-21 03:31:47,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:47,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 41 transitions. [2022-02-21 03:31:47,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:31:47,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:31:47,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2022-02-21 03:31:47,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:31:47,628 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-02-21 03:31:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2022-02-21 03:31:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-02-21 03:31:47,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:47,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 41 transitions. Second operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:47,630 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 41 transitions. Second operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:47,630 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:47,630 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:31:47,631 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-21 03:31:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-21 03:31:47,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:47,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:47,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states and 41 transitions. [2022-02-21 03:31:47,631 INFO L87 Difference]: Start difference. First operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states and 41 transitions. [2022-02-21 03:31:47,632 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:31:47,632 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-21 03:31:47,633 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-21 03:31:47,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:47,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:47,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:47,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-02-21 03:31:47,633 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-02-21 03:31:47,633 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-02-21 03:31:47,633 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:31:47,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2022-02-21 03:31:47,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:47,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:47,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:47,634 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:47,634 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:31:47,634 INFO L791 eck$LassoCheckResult]: Stem: 1000#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1001#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 1008#L567 assume !(main_~array_size~0#1 < 1); 1009#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 1010#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1011#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1020#L555 assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; 1012#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1013#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 1022#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1017#L558 assume !(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1; 1016#L558-3 call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1015#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1014#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 993#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 994#L555 assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; 998#L558-2 [2022-02-21 03:31:47,634 INFO L793 eck$LassoCheckResult]: Loop: 998#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1004#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 998#L558-2 [2022-02-21 03:31:47,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:47,635 INFO L85 PathProgramCache]: Analyzing trace with hash 221162235, now seen corresponding path program 1 times [2022-02-21 03:31:47,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:47,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881555105] [2022-02-21 03:31:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:47,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:47,645 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:31:47,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [16166613] [2022-02-21 03:31:47,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:47,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:31:47,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:47,647 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:31:47,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-02-21 03:31:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:47,760 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:47,778 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:47,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 5 times [2022-02-21 03:31:47,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:47,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320207092] [2022-02-21 03:31:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:47,786 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:31:47,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1554752715] [2022-02-21 03:31:47,786 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:31:47,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:31:47,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:47,788 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:31:47,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-02-21 03:31:47,817 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:31:47,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-21 03:31:47,817 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:47,822 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:47,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:47,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2083511360, now seen corresponding path program 2 times [2022-02-21 03:31:47,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:47,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518067347] [2022-02-21 03:31:47,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:47,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:47,847 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:31:47,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355243403] [2022-02-21 03:31:47,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:31:47,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:31:47,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:47,849 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:31:47,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-02-21 03:31:47,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:31:47,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-21 03:31:47,898 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:47,916 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:48,364 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:31:48,364 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:31:48,364 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:31:48,364 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:31:48,364 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:31:48,364 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:48,364 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:31:48,364 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:31:48,364 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-1.i_Iteration7_Lasso [2022-02-21 03:31:48,364 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:31:48,364 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:31:48,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:48,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:48,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:48,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:48,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:48,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:48,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:48,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:48,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:48,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:48,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:48,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:48,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:48,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:48,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:31:48,878 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:31:48,878 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:31:48,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:48,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:48,880 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:48,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:31:48,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:48,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:48,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:48,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:48,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:48,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:48,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:48,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:48,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:48,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:48,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:48,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:48,936 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:48,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:31:48,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:48,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:48,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:48,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:48,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:48,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:48,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:48,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:48,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:48,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:48,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:48,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:48,978 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:48,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:31:48,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:48,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:48,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:48,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:48,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:48,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:48,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:48,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:49,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:49,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:49,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:49,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:49,020 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:49,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:31:49,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:49,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:49,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:49,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:49,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:49,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:49,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:49,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:49,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:49,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:49,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:49,061 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:49,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:31:49,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:49,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:49,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:49,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:49,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:49,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:49,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:49,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:49,078 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:49,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:49,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:49,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:49,095 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:49,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:31:49,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:49,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:49,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:49,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:49,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:49,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:49,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:49,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:49,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:49,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:49,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:49,132 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:49,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:31:49,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:49,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:49,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:49,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:49,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:49,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:49,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:49,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:49,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:49,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:49,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:49,175 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:49,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:31:49,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:31:49,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:49,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:49,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:49,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:49,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:49,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:49,190 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:31:49,195 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:31:49,195 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:31:49,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:49,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:49,197 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:49,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:31:49,199 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:31:49,207 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:31:49,207 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:31:49,207 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a#1.base) (+ (* ULTIMATE.start_test_fun_~i~0#1 4) ULTIMATE.start_test_fun_~a#1.offset))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a#1.base) (+ (* ULTIMATE.start_test_fun_~i~0#1 4) ULTIMATE.start_test_fun_~a#1.offset))_3 Supporting invariants [] [2022-02-21 03:31:49,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 03:31:49,251 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2022-02-21 03:31:49,255 INFO L390 LassoCheck]: Loop: "call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1;" [2022-02-21 03:31:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:49,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:49,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:31:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:49,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:49,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {1188#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1188#unseeded} is VALID [2022-02-21 03:31:49,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#unseeded} assume !(main_~array_size~0#1 < 1); {1188#unseeded} is VALID [2022-02-21 03:31:49,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {1188#unseeded} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; {1188#unseeded} is VALID [2022-02-21 03:31:49,330 INFO L290 TraceCheckUtils]: 4: Hoare triple {1188#unseeded} assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#unseeded} assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {1188#unseeded} assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#unseeded} call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#unseeded} assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#unseeded} call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {1188#unseeded} assume !(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#unseeded} call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {1188#unseeded} test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#unseeded} assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#unseeded} assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#unseeded} assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:49,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:31:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:49,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:49,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {1191#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ (* |ULTIMATE.start_test_fun_~i~0#1| 4) |ULTIMATE.start_test_fun_~a#1.offset|)))} call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1271#(and (<= |ULTIMATE.start_test_fun_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))))} is VALID [2022-02-21 03:31:49,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {1271#(and (<= |ULTIMATE.start_test_fun_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))))} assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; {1221#(or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ (* |ULTIMATE.start_test_fun_~i~0#1| 4) |ULTIMATE.start_test_fun_~a#1.offset|)))) unseeded)} is VALID [2022-02-21 03:31:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:31:49,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:49,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:49,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,381 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:31:49,381 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:49,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:49,439 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 44 transitions. Complement of second has 7 states. [2022-02-21 03:31:49,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:31:49,439 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:49,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. cyclomatic complexity: 12 [2022-02-21 03:31:49,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:49,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:49,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:49,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:49,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:49,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:49,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. [2022-02-21 03:31:49,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:49,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:49,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:49,441 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 38 transitions. cyclomatic complexity: 12 [2022-02-21 03:31:49,441 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:31:49,441 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:49,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:49,441 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:31:49,441 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 44 transitions. cyclomatic complexity: 13 [2022-02-21 03:31:49,442 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:31:49,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:31:49,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:31:49,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:31:49,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:31:49,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:31:49,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:31:49,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:31:49,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:31:49,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:31:49,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 2 letters. [2022-02-21 03:31:49,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 2 letters. [2022-02-21 03:31:49,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 2 letters. [2022-02-21 03:31:49,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 2 letters. [2022-02-21 03:31:49,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 2 letters. [2022-02-21 03:31:49,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 2 letters. [2022-02-21 03:31:49,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,448 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-02-21 03:31:49,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,449 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:31:49,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:49,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:31:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:49,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:49,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {1188#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1188#unseeded} is VALID [2022-02-21 03:31:49,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#unseeded} assume !(main_~array_size~0#1 < 1); {1188#unseeded} is VALID [2022-02-21 03:31:49,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {1188#unseeded} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; {1188#unseeded} is VALID [2022-02-21 03:31:49,515 INFO L290 TraceCheckUtils]: 4: Hoare triple {1188#unseeded} assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#unseeded} assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {1188#unseeded} assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#unseeded} call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#unseeded} assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#unseeded} call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {1188#unseeded} assume !(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#unseeded} call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {1188#unseeded} test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#unseeded} assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#unseeded} assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#unseeded} assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:49,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:31:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:49,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:49,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {1191#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ (* |ULTIMATE.start_test_fun_~i~0#1| 4) |ULTIMATE.start_test_fun_~a#1.offset|)))} call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1369#(and (<= |ULTIMATE.start_test_fun_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))))} is VALID [2022-02-21 03:31:49,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {1369#(and (<= |ULTIMATE.start_test_fun_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))))} assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; {1221#(or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ (* |ULTIMATE.start_test_fun_~i~0#1| 4) |ULTIMATE.start_test_fun_~a#1.offset|)))) unseeded)} is VALID [2022-02-21 03:31:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:31:49,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:49,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:49,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,560 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:31:49,560 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:49,598 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 44 transitions. Complement of second has 7 states. [2022-02-21 03:31:49,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:31:49,598 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:49,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. cyclomatic complexity: 12 [2022-02-21 03:31:49,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:49,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:49,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:49,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:49,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:49,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:49,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. [2022-02-21 03:31:49,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:49,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:49,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:49,600 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 38 transitions. cyclomatic complexity: 12 [2022-02-21 03:31:49,600 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:31:49,600 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:49,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:49,600 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:31:49,600 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 44 transitions. cyclomatic complexity: 13 [2022-02-21 03:31:49,600 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:31:49,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:31:49,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:31:49,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:31:49,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:31:49,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:31:49,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:31:49,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:31:49,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:31:49,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:31:49,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 2 letters. [2022-02-21 03:31:49,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 2 letters. [2022-02-21 03:31:49,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 2 letters. [2022-02-21 03:31:49,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 2 letters. [2022-02-21 03:31:49,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 2 letters. [2022-02-21 03:31:49,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 2 letters. [2022-02-21 03:31:49,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,605 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-02-21 03:31:49,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,607 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:31:49,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:49,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:31:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:49,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:49,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {1188#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1188#unseeded} is VALID [2022-02-21 03:31:49,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#unseeded} assume !(main_~array_size~0#1 < 1); {1188#unseeded} is VALID [2022-02-21 03:31:49,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {1188#unseeded} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; {1188#unseeded} is VALID [2022-02-21 03:31:49,669 INFO L290 TraceCheckUtils]: 4: Hoare triple {1188#unseeded} assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#unseeded} assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {1188#unseeded} assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#unseeded} call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#unseeded} assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#unseeded} call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {1188#unseeded} assume !(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#unseeded} call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {1188#unseeded} test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#unseeded} assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#unseeded} assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1188#unseeded} is VALID [2022-02-21 03:31:49,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#unseeded} assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; {1188#unseeded} is VALID [2022-02-21 03:31:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:49,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:31:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:49,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:49,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {1191#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ (* |ULTIMATE.start_test_fun_~i~0#1| 4) |ULTIMATE.start_test_fun_~a#1.offset|)))} call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); {1467#(and (<= |ULTIMATE.start_test_fun_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))))} is VALID [2022-02-21 03:31:49,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {1467#(and (<= |ULTIMATE.start_test_fun_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ |ULTIMATE.start_test_fun_~a#1.offset| (* |ULTIMATE.start_test_fun_~i~0#1| 4)))))} assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; {1221#(or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~a#1.base|) (+ (* |ULTIMATE.start_test_fun_~i~0#1| 4) |ULTIMATE.start_test_fun_~a#1.offset|)))) unseeded)} is VALID [2022-02-21 03:31:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:31:49,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:49,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:49,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,715 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:31:49,715 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:49,757 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 50 transitions. Complement of second has 6 states. [2022-02-21 03:31:49,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:31:49,757 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:49,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. cyclomatic complexity: 12 [2022-02-21 03:31:49,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:49,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:49,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:49,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:49,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:49,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:49,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2022-02-21 03:31:49,760 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:31:49,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:31:49,760 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 38 transitions. cyclomatic complexity: 12 [2022-02-21 03:31:49,760 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:31:49,760 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:49,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:31:49,761 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:31:49,761 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 50 transitions. cyclomatic complexity: 15 [2022-02-21 03:31:49,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. cyclomatic complexity: 15 [2022-02-21 03:31:49,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:31:49,761 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:31:49,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:31:49,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:31:49,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:31:49,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:31:49,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:31:49,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:31:49,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:31:49,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:31:49,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:31:49,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 2 letters. [2022-02-21 03:31:49,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 2 letters. [2022-02-21 03:31:49,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 2 letters. [2022-02-21 03:31:49,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:49,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,764 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-02-21 03:31:49,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:31:49,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:31:49,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:31:49,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:49,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. cyclomatic complexity: 15 [2022-02-21 03:31:49,766 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:31:49,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2022-02-21 03:31:49,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:31:49,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:31:49,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:31:49,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:49,767 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:31:49,767 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:31:49,767 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:31:49,767 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:31:49,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:31:49,767 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:31:49,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:31:49,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:31:49 BoogieIcfgContainer [2022-02-21 03:31:49,772 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:31:49,773 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:31:49,773 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:31:49,773 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:31:49,773 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:31:42" (3/4) ... [2022-02-21 03:31:49,775 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:31:49,775 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:31:49,776 INFO L158 Benchmark]: Toolchain (without parser) took 7850.53ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 66.8MB in the beginning and 82.1MB in the end (delta: -15.3MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2022-02-21 03:31:49,776 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:31:49,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.10ms. Allocated memory is still 109.1MB. Free memory was 66.6MB in the beginning and 75.8MB in the end (delta: -9.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-02-21 03:31:49,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.24ms. Allocated memory is still 109.1MB. Free memory was 75.8MB in the beginning and 73.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:31:49,777 INFO L158 Benchmark]: Boogie Preprocessor took 17.19ms. Allocated memory is still 109.1MB. Free memory was 73.9MB in the beginning and 72.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:31:49,777 INFO L158 Benchmark]: RCFGBuilder took 331.07ms. Allocated memory is still 109.1MB. Free memory was 72.2MB in the beginning and 60.1MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:31:49,777 INFO L158 Benchmark]: BuchiAutomizer took 7056.29ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 60.1MB in the beginning and 82.1MB in the end (delta: -22.0MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2022-02-21 03:31:49,777 INFO L158 Benchmark]: Witness Printer took 2.52ms. Allocated memory is still 159.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:31:49,778 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.10ms. Allocated memory is still 109.1MB. Free memory was 66.6MB in the beginning and 75.8MB in the end (delta: -9.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.24ms. Allocated memory is still 109.1MB. Free memory was 75.8MB in the beginning and 73.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.19ms. Allocated memory is still 109.1MB. Free memory was 73.9MB in the beginning and 72.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 331.07ms. Allocated memory is still 109.1MB. Free memory was 72.2MB in the beginning and 60.1MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 7056.29ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 60.1MB in the beginning and 82.1MB in the end (delta: -22.0MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * Witness Printer took 2.52ms. Allocated memory is still 159.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[a] and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.0s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 5.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 187 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 149 IncrementalHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 119 mSDtfsCounter, 149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital169 mio100 ax111 hnf100 lsp86 ukn70 mio100 lsp50 div100 bol100 ite100 ukn100 eq178 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:31:49,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:50,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:50,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-02-21 03:31:50,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:50,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:50,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:51,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:51,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:51,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-02-21 03:31:51,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-02-21 03:31:51,849 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 Writing output log to file Ultimate.log Result: TRUE