./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 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-?-791161d [2022-07-23 14:38:43,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 14:38:43,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 14:38:43,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 14:38:43,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 14:38:43,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 14:38:43,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 14:38:43,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 14:38:43,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 14:38:43,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 14:38:43,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 14:38:43,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 14:38:43,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 14:38:43,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 14:38:43,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 14:38:43,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 14:38:43,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 14:38:43,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 14:38:43,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 14:38:43,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 14:38:43,267 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 14:38:43,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 14:38:43,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 14:38:43,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 14:38:43,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 14:38:43,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 14:38:43,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 14:38:43,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 14:38:43,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 14:38:43,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 14:38:43,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 14:38:43,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 14:38:43,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 14:38:43,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 14:38:43,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 14:38:43,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 14:38:43,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 14:38:43,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 14:38:43,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 14:38:43,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 14:38:43,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 14:38:43,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 14:38:43,287 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 14:38:43,318 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 14:38:43,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 14:38:43,319 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 14:38:43,319 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 14:38:43,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 14:38:43,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 14:38:43,321 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 14:38:43,321 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 14:38:43,321 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 14:38:43,321 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 14:38:43,322 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 14:38:43,322 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 14:38:43,322 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 14:38:43,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 14:38:43,322 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 14:38:43,323 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 14:38:43,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 14:38:43,323 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 14:38:43,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 14:38:43,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 14:38:43,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 14:38:43,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 14:38:43,324 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 14:38:43,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 14:38:43,325 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 14:38:43,325 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 14:38:43,325 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 14:38:43,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 14:38:43,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 14:38:43,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 14:38:43,327 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 14:38:43,328 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 14:38:43,328 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-23 14:38:43,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 14:38:43,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 14:38:43,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 14:38:43,578 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 14:38:43,578 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 14:38:43,580 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-23 14:38:43,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e67e4e39/5e6c2a0895854743817652cda2ea403c/FLAG1e60f2191 [2022-07-23 14:38:44,087 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 14:38:44,088 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2022-07-23 14:38:44,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e67e4e39/5e6c2a0895854743817652cda2ea403c/FLAG1e60f2191 [2022-07-23 14:38:44,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e67e4e39/5e6c2a0895854743817652cda2ea403c [2022-07-23 14:38:44,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 14:38:44,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 14:38:44,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 14:38:44,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 14:38:44,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 14:38:44,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:38:44" (1/1) ... [2022-07-23 14:38:44,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c75728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:38:44, skipping insertion in model container [2022-07-23 14:38:44,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:38:44" (1/1) ... [2022-07-23 14:38:44,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 14:38:44,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 14:38:44,313 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-23 14:38:44,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:38:44,323 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 14:38:44,357 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-23 14:38:44,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:38:44,367 INFO L208 MainTranslator]: Completed translation [2022-07-23 14:38:44,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:38:44 WrapperNode [2022-07-23 14:38:44,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 14:38:44,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 14:38:44,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 14:38:44,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 14:38:44,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:38:44" (1/1) ... [2022-07-23 14:38:44,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:38:44" (1/1) ... [2022-07-23 14:38:44,399 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 87 [2022-07-23 14:38:44,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 14:38:44,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 14:38:44,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 14:38:44,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 14:38:44,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:38:44" (1/1) ... [2022-07-23 14:38:44,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:38:44" (1/1) ... [2022-07-23 14:38:44,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:38:44" (1/1) ... [2022-07-23 14:38:44,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:38:44" (1/1) ... [2022-07-23 14:38:44,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:38:44" (1/1) ... [2022-07-23 14:38:44,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:38:44" (1/1) ... [2022-07-23 14:38:44,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:38:44" (1/1) ... [2022-07-23 14:38:44,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 14:38:44,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 14:38:44,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 14:38:44,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 14:38:44,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:38:44" (1/1) ... [2022-07-23 14:38:44,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:38:44,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:38:44,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:38:44,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 14:38:44,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 14:38:44,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 14:38:44,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 14:38:44,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 14:38:44,546 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 14:38:44,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 14:38:44,719 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 14:38:44,724 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 14:38:44,724 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 14:38:44,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:38:44 BoogieIcfgContainer [2022-07-23 14:38:44,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 14:38:44,730 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 14:38:44,730 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 14:38:44,735 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 14:38:44,746 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:38:44,747 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 02:38:44" (1/3) ... [2022-07-23 14:38:44,748 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a739cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:38:44, skipping insertion in model container [2022-07-23 14:38:44,748 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:38:44,748 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:38:44" (2/3) ... [2022-07-23 14:38:44,748 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a739cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:38:44, skipping insertion in model container [2022-07-23 14:38:44,749 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:38:44,749 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:38:44" (3/3) ... [2022-07-23 14:38:44,750 INFO L354 chiAutomizerObserver]: Analyzing ICFG test_locks_6.c [2022-07-23 14:38:44,817 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 14:38:44,817 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 14:38:44,817 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 14:38:44,817 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 14:38:44,817 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 14:38:44,818 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 14:38:44,818 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 14:38:44,819 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 14:38:44,824 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-23 14:38:44,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-07-23 14:38:44,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:38:44,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:38:44,850 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:38:44,850 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:38:44,850 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 14:38:44,851 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-23 14:38:44,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-07-23 14:38:44,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:38:44,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:38:44,857 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:38:44,857 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:38:44,864 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-23 14:38:44,867 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-23 14:38:44,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:38:44,879 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-23 14:38:44,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:38:44,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744934733] [2022-07-23 14:38:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:38:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:38:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:38:44,968 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:38:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:38:44,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:38:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:38:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash -11500681, now seen corresponding path program 1 times [2022-07-23 14:38:45,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:38:45,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422416167] [2022-07-23 14:38:45,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:38:45,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:38:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:38:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:38:45,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:38:45,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422416167] [2022-07-23 14:38:45,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422416167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:38:45,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:38:45,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:38:45,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93139079] [2022-07-23 14:38:45,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:38:45,063 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:38:45,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:38:45,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:38:45,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:38:45,094 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-23 14:38:45,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:38:45,119 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2022-07-23 14:38:45,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:38:45,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 82 transitions. [2022-07-23 14:38:45,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2022-07-23 14:38:45,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 41 states and 63 transitions. [2022-07-23 14:38:45,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-07-23 14:38:45,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-07-23 14:38:45,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 63 transitions. [2022-07-23 14:38:45,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:38:45,136 INFO L369 hiAutomatonCegarLoop]: Abstraction has 41 states and 63 transitions. [2022-07-23 14:38:45,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 63 transitions. [2022-07-23 14:38:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-07-23 14:38:45,161 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-23 14:38:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2022-07-23 14:38:45,164 INFO L392 hiAutomatonCegarLoop]: Abstraction has 41 states and 63 transitions. [2022-07-23 14:38:45,164 INFO L374 stractBuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2022-07-23 14:38:45,164 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 14:38:45,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 63 transitions. [2022-07-23 14:38:45,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2022-07-23 14:38:45,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:38:45,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:38:45,166 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:38:45,166 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:38:45,167 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-23 14:38:45,167 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-23 14:38:45,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:38:45,168 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-23 14:38:45,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:38:45,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924568097] [2022-07-23 14:38:45,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:38:45,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:38:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:38:45,176 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:38:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:38:45,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:38:45,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:38:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash 246664757, now seen corresponding path program 1 times [2022-07-23 14:38:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:38:45,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43969113] [2022-07-23 14:38:45,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:38:45,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:38:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:38:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:38:45,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:38:45,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43969113] [2022-07-23 14:38:45,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43969113] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:38:45,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:38:45,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:38:45,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740975759] [2022-07-23 14:38:45,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:38:45,246 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:38:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:38:45,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:38:45,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:38:45,249 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-23 14:38:45,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:38:45,280 INFO L93 Difference]: Finished difference Result 78 states and 118 transitions. [2022-07-23 14:38:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:38:45,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 118 transitions. [2022-07-23 14:38:45,284 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2022-07-23 14:38:45,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 118 transitions. [2022-07-23 14:38:45,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2022-07-23 14:38:45,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-07-23 14:38:45,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 118 transitions. [2022-07-23 14:38:45,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:38:45,291 INFO L369 hiAutomatonCegarLoop]: Abstraction has 78 states and 118 transitions. [2022-07-23 14:38:45,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 118 transitions. [2022-07-23 14:38:45,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-23 14:38:45,296 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-23 14:38:45,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2022-07-23 14:38:45,297 INFO L392 hiAutomatonCegarLoop]: Abstraction has 78 states and 118 transitions. [2022-07-23 14:38:45,298 INFO L374 stractBuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2022-07-23 14:38:45,298 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 14:38:45,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 118 transitions. [2022-07-23 14:38:45,299 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2022-07-23 14:38:45,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:38:45,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:38:45,300 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:38:45,300 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:38:45,300 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-23 14:38:45,300 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-23 14:38:45,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:38:45,301 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-23 14:38:45,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:38:45,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225689546] [2022-07-23 14:38:45,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:38:45,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:38:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:38:45,316 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:38:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:38:45,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:38:45,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:38:45,331 INFO L85 PathProgramCache]: Analyzing trace with hash 947729335, now seen corresponding path program 1 times [2022-07-23 14:38:45,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:38:45,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484393043] [2022-07-23 14:38:45,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:38:45,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:38:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:38:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:38:45,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:38:45,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484393043] [2022-07-23 14:38:45,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484393043] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:38:45,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:38:45,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:38:45,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88017682] [2022-07-23 14:38:45,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:38:45,374 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:38:45,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:38:45,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:38:45,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:38:45,376 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-23 14:38:45,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:38:45,406 INFO L93 Difference]: Finished difference Result 150 states and 222 transitions. [2022-07-23 14:38:45,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:38:45,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 222 transitions. [2022-07-23 14:38:45,411 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2022-07-23 14:38:45,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 222 transitions. [2022-07-23 14:38:45,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2022-07-23 14:38:45,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2022-07-23 14:38:45,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 222 transitions. [2022-07-23 14:38:45,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:38:45,417 INFO L369 hiAutomatonCegarLoop]: Abstraction has 150 states and 222 transitions. [2022-07-23 14:38:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 222 transitions. [2022-07-23 14:38:45,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-07-23 14:38:45,426 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-23 14:38:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2022-07-23 14:38:45,428 INFO L392 hiAutomatonCegarLoop]: Abstraction has 150 states and 222 transitions. [2022-07-23 14:38:45,429 INFO L374 stractBuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2022-07-23 14:38:45,429 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 14:38:45,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 222 transitions. [2022-07-23 14:38:45,431 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2022-07-23 14:38:45,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:38:45,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:38:45,434 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:38:45,434 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:38:45,434 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-23 14:38:45,434 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-23 14:38:45,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:38:45,435 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-23 14:38:45,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:38:45,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727095959] [2022-07-23 14:38:45,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:38:45,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:38:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:38:45,440 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:38:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:38:45,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:38:45,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:38:45,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1627787705, now seen corresponding path program 1 times [2022-07-23 14:38:45,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:38:45,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273597047] [2022-07-23 14:38:45,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:38:45,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:38:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:38:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:38:45,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:38:45,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273597047] [2022-07-23 14:38:45,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273597047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:38:45,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:38:45,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:38:45,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361271616] [2022-07-23 14:38:45,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:38:45,468 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:38:45,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:38:45,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:38:45,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:38:45,470 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-23 14:38:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:38:45,493 INFO L93 Difference]: Finished difference Result 290 states and 418 transitions. [2022-07-23 14:38:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:38:45,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 418 transitions. [2022-07-23 14:38:45,497 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2022-07-23 14:38:45,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 290 states and 418 transitions. [2022-07-23 14:38:45,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2022-07-23 14:38:45,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2022-07-23 14:38:45,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 418 transitions. [2022-07-23 14:38:45,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:38:45,503 INFO L369 hiAutomatonCegarLoop]: Abstraction has 290 states and 418 transitions. [2022-07-23 14:38:45,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 418 transitions. [2022-07-23 14:38:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2022-07-23 14:38:45,522 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-23 14:38:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 418 transitions. [2022-07-23 14:38:45,526 INFO L392 hiAutomatonCegarLoop]: Abstraction has 290 states and 418 transitions. [2022-07-23 14:38:45,526 INFO L374 stractBuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2022-07-23 14:38:45,526 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 14:38:45,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 418 transitions. [2022-07-23 14:38:45,528 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2022-07-23 14:38:45,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:38:45,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:38:45,529 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:38:45,529 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:38:45,529 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-23 14:38:45,530 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-23 14:38:45,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:38:45,530 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-23 14:38:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:38:45,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404169873] [2022-07-23 14:38:45,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:38:45,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:38:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:38:45,537 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:38:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:38:45,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:38:45,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:38:45,545 INFO L85 PathProgramCache]: Analyzing trace with hash 818441079, now seen corresponding path program 1 times [2022-07-23 14:38:45,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:38:45,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648616597] [2022-07-23 14:38:45,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:38:45,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:38:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:38:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:38:45,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:38:45,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648616597] [2022-07-23 14:38:45,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648616597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:38:45,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:38:45,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 14:38:45,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047200247] [2022-07-23 14:38:45,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:38:45,565 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:38:45,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:38:45,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:38:45,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:38:45,566 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-23 14:38:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:38:45,583 INFO L93 Difference]: Finished difference Result 562 states and 786 transitions. [2022-07-23 14:38:45,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:38:45,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 562 states and 786 transitions. [2022-07-23 14:38:45,588 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2022-07-23 14:38:45,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 562 states to 562 states and 786 transitions. [2022-07-23 14:38:45,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 562 [2022-07-23 14:38:45,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 562 [2022-07-23 14:38:45,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 562 states and 786 transitions. [2022-07-23 14:38:45,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:38:45,595 INFO L369 hiAutomatonCegarLoop]: Abstraction has 562 states and 786 transitions. [2022-07-23 14:38:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states and 786 transitions. [2022-07-23 14:38:45,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2022-07-23 14:38:45,610 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-23 14:38:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 786 transitions. [2022-07-23 14:38:45,613 INFO L392 hiAutomatonCegarLoop]: Abstraction has 562 states and 786 transitions. [2022-07-23 14:38:45,613 INFO L374 stractBuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2022-07-23 14:38:45,613 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 14:38:45,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 562 states and 786 transitions. [2022-07-23 14:38:45,616 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2022-07-23 14:38:45,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:38:45,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:38:45,617 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:38:45,617 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:38:45,618 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-23 14:38:45,618 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-23 14:38:45,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:38:45,619 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-07-23 14:38:45,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:38:45,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204394303] [2022-07-23 14:38:45,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:38:45,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:38:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:38:45,625 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:38:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:38:45,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:38:45,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:38:45,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1701518855, now seen corresponding path program 1 times [2022-07-23 14:38:45,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:38:45,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379912293] [2022-07-23 14:38:45,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:38:45,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:38:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:38:45,639 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:38:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:38:45,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:38:45,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:38:45,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1159342651, now seen corresponding path program 1 times [2022-07-23 14:38:45,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:38:45,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964704388] [2022-07-23 14:38:45,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:38:45,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:38:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:38:45,656 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:38:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:38:45,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:38:45,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.07 02:38:45 BoogieIcfgContainer [2022-07-23 14:38:45,929 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-23 14:38:45,930 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 14:38:45,930 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 14:38:45,930 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 14:38:45,931 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:38:44" (3/4) ... [2022-07-23 14:38:45,934 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-23 14:38:45,991 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-23 14:38:45,995 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 14:38:46,003 INFO L158 Benchmark]: Toolchain (without parser) took 1881.02ms. Allocated memory was 102.8MB in the beginning and 138.4MB in the end (delta: 35.7MB). Free memory was 70.1MB in the beginning and 112.3MB in the end (delta: -42.2MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2022-07-23 14:38:46,007 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:38:46,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.81ms. Allocated memory was 102.8MB in the beginning and 138.4MB in the end (delta: 35.7MB). Free memory was 69.9MB in the beginning and 113.1MB in the end (delta: -43.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 14:38:46,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.37ms. Allocated memory is still 138.4MB. Free memory was 113.1MB in the beginning and 111.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 14:38:46,008 INFO L158 Benchmark]: Boogie Preprocessor took 27.18ms. Allocated memory is still 138.4MB. Free memory was 111.5MB in the beginning and 110.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 14:38:46,008 INFO L158 Benchmark]: RCFGBuilder took 301.08ms. Allocated memory is still 138.4MB. Free memory was 110.3MB in the beginning and 100.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 14:38:46,009 INFO L158 Benchmark]: BuchiAutomizer took 1199.53ms. Allocated memory is still 138.4MB. Free memory was 100.5MB in the beginning and 66.9MB in the end (delta: 33.6MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2022-07-23 14:38:46,009 INFO L158 Benchmark]: Witness Printer took 65.06ms. Allocated memory is still 138.4MB. Free memory was 66.9MB in the beginning and 112.3MB in the end (delta: -45.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-23 14:38:46,011 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.18ms. Allocated memory is still 102.8MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.81ms. Allocated memory was 102.8MB in the beginning and 138.4MB in the end (delta: 35.7MB). Free memory was 69.9MB in the beginning and 113.1MB in the end (delta: -43.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.37ms. Allocated memory is still 138.4MB. Free memory was 113.1MB in the beginning and 111.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.18ms. Allocated memory is still 138.4MB. Free memory was 111.5MB in the beginning and 110.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 301.08ms. Allocated memory is still 138.4MB. Free memory was 110.3MB in the beginning and 100.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 1199.53ms. Allocated memory is still 138.4MB. Free memory was 100.5MB in the beginning and 66.9MB in the end (delta: 33.6MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * Witness Printer took 65.06ms. Allocated memory is still 138.4MB. Free memory was 66.9MB in the beginning and 112.3MB in the end (delta: -45.4MB). Peak memory consumption was 4.2MB. 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@198c3276=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ad6a5a=0, lk5=0, p1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@417ef53=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44d88dc3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40a005fe=0, NULL=1, \result=0, cond=4, p5=0, lk2=0, p4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16e52a05=4, p6=0, NULL=0, p2=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e02ba31=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-23 14:38:46,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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)