./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 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/locks/test_locks_6.c -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 c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 01:48:52,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 01:48:52,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 01:48:52,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 01:48:52,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 01:48:52,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 01:48:52,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 01:48:52,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 01:48:52,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 01:48:52,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 01:48:52,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 01:48:52,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 01:48:52,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 01:48:52,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 01:48:52,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 01:48:52,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 01:48:52,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 01:48:52,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 01:48:52,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 01:48:52,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 01:48:52,316 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 01:48:52,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 01:48:52,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 01:48:52,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 01:48:52,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 01:48:52,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 01:48:52,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 01:48:52,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 01:48:52,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 01:48:52,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 01:48:52,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 01:48:52,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 01:48:52,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 01:48:52,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 01:48:52,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 01:48:52,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 01:48:52,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 01:48:52,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 01:48:52,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 01:48:52,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 01:48:52,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 01:48:52,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 01:48:52,348 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 01:48:52,373 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 01:48:52,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 01:48:52,374 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 01:48:52,374 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 01:48:52,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 01:48:52,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 01:48:52,376 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 01:48:52,376 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 01:48:52,376 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 01:48:52,377 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 01:48:52,377 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 01:48:52,377 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 01:48:52,377 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 01:48:52,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 01:48:52,378 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 01:48:52,378 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 01:48:52,378 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 01:48:52,378 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 01:48:52,378 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 01:48:52,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 01:48:52,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 01:48:52,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 01:48:52,379 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 01:48:52,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 01:48:52,379 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 01:48:52,380 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 01:48:52,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 01:48:52,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 01:48:52,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 01:48:52,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 01:48:52,381 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 01:48:52,382 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 01:48:52,382 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 -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2022-07-22 01:48:52,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 01:48:52,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 01:48:52,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 01:48:52,699 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 01:48:52,699 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 01:48:52,700 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2022-07-22 01:48:52,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fe33902e/fc8898388db94891bf45d75455826858/FLAG5b257219c [2022-07-22 01:48:53,188 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 01:48:53,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2022-07-22 01:48:53,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fe33902e/fc8898388db94891bf45d75455826858/FLAG5b257219c [2022-07-22 01:48:53,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fe33902e/fc8898388db94891bf45d75455826858 [2022-07-22 01:48:53,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 01:48:53,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 01:48:53,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 01:48:53,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 01:48:53,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 01:48:53,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:48:53" (1/1) ... [2022-07-22 01:48:53,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da14813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:53, skipping insertion in model container [2022-07-22 01:48:53,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:48:53" (1/1) ... [2022-07-22 01:48:53,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 01:48:53,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 01:48:53,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c[2544,2557] [2022-07-22 01:48:53,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:48:53,809 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 01:48:53,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c[2544,2557] [2022-07-22 01:48:53,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:48:53,894 INFO L208 MainTranslator]: Completed translation [2022-07-22 01:48:53,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:53 WrapperNode [2022-07-22 01:48:53,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 01:48:53,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 01:48:53,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 01:48:53,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 01:48:53,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:53" (1/1) ... [2022-07-22 01:48:53,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:53" (1/1) ... [2022-07-22 01:48:53,928 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 87 [2022-07-22 01:48:53,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 01:48:53,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 01:48:53,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 01:48:53,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 01:48:53,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:53" (1/1) ... [2022-07-22 01:48:53,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:53" (1/1) ... [2022-07-22 01:48:53,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:53" (1/1) ... [2022-07-22 01:48:53,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:53" (1/1) ... [2022-07-22 01:48:53,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:53" (1/1) ... [2022-07-22 01:48:53,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:53" (1/1) ... [2022-07-22 01:48:53,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:53" (1/1) ... [2022-07-22 01:48:53,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 01:48:53,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 01:48:53,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 01:48:53,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 01:48:53,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:53" (1/1) ... [2022-07-22 01:48:53,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:48:53,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:48:54,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:48:54,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 01:48:54,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 01:48:54,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 01:48:54,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 01:48:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 01:48:54,108 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 01:48:54,110 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 01:48:54,253 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 01:48:54,259 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 01:48:54,259 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 01:48:54,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:48:54 BoogieIcfgContainer [2022-07-22 01:48:54,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 01:48:54,261 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 01:48:54,261 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 01:48:54,264 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 01:48:54,264 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:48:54,264 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 01:48:53" (1/3) ... [2022-07-22 01:48:54,265 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a976f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:48:54, skipping insertion in model container [2022-07-22 01:48:54,265 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:48:54,265 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:53" (2/3) ... [2022-07-22 01:48:54,266 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a976f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:48:54, skipping insertion in model container [2022-07-22 01:48:54,266 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:48:54,266 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:48:54" (3/3) ... [2022-07-22 01:48:54,267 INFO L354 chiAutomizerObserver]: Analyzing ICFG test_locks_6.c [2022-07-22 01:48:54,355 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 01:48:54,355 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 01:48:54,367 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 01:48:54,367 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 01:48:54,367 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 01:48:54,367 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 01:48:54,368 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 01:48:54,368 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 01:48:54,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:54,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-07-22 01:48:54,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:54,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:54,390 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:54,390 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:48:54,390 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 01:48:54,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:54,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-07-22 01:48:54,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:54,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:54,393 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:54,393 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:48:54,398 INFO L752 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 11#L99-1true [2022-07-22 01:48:54,398 INFO L754 eck$LassoCheckResult]: Loop: 11#L99-1true assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 7#L31true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 14#L48true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 3#L48-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 27#L52-1true assume !(0 != main_~p3~0#1); 20#L56-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 5#L60-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 24#L64-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 23#L68-1true assume !(0 != main_~p1~0#1); 26#L74-1true assume !(0 != main_~p2~0#1); 12#L79-1true assume !(0 != main_~p3~0#1); 22#L84-1true assume !(0 != main_~p4~0#1); 13#L89-1true assume !(0 != main_~p5~0#1); 10#L94-1true assume !(0 != main_~p6~0#1); 11#L99-1true [2022-07-22 01:48:54,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:54,402 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-22 01:48:54,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:54,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308537269] [2022-07-22 01:48:54,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:54,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:54,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:54,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:54,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:54,529 INFO L85 PathProgramCache]: Analyzing trace with hash -11500681, now seen corresponding path program 1 times [2022-07-22 01:48:54,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:54,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982789854] [2022-07-22 01:48:54,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:54,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:48:54,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:54,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982789854] [2022-07-22 01:48:54,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982789854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:54,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:54,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:54,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943404702] [2022-07-22 01:48:54,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:54,625 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:54,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:54,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:54,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:54,669 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:54,708 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2022-07-22 01:48:54,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:54,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 82 transitions. [2022-07-22 01:48:54,720 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2022-07-22 01:48:54,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 41 states and 63 transitions. [2022-07-22 01:48:54,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-07-22 01:48:54,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-07-22 01:48:54,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 63 transitions. [2022-07-22 01:48:54,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:54,730 INFO L369 hiAutomatonCegarLoop]: Abstraction has 41 states and 63 transitions. [2022-07-22 01:48:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 63 transitions. [2022-07-22 01:48:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-07-22 01:48:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2022-07-22 01:48:54,756 INFO L392 hiAutomatonCegarLoop]: Abstraction has 41 states and 63 transitions. [2022-07-22 01:48:54,756 INFO L374 stractBuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2022-07-22 01:48:54,757 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 01:48:54,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 63 transitions. [2022-07-22 01:48:54,760 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2022-07-22 01:48:54,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:54,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:54,762 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:54,762 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:48:54,762 INFO L752 eck$LassoCheckResult]: Stem: 89#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 90#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 104#L99-1 [2022-07-22 01:48:54,763 INFO L754 eck$LassoCheckResult]: Loop: 104#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 119#L31 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 118#L48 assume !(0 != main_~p1~0#1); 87#L48-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 88#L52-1 assume !(0 != main_~p3~0#1); 117#L56-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 116#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 115#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 114#L68-1 assume !(0 != main_~p1~0#1); 111#L74-1 assume !(0 != main_~p2~0#1); 109#L79-1 assume !(0 != main_~p3~0#1); 92#L84-1 assume !(0 != main_~p4~0#1); 123#L89-1 assume !(0 != main_~p5~0#1); 121#L94-1 assume !(0 != main_~p6~0#1); 104#L99-1 [2022-07-22 01:48:54,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:54,764 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-22 01:48:54,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:54,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95378840] [2022-07-22 01:48:54,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:54,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:54,790 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:54,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:54,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:54,798 INFO L85 PathProgramCache]: Analyzing trace with hash 246664757, now seen corresponding path program 1 times [2022-07-22 01:48:54,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:54,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757902395] [2022-07-22 01:48:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:48:54,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:54,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757902395] [2022-07-22 01:48:54,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757902395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:54,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:54,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:54,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706708615] [2022-07-22 01:48:54,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:54,840 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:54,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:54,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:54,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:54,842 INFO L87 Difference]: Start difference. First operand 41 states and 63 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:54,864 INFO L93 Difference]: Finished difference Result 78 states and 118 transitions. [2022-07-22 01:48:54,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:54,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 118 transitions. [2022-07-22 01:48:54,870 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2022-07-22 01:48:54,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 118 transitions. [2022-07-22 01:48:54,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2022-07-22 01:48:54,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-07-22 01:48:54,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 118 transitions. [2022-07-22 01:48:54,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:54,876 INFO L369 hiAutomatonCegarLoop]: Abstraction has 78 states and 118 transitions. [2022-07-22 01:48:54,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 118 transitions. [2022-07-22 01:48:54,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-22 01:48:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 77 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2022-07-22 01:48:54,884 INFO L392 hiAutomatonCegarLoop]: Abstraction has 78 states and 118 transitions. [2022-07-22 01:48:54,884 INFO L374 stractBuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2022-07-22 01:48:54,884 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 01:48:54,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 118 transitions. [2022-07-22 01:48:54,888 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2022-07-22 01:48:54,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:54,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:54,889 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:54,889 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:48:54,890 INFO L752 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 215#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 227#L99-1 [2022-07-22 01:48:54,890 INFO L754 eck$LassoCheckResult]: Loop: 227#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 263#L31 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 259#L48 assume !(0 != main_~p1~0#1); 258#L48-2 assume !(0 != main_~p2~0#1); 257#L52-1 assume !(0 != main_~p3~0#1); 255#L56-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 253#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 251#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 249#L68-1 assume !(0 != main_~p1~0#1); 240#L74-1 assume !(0 != main_~p2~0#1); 238#L79-1 assume !(0 != main_~p3~0#1); 217#L84-1 assume !(0 != main_~p4~0#1); 276#L89-1 assume !(0 != main_~p5~0#1); 272#L94-1 assume !(0 != main_~p6~0#1); 227#L99-1 [2022-07-22 01:48:54,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:54,891 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-22 01:48:54,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:54,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234720182] [2022-07-22 01:48:54,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:54,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:54,902 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:54,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:54,915 INFO L85 PathProgramCache]: Analyzing trace with hash 947729335, now seen corresponding path program 1 times [2022-07-22 01:48:54,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:54,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985334756] [2022-07-22 01:48:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:54,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:48:54,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:54,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985334756] [2022-07-22 01:48:54,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985334756] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:54,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:54,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:54,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117956197] [2022-07-22 01:48:54,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:54,942 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:54,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:54,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:54,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:54,943 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:54,968 INFO L93 Difference]: Finished difference Result 150 states and 222 transitions. [2022-07-22 01:48:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:54,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 222 transitions. [2022-07-22 01:48:54,972 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2022-07-22 01:48:54,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 222 transitions. [2022-07-22 01:48:54,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2022-07-22 01:48:54,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2022-07-22 01:48:54,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 222 transitions. [2022-07-22 01:48:54,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:54,980 INFO L369 hiAutomatonCegarLoop]: Abstraction has 150 states and 222 transitions. [2022-07-22 01:48:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 222 transitions. [2022-07-22 01:48:54,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-07-22 01:48:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.48) internal successors, (222), 149 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2022-07-22 01:48:54,995 INFO L392 hiAutomatonCegarLoop]: Abstraction has 150 states and 222 transitions. [2022-07-22 01:48:54,995 INFO L374 stractBuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2022-07-22 01:48:54,995 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 01:48:54,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 222 transitions. [2022-07-22 01:48:54,997 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2022-07-22 01:48:54,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:54,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:54,997 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:54,998 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:48:54,998 INFO L752 eck$LassoCheckResult]: Stem: 448#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 449#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 461#L99-1 [2022-07-22 01:48:54,998 INFO L754 eck$LassoCheckResult]: Loop: 461#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 503#L31 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 498#L48 assume !(0 != main_~p1~0#1); 492#L48-2 assume !(0 != main_~p2~0#1); 485#L52-1 assume !(0 != main_~p3~0#1); 486#L56-1 assume !(0 != main_~p4~0#1); 546#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 545#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 539#L68-1 assume !(0 != main_~p1~0#1); 541#L74-1 assume !(0 != main_~p2~0#1); 538#L79-1 assume !(0 != main_~p3~0#1); 536#L84-1 assume !(0 != main_~p4~0#1); 535#L89-1 assume !(0 != main_~p5~0#1); 517#L94-1 assume !(0 != main_~p6~0#1); 461#L99-1 [2022-07-22 01:48:54,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:54,999 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-22 01:48:54,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:54,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387660825] [2022-07-22 01:48:54,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:54,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:55,008 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:55,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:55,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:55,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1627787705, now seen corresponding path program 1 times [2022-07-22 01:48:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:55,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639000104] [2022-07-22 01:48:55,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:55,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:48:55,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:55,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639000104] [2022-07-22 01:48:55,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639000104] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:55,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:55,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:55,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732129782] [2022-07-22 01:48:55,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:55,069 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:55,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:55,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:55,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:55,070 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. cyclomatic complexity: 80 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:55,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:55,081 INFO L93 Difference]: Finished difference Result 290 states and 418 transitions. [2022-07-22 01:48:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:55,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 418 transitions. [2022-07-22 01:48:55,084 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2022-07-22 01:48:55,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 290 states and 418 transitions. [2022-07-22 01:48:55,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2022-07-22 01:48:55,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2022-07-22 01:48:55,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 418 transitions. [2022-07-22 01:48:55,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:55,088 INFO L369 hiAutomatonCegarLoop]: Abstraction has 290 states and 418 transitions. [2022-07-22 01:48:55,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 418 transitions. [2022-07-22 01:48:55,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2022-07-22 01:48:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 290 states have (on average 1.4413793103448276) internal successors, (418), 289 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 418 transitions. [2022-07-22 01:48:55,105 INFO L392 hiAutomatonCegarLoop]: Abstraction has 290 states and 418 transitions. [2022-07-22 01:48:55,107 INFO L374 stractBuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2022-07-22 01:48:55,107 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 01:48:55,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 418 transitions. [2022-07-22 01:48:55,108 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2022-07-22 01:48:55,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:55,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:55,110 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:55,110 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:48:55,110 INFO L752 eck$LassoCheckResult]: Stem: 894#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 895#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 907#L99-1 [2022-07-22 01:48:55,111 INFO L754 eck$LassoCheckResult]: Loop: 907#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 955#L31 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 953#L48 assume !(0 != main_~p1~0#1); 949#L48-2 assume !(0 != main_~p2~0#1); 947#L52-1 assume !(0 != main_~p3~0#1); 943#L56-1 assume !(0 != main_~p4~0#1); 939#L60-1 assume !(0 != main_~p5~0#1); 937#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 934#L68-1 assume !(0 != main_~p1~0#1); 935#L74-1 assume !(0 != main_~p2~0#1); 971#L79-1 assume !(0 != main_~p3~0#1); 966#L84-1 assume !(0 != main_~p4~0#1); 962#L89-1 assume !(0 != main_~p5~0#1); 959#L94-1 assume !(0 != main_~p6~0#1); 907#L99-1 [2022-07-22 01:48:55,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:55,111 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-22 01:48:55,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:55,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702026500] [2022-07-22 01:48:55,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:55,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:55,118 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:55,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:55,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:55,123 INFO L85 PathProgramCache]: Analyzing trace with hash 818441079, now seen corresponding path program 1 times [2022-07-22 01:48:55,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:55,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062493835] [2022-07-22 01:48:55,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:55,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:48:55,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:55,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062493835] [2022-07-22 01:48:55,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062493835] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:55,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:55,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 01:48:55,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841942923] [2022-07-22 01:48:55,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:55,147 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:55,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:55,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:55,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:55,148 INFO L87 Difference]: Start difference. First operand 290 states and 418 transitions. cyclomatic complexity: 144 Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:55,163 INFO L93 Difference]: Finished difference Result 562 states and 786 transitions. [2022-07-22 01:48:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:55,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 562 states and 786 transitions. [2022-07-22 01:48:55,167 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2022-07-22 01:48:55,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 562 states to 562 states and 786 transitions. [2022-07-22 01:48:55,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 562 [2022-07-22 01:48:55,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 562 [2022-07-22 01:48:55,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 562 states and 786 transitions. [2022-07-22 01:48:55,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:55,173 INFO L369 hiAutomatonCegarLoop]: Abstraction has 562 states and 786 transitions. [2022-07-22 01:48:55,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states and 786 transitions. [2022-07-22 01:48:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2022-07-22 01:48:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 562 states have (on average 1.398576512455516) internal successors, (786), 561 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 786 transitions. [2022-07-22 01:48:55,197 INFO L392 hiAutomatonCegarLoop]: Abstraction has 562 states and 786 transitions. [2022-07-22 01:48:55,197 INFO L374 stractBuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2022-07-22 01:48:55,198 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 01:48:55,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 562 states and 786 transitions. [2022-07-22 01:48:55,200 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2022-07-22 01:48:55,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:55,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:55,203 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:55,203 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:48:55,203 INFO L752 eck$LassoCheckResult]: Stem: 1752#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 1753#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 1765#L99-1 [2022-07-22 01:48:55,203 INFO L754 eck$LassoCheckResult]: Loop: 1765#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 1846#L31 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 1842#L48 assume !(0 != main_~p1~0#1); 1835#L48-2 assume !(0 != main_~p2~0#1); 1830#L52-1 assume !(0 != main_~p3~0#1); 1823#L56-1 assume !(0 != main_~p4~0#1); 1815#L60-1 assume !(0 != main_~p5~0#1); 1809#L64-1 assume !(0 != main_~p6~0#1); 1803#L68-1 assume !(0 != main_~p1~0#1); 1804#L74-1 assume !(0 != main_~p2~0#1); 1873#L79-1 assume !(0 != main_~p3~0#1); 1864#L84-1 assume !(0 != main_~p4~0#1); 1857#L89-1 assume !(0 != main_~p5~0#1); 1853#L94-1 assume !(0 != main_~p6~0#1); 1765#L99-1 [2022-07-22 01:48:55,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:55,204 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-07-22 01:48:55,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:55,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354134202] [2022-07-22 01:48:55,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:55,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:55,209 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:55,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:55,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:55,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1701518855, now seen corresponding path program 1 times [2022-07-22 01:48:55,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:55,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932845983] [2022-07-22 01:48:55,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:55,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:55,217 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:55,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:55,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1159342651, now seen corresponding path program 1 times [2022-07-22 01:48:55,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:55,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100268792] [2022-07-22 01:48:55,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:55,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:55,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:55,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:55,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 01:48:55 BoogieIcfgContainer [2022-07-22 01:48:55,483 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 01:48:55,483 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 01:48:55,483 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 01:48:55,484 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 01:48:55,484 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:48:54" (3/4) ... [2022-07-22 01:48:55,486 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-22 01:48:55,532 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 01:48:55,532 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 01:48:55,533 INFO L158 Benchmark]: Toolchain (without parser) took 1923.98ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 35.4MB in the beginning and 41.7MB in the end (delta: -6.4MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-07-22 01:48:55,535 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 37.6MB in the beginning and 37.6MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:48:55,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.42ms. Allocated memory is still 56.6MB. Free memory was 35.1MB in the beginning and 40.2MB in the end (delta: -5.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-22 01:48:55,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.00ms. Allocated memory is still 56.6MB. Free memory was 40.2MB in the beginning and 38.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:48:55,536 INFO L158 Benchmark]: Boogie Preprocessor took 36.04ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 37.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:48:55,537 INFO L158 Benchmark]: RCFGBuilder took 294.44ms. Allocated memory is still 56.6MB. Free memory was 37.6MB in the beginning and 27.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 01:48:55,537 INFO L158 Benchmark]: BuchiAutomizer took 1221.54ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 27.6MB in the beginning and 43.8MB in the end (delta: -16.3MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2022-07-22 01:48:55,538 INFO L158 Benchmark]: Witness Printer took 48.79ms. Allocated memory is still 69.2MB. Free memory was 43.8MB in the beginning and 41.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 01:48:55,542 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 37.6MB in the beginning and 37.6MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.42ms. Allocated memory is still 56.6MB. Free memory was 35.1MB in the beginning and 40.2MB in the end (delta: -5.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.00ms. Allocated memory is still 56.6MB. Free memory was 40.2MB in the beginning and 38.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.04ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 37.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 294.44ms. Allocated memory is still 56.6MB. Free memory was 37.6MB in the beginning and 27.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1221.54ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 27.6MB in the beginning and 43.8MB in the end (delta: -16.3MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Witness Printer took 48.79ms. Allocated memory is still 69.2MB. Free memory was 43.8MB in the beginning and 41.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 562 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 405 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 256 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 29]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65926cb5=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6dc96a24=0, lk5=0, p1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c89fa4f=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12af24a4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@522f94fa=0, NULL=1, \result=0, cond=4, p5=0, lk2=0, p4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6cb61f87=4, p6=0, NULL=0, p2=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a372fb0=0, lk6=0, lk1=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L27] int cond; Loop: [L29] COND TRUE 1 [L30] cond = __VERIFIER_nondet_int() [L31] COND FALSE !(cond == 0) [L34] lk1 = 0 [L36] lk2 = 0 [L38] lk3 = 0 [L40] lk4 = 0 [L42] lk5 = 0 [L44] lk6 = 0 [L48] COND FALSE !(p1 != 0) [L52] COND FALSE !(p2 != 0) [L56] COND FALSE !(p3 != 0) [L60] COND FALSE !(p4 != 0) [L64] COND FALSE !(p5 != 0) [L68] COND FALSE !(p6 != 0) [L74] COND FALSE !(p1 != 0) [L79] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L89] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L99] COND FALSE !(p6 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-22 01:48:55,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)