./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50151fd5b174ebc91ead294b24e8609853135da34cf3135980023271fd7c21f6 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:55:51,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:55:51,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:55:51,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:55:51,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:55:51,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:55:51,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:55:51,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:55:51,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:55:51,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:55:51,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:55:51,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:55:51,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:55:51,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:55:51,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:55:51,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:55:51,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:55:51,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:55:51,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:55:51,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:55:51,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:55:51,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:55:51,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:55:51,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:55:51,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:55:51,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:55:51,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:55:51,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:55:51,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:55:51,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:55:51,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:55:51,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:55:51,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:55:51,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:55:51,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:55:51,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:55:51,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:55:51,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:55:51,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:55:51,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:55:51,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:55:51,214 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-14 23:55:51,233 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:55:51,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:55:51,237 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:55:51,237 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:55:51,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:55:51,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:55:51,239 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:55:51,239 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:55:51,239 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:55:51,239 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:55:51,239 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:55:51,240 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:55:51,240 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:55:51,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:55:51,240 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 23:55:51,240 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:55:51,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:55:51,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 23:55:51,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:55:51,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:55:51,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:55:51,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:55:51,242 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 23:55:51,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:55:51,242 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:55:51,242 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:55:51,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:55:51,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:55:51,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:55:51,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:55:51,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:55:51,243 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:55:51,244 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:55:51,244 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 50151fd5b174ebc91ead294b24e8609853135da34cf3135980023271fd7c21f6 [2021-12-14 23:55:51,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:55:51,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:55:51,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:55:51,456 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:55:51,457 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:55:51,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2021-12-14 23:55:51,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f25f5bfc/1fa2f08c0ba54c29b3909ff021bf5780/FLAG376d5ba6e [2021-12-14 23:55:51,896 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:55:51,897 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2021-12-14 23:55:51,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f25f5bfc/1fa2f08c0ba54c29b3909ff021bf5780/FLAG376d5ba6e [2021-12-14 23:55:52,278 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f25f5bfc/1fa2f08c0ba54c29b3909ff021bf5780 [2021-12-14 23:55:52,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:55:52,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:55:52,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:55:52,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:55:52,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:55:52,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:55:52" (1/1) ... [2021-12-14 23:55:52,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2623a96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:52, skipping insertion in model container [2021-12-14 23:55:52,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:55:52" (1/1) ... [2021-12-14 23:55:52,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:55:52,326 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:55:52,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:55:52,618 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:55:52,673 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:55:52,701 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:55:52,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:52 WrapperNode [2021-12-14 23:55:52,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:55:52,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:55:52,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:55:52,704 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:55:52,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:52" (1/1) ... [2021-12-14 23:55:52,731 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:52" (1/1) ... [2021-12-14 23:55:52,749 INFO L137 Inliner]: procedures = 166, calls = 79, calls flagged for inlining = 30, calls inlined = 7, statements flattened = 98 [2021-12-14 23:55:52,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:55:52,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:55:52,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:55:52,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:55:52,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:52" (1/1) ... [2021-12-14 23:55:52,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:52" (1/1) ... [2021-12-14 23:55:52,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:52" (1/1) ... [2021-12-14 23:55:52,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:52" (1/1) ... [2021-12-14 23:55:52,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:52" (1/1) ... [2021-12-14 23:55:52,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:52" (1/1) ... [2021-12-14 23:55:52,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:52" (1/1) ... [2021-12-14 23:55:52,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:55:52,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:55:52,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:55:52,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:55:52,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:52" (1/1) ... [2021-12-14 23:55:52,786 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:55:52,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:55:52,804 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) [2021-12-14 23:55:52,820 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 [2021-12-14 23:55:52,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 23:55:52,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 23:55:52,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 23:55:52,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 23:55:52,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 23:55:52,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 23:55:52,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:55:52,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:55:52,905 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:55:52,907 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:55:53,038 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:55:53,042 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:55:53,042 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-14 23:55:53,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:55:53 BoogieIcfgContainer [2021-12-14 23:55:53,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:55:53,046 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:55:53,047 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:55:53,050 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:55:53,050 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:55:53,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:55:52" (1/3) ... [2021-12-14 23:55:53,051 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c3bf8f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:55:53, skipping insertion in model container [2021-12-14 23:55:53,052 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:55:53,052 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:52" (2/3) ... [2021-12-14 23:55:53,052 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c3bf8f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:55:53, skipping insertion in model container [2021-12-14 23:55:53,052 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:55:53,052 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:55:53" (3/3) ... [2021-12-14 23:55:53,053 INFO L388 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_1-2.i [2021-12-14 23:55:53,094 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:55:53,094 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:55:53,094 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:55:53,094 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:55:53,094 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:55:53,095 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:55:53,095 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:55:53,095 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:55:53,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:55:53,133 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-14 23:55:53,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:55:53,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:55:53,137 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-14 23:55:53,137 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:55:53,138 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:55:53,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:55:53,141 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-14 23:55:53,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:55:53,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:55:53,141 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-14 23:55:53,142 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:55:53,145 INFO L791 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 24#L526true assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 20#L529true entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; 16#L787true assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 9#L788-3true [2021-12-14 23:55:53,145 INFO L793 eck$LassoCheckResult]: Loop: 9#L788-3true assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 3#L788-2true entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 9#L788-3true [2021-12-14 23:55:53,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:55:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2021-12-14 23:55:53,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:55:53,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234038618] [2021-12-14 23:55:53,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:55:53,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:55:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:55:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:55:53,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:55:53,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234038618] [2021-12-14 23:55:53,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234038618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:55:53,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:55:53,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:55:53,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716622144] [2021-12-14 23:55:53,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:55:53,329 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:55:53,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:55:53,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 1 times [2021-12-14 23:55:53,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:55:53,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75944295] [2021-12-14 23:55:53,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:55:53,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:55:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:53,366 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:55:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:53,382 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:55:53,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:55:53,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 23:55:53,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 23:55:53,483 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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) [2021-12-14 23:55:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:55:53,539 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2021-12-14 23:55:53,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 23:55:53,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 61 transitions. [2021-12-14 23:55:53,551 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2021-12-14 23:55:53,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 33 states and 41 transitions. [2021-12-14 23:55:53,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-12-14 23:55:53,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-12-14 23:55:53,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2021-12-14 23:55:53,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:55:53,555 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-12-14 23:55:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2021-12-14 23:55:53,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2021-12-14 23:55:53,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:55:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2021-12-14 23:55:53,573 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2021-12-14 23:55:53,573 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2021-12-14 23:55:53,574 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:55:53,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2021-12-14 23:55:53,575 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-14 23:55:53,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:55:53,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:55:53,576 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-14 23:55:53,576 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:55:53,577 INFO L791 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 94#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 104#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 103#L529 entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; 95#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 92#L788-3 [2021-12-14 23:55:53,577 INFO L793 eck$LassoCheckResult]: Loop: 92#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 91#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 92#L788-3 [2021-12-14 23:55:53,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:55:53,578 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2021-12-14 23:55:53,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:55:53,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24331864] [2021-12-14 23:55:53,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:55:53,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:55:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:53,602 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:55:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:53,612 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:55:53,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:55:53,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 2 times [2021-12-14 23:55:53,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:55:53,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902997163] [2021-12-14 23:55:53,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:55:53,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:55:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:53,625 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:55:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:53,630 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:55:53,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:55:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966535, now seen corresponding path program 1 times [2021-12-14 23:55:53,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:55:53,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374809085] [2021-12-14 23:55:53,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:55:53,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:55:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:53,646 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:55:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:53,672 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:55:53,997 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:55:53,998 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:55:53,998 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:55:53,998 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:55:53,998 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:55:53,998 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:55:53,998 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:55:53,998 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:55:53,999 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration2_Lasso [2021-12-14 23:55:53,999 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:55:53,999 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:55:54,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:55:54,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:55:54,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:55:54,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:55:54,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:55:54,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:55:54,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:55:54,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:55:54,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:55:54,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:55:54,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:55:54,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:55:54,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:55:54,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:55:54,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:55:54,511 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:55:54,514 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:55:54,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:55:54,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:55:54,516 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) [2021-12-14 23:55:54,519 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 [2021-12-14 23:55:54,520 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 [2021-12-14 23:55:54,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:55:54,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:55:54,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:55:54,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:55:54,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:55:54,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:55:54,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:55:54,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:55:54,561 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 [2021-12-14 23:55:54,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:55:54,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:55:54,562 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) [2021-12-14 23:55:54,563 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 [2021-12-14 23:55:54,565 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 [2021-12-14 23:55:54,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:55:54,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:55:54,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:55:54,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:55:54,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:55:54,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:55:54,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:55:54,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:55:54,589 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 [2021-12-14 23:55:54,589 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:55:54,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:55:54,590 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) [2021-12-14 23:55:54,591 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 [2021-12-14 23:55:54,593 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 [2021-12-14 23:55:54,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:55:54,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:55:54,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:55:54,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:55:54,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:55:54,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:55:54,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:55:54,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2021-12-14 23:55:54,629 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:55:54,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:55:54,630 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) [2021-12-14 23:55:54,630 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 [2021-12-14 23:55:54,631 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 [2021-12-14 23:55:54,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:55:54,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:55:54,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:55:54,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:55:54,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:55:54,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:55:54,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:55:54,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:55:54,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-14 23:55:54,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:55:54,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:55:54,658 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) [2021-12-14 23:55:54,658 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 [2021-12-14 23:55:54,659 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 [2021-12-14 23:55:54,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:55:54,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:55:54,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:55:54,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:55:54,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:55:54,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:55:54,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:55:54,692 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 [2021-12-14 23:55:54,692 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:55:54,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:55:54,693 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) [2021-12-14 23:55:54,694 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 [2021-12-14 23:55:54,695 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 [2021-12-14 23:55:54,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:55:54,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:55:54,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:55:54,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:55:54,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:55:54,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:55:54,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:55:54,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:55:54,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-12-14 23:55:54,719 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:55:54,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:55:54,720 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) [2021-12-14 23:55:54,721 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 [2021-12-14 23:55:54,722 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 [2021-12-14 23:55:54,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:55:54,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:55:54,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:55:54,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:55:54,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:55:54,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:55:54,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:55:54,731 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:55:54,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2021-12-14 23:55:54,746 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:55:54,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:55:54,747 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) [2021-12-14 23:55:54,748 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 [2021-12-14 23:55:54,749 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 [2021-12-14 23:55:54,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:55:54,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:55:54,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:55:54,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:55:54,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:55:54,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:55:54,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:55:54,780 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 [2021-12-14 23:55:54,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:55:54,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:55:54,782 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) [2021-12-14 23:55:54,783 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 [2021-12-14 23:55:54,784 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 [2021-12-14 23:55:54,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:55:54,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:55:54,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:55:54,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:55:54,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:55:54,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:55:54,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:55:54,826 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 [2021-12-14 23:55:54,827 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:55:54,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:55:54,828 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) [2021-12-14 23:55:54,831 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 [2021-12-14 23:55:54,832 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 [2021-12-14 23:55:54,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:55:54,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:55:54,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:55:54,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:55:54,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:55:54,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:55:54,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:55:54,856 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 [2021-12-14 23:55:54,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:55:54,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:55:54,857 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:55:54,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-14 23:55:54,860 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 [2021-12-14 23:55:54,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:55:54,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:55:54,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:55:54,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:55:54,876 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:55:54,876 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:55:54,895 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:55:54,973 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2021-12-14 23:55:54,973 INFO L444 ModelExtractionUtils]: 6 out of 37 variables were initially zero. Simplification set additionally 27 variables to zero. [2021-12-14 23:55:54,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:55:54,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:55:54,997 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2021-12-14 23:55:55,028 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:55:55,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-14 23:55:55,048 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:55:55,048 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:55:55,049 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_ldv_malloc_#res#1.base)_1, ULTIMATE.start_entry_point_~array~0#1.offset, ULTIMATE.start_entry_point_~i~2#1) = 1*v_rep(select #length ULTIMATE.start_ldv_malloc_#res#1.base)_1 - 1*ULTIMATE.start_entry_point_~array~0#1.offset - 4*ULTIMATE.start_entry_point_~i~2#1 Supporting invariants [] [2021-12-14 23:55:55,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-14 23:55:55,081 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2021-12-14 23:55:55,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:55:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:55:55,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 23:55:55,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:55:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:55:55,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 23:55:55,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:55:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:55:55,175 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-14 23:55:55,175 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:55:55,224 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 44 transitions. Complement of second has 8 states. [2021-12-14 23:55:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-14 23:55:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:55:55,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2021-12-14 23:55:55,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 5 letters. Loop has 2 letters. [2021-12-14 23:55:55,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:55:55,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 7 letters. Loop has 2 letters. [2021-12-14 23:55:55,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:55:55,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2021-12-14 23:55:55,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:55:55,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2021-12-14 23:55:55,239 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-14 23:55:55,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 27 states and 34 transitions. [2021-12-14 23:55:55,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-12-14 23:55:55,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-12-14 23:55:55,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2021-12-14 23:55:55,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:55:55,241 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-14 23:55:55,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2021-12-14 23:55:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2021-12-14 23:55:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:55:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2021-12-14 23:55:55,252 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2021-12-14 23:55:55,252 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2021-12-14 23:55:55,252 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:55:55,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2021-12-14 23:55:55,252 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-14 23:55:55,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:55:55,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:55:55,253 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:55:55,253 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:55:55,253 INFO L791 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 233#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 244#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 243#L529 entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; 234#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 235#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 249#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 245#L764-3 [2021-12-14 23:55:55,254 INFO L793 eck$LassoCheckResult]: Loop: 245#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 250#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 251#L529-1 alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset; 240#L766 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 242#L764-2 alloc_17_#t~post38#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post38#1;havoc alloc_17_#t~post38#1; 245#L764-3 [2021-12-14 23:55:55,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:55:55,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966477, now seen corresponding path program 1 times [2021-12-14 23:55:55,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:55:55,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230895992] [2021-12-14 23:55:55,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:55:55,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:55:55,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-14 23:55:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:55:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:55:55,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:55:55,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230895992] [2021-12-14 23:55:55,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230895992] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:55:55,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:55:55,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 23:55:55,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691506] [2021-12-14 23:55:55,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:55:55,287 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:55:55,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:55:55,289 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 1 times [2021-12-14 23:55:55,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:55:55,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127334013] [2021-12-14 23:55:55,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:55:55,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:55:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:55,303 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:55:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:55,311 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:55:55,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:55:55,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 23:55:55,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 23:55:55,488 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:55:55,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:55:55,498 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-12-14 23:55:55,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 23:55:55,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2021-12-14 23:55:55,500 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-14 23:55:55,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 28 transitions. [2021-12-14 23:55:55,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-14 23:55:55,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-14 23:55:55,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2021-12-14 23:55:55,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:55:55,500 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-12-14 23:55:55,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2021-12-14 23:55:55,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-12-14 23:55:55,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:55:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-12-14 23:55:55,502 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-14 23:55:55,502 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-14 23:55:55,502 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:55:55,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2021-12-14 23:55:55,502 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-14 23:55:55,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:55:55,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:55:55,502 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:55:55,502 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:55:55,502 INFO L791 eck$LassoCheckResult]: Stem: 284#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 285#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 296#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 292#L529 entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; 286#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 287#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 282#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 283#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 301#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 297#L764-3 [2021-12-14 23:55:55,502 INFO L793 eck$LassoCheckResult]: Loop: 297#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 302#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 303#L529-1 alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset; 293#L766 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 295#L764-2 alloc_17_#t~post38#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post38#1;havoc alloc_17_#t~post38#1; 297#L764-3 [2021-12-14 23:55:55,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:55:55,503 INFO L85 PathProgramCache]: Analyzing trace with hash -593946865, now seen corresponding path program 1 times [2021-12-14 23:55:55,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:55:55,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305270540] [2021-12-14 23:55:55,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:55:55,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:55:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:55:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:55:55,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:55:55,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305270540] [2021-12-14 23:55:55,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305270540] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:55:55,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103064496] [2021-12-14 23:55:55,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:55:55,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:55:55,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:55:55,543 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) [2021-12-14 23:55:55,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-14 23:55:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:55:55,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 23:55:55,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:55:55,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:55:55,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:55:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:55:55,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103064496] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:55:55,670 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:55:55,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-12-14 23:55:55,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198536201] [2021-12-14 23:55:55,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:55:55,671 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:55:55,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:55:55,671 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 2 times [2021-12-14 23:55:55,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:55:55,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225578082] [2021-12-14 23:55:55,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:55:55,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:55:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:55,679 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:55:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:55,684 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:55:55,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:55:55,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 23:55:55,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-12-14 23:55:55,846 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 9 Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:55:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:55:55,891 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2021-12-14 23:55:55,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 23:55:55,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2021-12-14 23:55:55,908 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-14 23:55:55,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 33 transitions. [2021-12-14 23:55:55,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-14 23:55:55,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-14 23:55:55,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2021-12-14 23:55:55,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:55:55,909 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-14 23:55:55,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2021-12-14 23:55:55,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-14 23:55:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:55:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-12-14 23:55:55,911 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-14 23:55:55,911 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-14 23:55:55,911 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:55:55,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2021-12-14 23:55:55,911 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-14 23:55:55,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:55:55,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:55:55,912 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:55:55,912 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:55:55,912 INFO L791 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 400#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 411#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 410#L529 entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; 401#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 402#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 397#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 398#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 416#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 424#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 423#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 422#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 421#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 420#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 419#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 412#L764-3 [2021-12-14 23:55:55,912 INFO L793 eck$LassoCheckResult]: Loop: 412#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 417#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 418#L529-1 alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset; 407#L766 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 409#L764-2 alloc_17_#t~post38#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post38#1;havoc alloc_17_#t~post38#1; 412#L764-3 [2021-12-14 23:55:55,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:55:55,912 INFO L85 PathProgramCache]: Analyzing trace with hash 775101013, now seen corresponding path program 2 times [2021-12-14 23:55:55,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:55:55,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734878607] [2021-12-14 23:55:55,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:55:55,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:55:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:55:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:55:55,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:55:55,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734878607] [2021-12-14 23:55:55,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734878607] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:55:55,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519582802] [2021-12-14 23:55:55,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:55:55,978 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:55:55,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:55:55,979 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) [2021-12-14 23:55:55,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-14 23:55:56,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:55:56,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:55:56,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 23:55:56,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:55:56,116 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:55:56,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:55:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:55:56,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519582802] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:55:56,187 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:55:56,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2021-12-14 23:55:56,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306709698] [2021-12-14 23:55:56,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:55:56,188 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:55:56,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:55:56,189 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 3 times [2021-12-14 23:55:56,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:55:56,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6428188] [2021-12-14 23:55:56,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:55:56,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:55:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:56,199 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:55:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:56,224 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:55:56,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:55:56,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-14 23:55:56,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2021-12-14 23:55:56,376 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 9 Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 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) [2021-12-14 23:55:56,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:55:56,465 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2021-12-14 23:55:56,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 23:55:56,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2021-12-14 23:55:56,467 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-14 23:55:56,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 45 transitions. [2021-12-14 23:55:56,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-14 23:55:56,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-14 23:55:56,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 45 transitions. [2021-12-14 23:55:56,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:55:56,468 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-14 23:55:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 45 transitions. [2021-12-14 23:55:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-12-14 23:55:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:55:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2021-12-14 23:55:56,474 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-14 23:55:56,474 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-14 23:55:56,474 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-14 23:55:56,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2021-12-14 23:55:56,475 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-14 23:55:56,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:55:56,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:55:56,476 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:55:56,476 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:55:56,476 INFO L791 eck$LassoCheckResult]: Stem: 583#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 584#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 595#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 591#L529 entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; 585#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 586#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 600#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 601#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 581#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 582#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 620#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 619#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 618#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 617#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 616#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 615#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 614#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 613#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 612#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 611#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 610#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 609#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 608#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 607#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 606#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 605#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 602#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 596#L764-3 [2021-12-14 23:55:56,476 INFO L793 eck$LassoCheckResult]: Loop: 596#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 603#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 604#L529-1 alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset; 592#L766 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 594#L764-2 alloc_17_#t~post38#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post38#1;havoc alloc_17_#t~post38#1; 596#L764-3 [2021-12-14 23:55:56,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:55:56,477 INFO L85 PathProgramCache]: Analyzing trace with hash 158620513, now seen corresponding path program 3 times [2021-12-14 23:55:56,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:55:56,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243233994] [2021-12-14 23:55:56,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:55:56,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:55:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:56,518 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:55:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:56,533 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:55:56,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:55:56,534 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 4 times [2021-12-14 23:55:56,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:55:56,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52032841] [2021-12-14 23:55:56,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:55:56,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:55:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:56,539 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:55:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:56,542 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:55:56,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:55:56,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1350358585, now seen corresponding path program 1 times [2021-12-14 23:55:56,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:55:56,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398432900] [2021-12-14 23:55:56,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:55:56,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:55:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:56,577 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:55:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:56,616 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace