./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e19ca921 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/systemc/pc_sfifo_1.cil-2.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 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 20:28:53,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 20:28:53,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 20:28:53,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 20:28:53,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 20:28:53,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 20:28:53,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 20:28:53,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 20:28:53,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 20:28:53,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 20:28:53,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 20:28:53,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 20:28:53,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 20:28:53,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 20:28:53,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 20:28:53,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 20:28:53,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 20:28:53,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 20:28:53,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 20:28:53,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 20:28:53,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 20:28:53,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 20:28:53,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 20:28:53,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 20:28:53,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 20:28:53,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 20:28:53,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 20:28:53,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 20:28:53,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 20:28:53,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 20:28:53,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 20:28:53,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 20:28:53,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 20:28:53,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 20:28:53,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 20:28:53,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 20:28:53,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 20:28:53,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 20:28:53,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 20:28:53,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 20:28:53,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 20:28:53,493 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-22 20:28:53,514 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 20:28:53,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 20:28:53,515 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 20:28:53,515 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 20:28:53,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 20:28:53,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 20:28:53,517 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 20:28:53,517 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-22 20:28:53,517 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-22 20:28:53,518 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-22 20:28:53,518 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-22 20:28:53,518 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-22 20:28:53,519 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-22 20:28:53,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 20:28:53,519 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 20:28:53,519 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 20:28:53,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 20:28:53,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 20:28:53,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 20:28:53,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-22 20:28:53,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-22 20:28:53,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-22 20:28:53,520 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 20:28:53,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 20:28:53,521 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-22 20:28:53,522 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 20:28:53,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-22 20:28:53,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 20:28:53,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 20:28:53,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 20:28:53,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 20:28:53,523 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 20:28:53,523 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-22 20:28:53,524 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 -> 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 [2021-12-22 20:28:53,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 20:28:53,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 20:28:53,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 20:28:53,738 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 20:28:53,738 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 20:28:53,739 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-12-22 20:28:53,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f932d7b/2dba0e8d15be4b30b4fcfd05888880e4/FLAG3572aaa1a [2021-12-22 20:28:54,183 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 20:28:54,184 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-12-22 20:28:54,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f932d7b/2dba0e8d15be4b30b4fcfd05888880e4/FLAG3572aaa1a [2021-12-22 20:28:54,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f932d7b/2dba0e8d15be4b30b4fcfd05888880e4 [2021-12-22 20:28:54,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 20:28:54,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 20:28:54,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 20:28:54,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 20:28:54,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 20:28:54,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 08:28:54" (1/1) ... [2021-12-22 20:28:54,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d472c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:28:54, skipping insertion in model container [2021-12-22 20:28:54,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 08:28:54" (1/1) ... [2021-12-22 20:28:54,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 20:28:54,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 20:28:54,356 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/systemc/pc_sfifo_1.cil-2.c[642,655] [2021-12-22 20:28:54,379 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 20:28:54,385 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 20:28:54,393 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/systemc/pc_sfifo_1.cil-2.c[642,655] [2021-12-22 20:28:54,403 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 20:28:54,414 INFO L208 MainTranslator]: Completed translation [2021-12-22 20:28:54,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:28:54 WrapperNode [2021-12-22 20:28:54,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 20:28:54,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 20:28:54,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 20:28:54,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 20:28:54,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:28:54" (1/1) ... [2021-12-22 20:28:54,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:28:54" (1/1) ... [2021-12-22 20:28:54,453 INFO L137 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 255 [2021-12-22 20:28:54,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 20:28:54,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 20:28:54,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 20:28:54,455 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 20:28:54,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:28:54" (1/1) ... [2021-12-22 20:28:54,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:28:54" (1/1) ... [2021-12-22 20:28:54,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:28:54" (1/1) ... [2021-12-22 20:28:54,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:28:54" (1/1) ... [2021-12-22 20:28:54,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:28:54" (1/1) ... [2021-12-22 20:28:54,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:28:54" (1/1) ... [2021-12-22 20:28:54,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:28:54" (1/1) ... [2021-12-22 20:28:54,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 20:28:54,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 20:28:54,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 20:28:54,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 20:28:54,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:28:54" (1/1) ... [2021-12-22 20:28:54,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:28:54,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:28:54,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 20:28:54,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-22 20:28:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 20:28:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 20:28:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 20:28:54,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 20:28:54,624 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 20:28:54,626 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 20:28:54,823 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 20:28:54,828 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 20:28:54,840 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-22 20:28:54,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:28:54 BoogieIcfgContainer [2021-12-22 20:28:54,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 20:28:54,843 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-22 20:28:54,843 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-22 20:28:54,845 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-22 20:28:54,846 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:28:54,846 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.12 08:28:54" (1/3) ... [2021-12-22 20:28:54,847 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22884eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 08:28:54, skipping insertion in model container [2021-12-22 20:28:54,847 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:28:54,847 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:28:54" (2/3) ... [2021-12-22 20:28:54,847 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22884eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 08:28:54, skipping insertion in model container [2021-12-22 20:28:54,847 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:28:54,848 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:28:54" (3/3) ... [2021-12-22 20:28:54,848 INFO L388 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2021-12-22 20:28:54,879 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-22 20:28:54,879 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-22 20:28:54,879 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-22 20:28:54,883 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-22 20:28:54,883 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-22 20:28:54,883 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-22 20:28:54,883 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-22 20:28:54,883 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-22 20:28:54,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 79 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 78 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:28:54,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2021-12-22 20:28:54,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:28:54,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:28:54,919 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-22 20:28:54,920 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:28:54,920 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-22 20:28:54,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 79 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 78 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:28:54,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2021-12-22 20:28:54,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:28:54,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:28:54,926 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-22 20:28:54,927 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:28:54,932 INFO L791 eck$LassoCheckResult]: Stem: 60#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 43#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 21#L356true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 37#L206true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 4#L206-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 45#L211-1true assume { :end_inline_init_threads } true; 68#L323-2true [2021-12-22 20:28:54,932 INFO L793 eck$LassoCheckResult]: Loop: 68#L323-2true assume !false; 16#L324true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 49#L272true assume false; 29#L288true assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 61#L224-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 76#L236-1true exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 11#L237-1true stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 17#L302true assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1; 19#L309true stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 10#L310true start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 55#L330true assume !(0 != start_simulation_~tmp~3#1); 68#L323-2true [2021-12-22 20:28:54,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:28:54,936 INFO L85 PathProgramCache]: Analyzing trace with hash 889479019, now seen corresponding path program 1 times [2021-12-22 20:28:54,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:28:54,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386501295] [2021-12-22 20:28:54,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:28:54,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:28:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:28:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:28:55,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:28:55,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386501295] [2021-12-22 20:28:55,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386501295] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:28:55,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:28:55,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 20:28:55,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147563125] [2021-12-22 20:28:55,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:28:55,068 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 20:28:55,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:28:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash 740616813, now seen corresponding path program 1 times [2021-12-22 20:28:55,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:28:55,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018082591] [2021-12-22 20:28:55,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:28:55,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:28:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:28:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:28:55,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:28:55,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018082591] [2021-12-22 20:28:55,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018082591] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:28:55,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:28:55,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 20:28:55,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493382835] [2021-12-22 20:28:55,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:28:55,102 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 20:28:55,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:28:55,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 20:28:55,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 20:28:55,129 INFO L87 Difference]: Start difference. First operand has 79 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 78 states have internal predecessors, (119), 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 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:28:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:28:55,162 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2021-12-22 20:28:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 20:28:55,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 106 transitions. [2021-12-22 20:28:55,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2021-12-22 20:28:55,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 100 transitions. [2021-12-22 20:28:55,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2021-12-22 20:28:55,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2021-12-22 20:28:55,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 100 transitions. [2021-12-22 20:28:55,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:28:55,186 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 100 transitions. [2021-12-22 20:28:55,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 100 transitions. [2021-12-22 20:28:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-22 20:28:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.408450704225352) internal successors, (100), 70 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:28:55,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2021-12-22 20:28:55,213 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 100 transitions. [2021-12-22 20:28:55,213 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 100 transitions. [2021-12-22 20:28:55,213 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-22 20:28:55,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 100 transitions. [2021-12-22 20:28:55,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2021-12-22 20:28:55,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:28:55,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:28:55,218 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-22 20:28:55,218 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:28:55,218 INFO L791 eck$LassoCheckResult]: Stem: 230#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 192#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 193#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 171#L206-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 172#L211-1 assume { :end_inline_init_threads } true; 221#L323-2 [2021-12-22 20:28:55,218 INFO L793 eck$LassoCheckResult]: Loop: 221#L323-2 assume !false; 190#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 174#L272 assume !false; 226#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 185#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 186#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 218#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 219#L252 assume !(0 != eval_~tmp___1~0#1); 205#L288 assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 206#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 231#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 181#L237-1 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 182#L302 assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1; 191#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 179#L310 start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 180#L330 assume !(0 != start_simulation_~tmp~3#1); 221#L323-2 [2021-12-22 20:28:55,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:28:55,220 INFO L85 PathProgramCache]: Analyzing trace with hash 889477097, now seen corresponding path program 1 times [2021-12-22 20:28:55,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:28:55,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153931500] [2021-12-22 20:28:55,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:28:55,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:28:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:28:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:28:55,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:28:55,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153931500] [2021-12-22 20:28:55,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153931500] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:28:55,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:28:55,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 20:28:55,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958149194] [2021-12-22 20:28:55,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:28:55,280 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 20:28:55,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:28:55,281 INFO L85 PathProgramCache]: Analyzing trace with hash 993904031, now seen corresponding path program 1 times [2021-12-22 20:28:55,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:28:55,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248150456] [2021-12-22 20:28:55,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:28:55,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:28:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:28:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:28:55,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:28:55,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248150456] [2021-12-22 20:28:55,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248150456] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:28:55,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:28:55,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 20:28:55,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021806399] [2021-12-22 20:28:55,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:28:55,340 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 20:28:55,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:28:55,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 20:28:55,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 20:28:55,341 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:28:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:28:55,354 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2021-12-22 20:28:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 20:28:55,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 99 transitions. [2021-12-22 20:28:55,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2021-12-22 20:28:55,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 99 transitions. [2021-12-22 20:28:55,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2021-12-22 20:28:55,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2021-12-22 20:28:55,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 99 transitions. [2021-12-22 20:28:55,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:28:55,360 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2021-12-22 20:28:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 99 transitions. [2021-12-22 20:28:55,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-22 20:28:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 70 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:28:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2021-12-22 20:28:55,363 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2021-12-22 20:28:55,363 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2021-12-22 20:28:55,364 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-22 20:28:55,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2021-12-22 20:28:55,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2021-12-22 20:28:55,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:28:55,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:28:55,365 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-22 20:28:55,366 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:28:55,366 INFO L791 eck$LassoCheckResult]: Stem: 384#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 371#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 343#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 344#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 322#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 323#L211-1 assume { :end_inline_init_threads } true; 372#L323-2 [2021-12-22 20:28:55,366 INFO L793 eck$LassoCheckResult]: Loop: 372#L323-2 assume !false; 342#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 325#L272 assume !false; 377#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 338#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 339#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 368#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 369#L252 assume !(0 != eval_~tmp___1~0#1); 356#L288 assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 357#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 381#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 332#L237-1 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 333#L302 assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1; 341#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 330#L310 start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 331#L330 assume !(0 != start_simulation_~tmp~3#1); 372#L323-2 [2021-12-22 20:28:55,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:28:55,367 INFO L85 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 1 times [2021-12-22 20:28:55,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:28:55,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556178639] [2021-12-22 20:28:55,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:28:55,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:28:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:28:55,377 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:28:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:28:55,410 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:28:55,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:28:55,412 INFO L85 PathProgramCache]: Analyzing trace with hash 993904031, now seen corresponding path program 2 times [2021-12-22 20:28:55,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:28:55,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994087562] [2021-12-22 20:28:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:28:55,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:28:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:28:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:28:55,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:28:55,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994087562] [2021-12-22 20:28:55,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994087562] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:28:55,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:28:55,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 20:28:55,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467435092] [2021-12-22 20:28:55,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:28:55,464 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 20:28:55,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:28:55,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 20:28:55,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 20:28:55,465 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. cyclomatic complexity: 29 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:28:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:28:55,538 INFO L93 Difference]: Finished difference Result 139 states and 192 transitions. [2021-12-22 20:28:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 20:28:55,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 192 transitions. [2021-12-22 20:28:55,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 133 [2021-12-22 20:28:55,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 139 states and 192 transitions. [2021-12-22 20:28:55,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2021-12-22 20:28:55,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2021-12-22 20:28:55,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 192 transitions. [2021-12-22 20:28:55,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:28:55,542 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 192 transitions. [2021-12-22 20:28:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 192 transitions. [2021-12-22 20:28:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 74. [2021-12-22 20:28:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 73 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:28:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2021-12-22 20:28:55,545 INFO L704 BuchiCegarLoop]: Abstraction has 74 states and 102 transitions. [2021-12-22 20:28:55,545 INFO L587 BuchiCegarLoop]: Abstraction has 74 states and 102 transitions. [2021-12-22 20:28:55,545 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-22 20:28:55,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 102 transitions. [2021-12-22 20:28:55,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-22 20:28:55,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:28:55,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:28:55,546 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-22 20:28:55,546 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:28:55,546 INFO L791 eck$LassoCheckResult]: Stem: 608#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 598#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 570#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 571#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 544#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 545#L211-1 assume { :end_inline_init_threads } true; 599#L323-2 [2021-12-22 20:28:55,547 INFO L793 eck$LassoCheckResult]: Loop: 599#L323-2 assume !false; 567#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 551#L272 assume !false; 604#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 562#L224 assume !(0 == ~p_dw_st~0); 564#L228 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2#1 := 0; 569#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 614#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 615#L252 assume !(0 != eval_~tmp___1~0#1); 583#L288 assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 584#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 609#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 558#L237-1 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 559#L302 assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1; 568#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 556#L310 start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 557#L330 assume !(0 != start_simulation_~tmp~3#1); 599#L323-2 [2021-12-22 20:28:55,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:28:55,547 INFO L85 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 2 times [2021-12-22 20:28:55,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:28:55,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542734959] [2021-12-22 20:28:55,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:28:55,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:28:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:28:55,552 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:28:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:28:55,569 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:28:55,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:28:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1089411781, now seen corresponding path program 1 times [2021-12-22 20:28:55,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:28:55,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568776466] [2021-12-22 20:28:55,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:28:55,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:28:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:28:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:28:55,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:28:55,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568776466] [2021-12-22 20:28:55,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568776466] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:28:55,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:28:55,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 20:28:55,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666739728] [2021-12-22 20:28:55,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:28:55,584 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 20:28:55,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:28:55,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 20:28:55,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 20:28:55,585 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. cyclomatic complexity: 29 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:28:55,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:28:55,619 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2021-12-22 20:28:55,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 20:28:55,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 170 transitions. [2021-12-22 20:28:55,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 117 [2021-12-22 20:28:55,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 170 transitions. [2021-12-22 20:28:55,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-22 20:28:55,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-22 20:28:55,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 170 transitions. [2021-12-22 20:28:55,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:28:55,623 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 170 transitions. [2021-12-22 20:28:55,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 170 transitions. [2021-12-22 20:28:55,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2021-12-22 20:28:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 107 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:28:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2021-12-22 20:28:55,626 INFO L704 BuchiCegarLoop]: Abstraction has 108 states and 146 transitions. [2021-12-22 20:28:55,626 INFO L587 BuchiCegarLoop]: Abstraction has 108 states and 146 transitions. [2021-12-22 20:28:55,626 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-22 20:28:55,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 146 transitions. [2021-12-22 20:28:55,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2021-12-22 20:28:55,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:28:55,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:28:55,628 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:28:55,628 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:28:55,628 INFO L791 eck$LassoCheckResult]: Stem: 816#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 805#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 777#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 778#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 747#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 748#L211-1 assume { :end_inline_init_threads } true; 806#L323-2 assume !false; 837#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 833#L272 [2021-12-22 20:28:55,628 INFO L793 eck$LassoCheckResult]: Loop: 833#L272 assume !false; 832#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 831#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 830#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 828#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 826#L252 assume 0 != eval_~tmp___1~0#1; 825#L252-1 assume 0 == ~p_dw_st~0;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 823#L261 assume !(0 != eval_~tmp~1#1); 824#L257 assume !(0 == ~c_dr_st~0); 833#L272 [2021-12-22 20:28:55,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:28:55,628 INFO L85 PathProgramCache]: Analyzing trace with hash 88939597, now seen corresponding path program 1 times [2021-12-22 20:28:55,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:28:55,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562416303] [2021-12-22 20:28:55,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:28:55,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:28:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:28:55,634 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:28:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:28:55,640 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:28:55,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:28:55,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1880932388, now seen corresponding path program 1 times [2021-12-22 20:28:55,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:28:55,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174699038] [2021-12-22 20:28:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:28:55,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:28:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:28:55,643 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:28:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:28:55,646 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:28:55,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:28:55,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1617118888, now seen corresponding path program 1 times [2021-12-22 20:28:55,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:28:55,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946448706] [2021-12-22 20:28:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:28:55,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:28:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:28:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:28:55,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:28:55,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946448706] [2021-12-22 20:28:55,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946448706] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:28:55,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:28:55,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 20:28:55,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438051322] [2021-12-22 20:28:55,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:28:55,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:28:55,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 20:28:55,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 20:28:55,711 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. cyclomatic complexity: 39 Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:28:55,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:28:55,742 INFO L93 Difference]: Finished difference Result 189 states and 254 transitions. [2021-12-22 20:28:55,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 20:28:55,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 254 transitions. [2021-12-22 20:28:55,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 181 [2021-12-22 20:28:55,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 189 states and 254 transitions. [2021-12-22 20:28:55,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 189 [2021-12-22 20:28:55,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2021-12-22 20:28:55,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 254 transitions. [2021-12-22 20:28:55,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:28:55,746 INFO L681 BuchiCegarLoop]: Abstraction has 189 states and 254 transitions. [2021-12-22 20:28:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 254 transitions. [2021-12-22 20:28:55,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 151. [2021-12-22 20:28:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 150 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:28:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 202 transitions. [2021-12-22 20:28:55,751 INFO L704 BuchiCegarLoop]: Abstraction has 151 states and 202 transitions. [2021-12-22 20:28:55,751 INFO L587 BuchiCegarLoop]: Abstraction has 151 states and 202 transitions. [2021-12-22 20:28:55,751 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-22 20:28:55,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 202 transitions. [2021-12-22 20:28:55,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2021-12-22 20:28:55,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:28:55,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:28:55,752 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:28:55,753 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:28:55,753 INFO L791 eck$LassoCheckResult]: Stem: 1123#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1111#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1080#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 1081#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1056#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1057#L211-1 assume { :end_inline_init_threads } true; 1112#L323-2 assume !false; 1184#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 1183#L272 [2021-12-22 20:28:55,753 INFO L793 eck$LassoCheckResult]: Loop: 1183#L272 assume !false; 1182#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1181#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1133#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1108#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 1109#L252 assume 0 != eval_~tmp___1~0#1; 1122#L252-1 assume 0 == ~p_dw_st~0;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 1138#L261 assume !(0 != eval_~tmp~1#1); 1140#L257 assume 0 == ~c_dr_st~0;eval_~tmp___0~1#1 := eval_#t~nondet9#1;havoc eval_#t~nondet9#1; 1165#L276 assume !(0 != eval_~tmp___0~1#1); 1183#L272 [2021-12-22 20:28:55,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:28:55,753 INFO L85 PathProgramCache]: Analyzing trace with hash 88939597, now seen corresponding path program 2 times [2021-12-22 20:28:55,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:28:55,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640568402] [2021-12-22 20:28:55,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:28:55,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:28:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:28:55,770 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:28:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:28:55,776 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:28:55,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:28:55,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1820641234, now seen corresponding path program 1 times [2021-12-22 20:28:55,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:28:55,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032559827] [2021-12-22 20:28:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:28:55,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:28:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:28:55,780 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:28:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:28:55,784 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:28:55,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:28:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1408918906, now seen corresponding path program 1 times [2021-12-22 20:28:55,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:28:55,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089560589] [2021-12-22 20:28:55,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:28:55,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:28:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:28:55,791 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:28:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:28:55,798 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:28:56,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.12 08:28:56 BoogieIcfgContainer [2021-12-22 20:28:56,208 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-22 20:28:56,209 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 20:28:56,209 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 20:28:56,209 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 20:28:56,214 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:28:54" (3/4) ... [2021-12-22 20:28:56,217 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-22 20:28:56,262 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 20:28:56,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 20:28:56,263 INFO L158 Benchmark]: Toolchain (without parser) took 2055.37ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 67.2MB in the beginning and 62.9MB in the end (delta: 4.4MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2021-12-22 20:28:56,264 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 77.6MB. Free memory is still 35.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 20:28:56,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.73ms. Allocated memory is still 98.6MB. Free memory was 67.2MB in the beginning and 73.7MB in the end (delta: -6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 20:28:56,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.11ms. Allocated memory is still 98.6MB. Free memory was 73.7MB in the beginning and 71.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 20:28:56,265 INFO L158 Benchmark]: Boogie Preprocessor took 15.81ms. Allocated memory is still 98.6MB. Free memory was 71.6MB in the beginning and 69.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 20:28:56,265 INFO L158 Benchmark]: RCFGBuilder took 371.43ms. Allocated memory is still 98.6MB. Free memory was 69.5MB in the beginning and 55.9MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-22 20:28:56,265 INFO L158 Benchmark]: BuchiAutomizer took 1365.38ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 55.9MB in the beginning and 65.0MB in the end (delta: -9.1MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2021-12-22 20:28:56,266 INFO L158 Benchmark]: Witness Printer took 53.93ms. Allocated memory is still 121.6MB. Free memory was 65.0MB in the beginning and 62.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 20:28:56,267 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.15ms. Allocated memory is still 77.6MB. Free memory is still 35.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.73ms. Allocated memory is still 98.6MB. Free memory was 67.2MB in the beginning and 73.7MB in the end (delta: -6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.11ms. Allocated memory is still 98.6MB. Free memory was 73.7MB in the beginning and 71.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.81ms. Allocated memory is still 98.6MB. Free memory was 71.6MB in the beginning and 69.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 371.43ms. Allocated memory is still 98.6MB. Free memory was 69.5MB in the beginning and 55.9MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 1365.38ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 55.9MB in the beginning and 65.0MB in the end (delta: -9.1MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Witness Printer took 53.93ms. Allocated memory is still 121.6MB. Free memory was 65.0MB in the beginning and 62.9MB 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 5 locations. The remainder module has 151 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. 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.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 120 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 151 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 586 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 586 mSDsluCounter, 972 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 433 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 539 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 247]: 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 {p_last_write=0, c_dr_i=1, c_dr_pc=0, a_t=0, NULL=0, NULL=1, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62c8e28f=0, c_num_read=0, c_dr_st=0, q_read_ev=2, p_dw_i=1, tmp=0, q_write_ev=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5285a87e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@57c4f2bc=0, tmp___1=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7303dcbe=0, p_dw_pc=0, q_free=1, __retres1=1, tmp=0, \result=0, p_dw_st=0, tmp___0=0, c_last_read=0, NULL=0, kernel_st=1, p_num_write=0, q_buf_0=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 247]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L24] int q_buf_0 ; [L25] int q_free ; [L26] int q_read_ev ; [L27] int q_write_ev ; [L28] int p_num_write ; [L29] int p_last_write ; [L30] int p_dw_st ; [L31] int p_dw_pc ; [L32] int p_dw_i ; [L33] int c_num_read ; [L34] int c_last_read ; [L35] int c_dr_st ; [L36] int c_dr_pc ; [L37] int c_dr_i ; [L144] static int a_t ; [L360] int __retres1 ; [L364] CALL init_model() [L346] q_free = 1 [L347] q_write_ev = 2 [L348] q_read_ev = q_write_ev [L349] p_num_write = 0 [L350] p_dw_pc = 0 [L351] p_dw_i = 1 [L352] c_num_read = 0 [L353] c_dr_pc = 0 [L354] c_dr_i = 1 [L364] RET init_model() [L365] CALL start_simulation() [L314] int kernel_st ; [L315] int tmp ; [L319] kernel_st = 0 [L320] CALL init_threads() [L206] COND TRUE (int )p_dw_i == 1 [L207] p_dw_st = 0 [L211] COND TRUE (int )c_dr_i == 1 [L212] c_dr_st = 0 [L320] RET init_threads() [L323] COND TRUE 1 [L326] kernel_st = 1 [L327] CALL eval() [L241] int tmp ; [L242] int tmp___0 ; [L243] int tmp___1 ; Loop: [L247] COND TRUE 1 [L250] CALL, EXPR exists_runnable_thread() [L221] int __retres1 ; [L224] COND TRUE (int )p_dw_st == 0 [L225] __retres1 = 1 [L237] return (__retres1); [L250] RET, EXPR exists_runnable_thread() [L250] tmp___1 = exists_runnable_thread() [L252] COND TRUE \read(tmp___1) [L257] COND TRUE (int )p_dw_st == 0 [L259] tmp = __VERIFIER_nondet_int() [L261] COND FALSE !(\read(tmp)) [L272] COND TRUE (int )c_dr_st == 0 [L274] tmp___0 = __VERIFIER_nondet_int() [L276] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-22 20:28:56,321 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)