./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 8d31f386 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 a436e4bf9da4ee1e6356d8c8c6b3cd5e98b60423 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.multireach-323-8d31f38 [2021-07-06 20:41:15,543 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 20:41:15,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 20:41:15,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 20:41:15,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 20:41:15,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 20:41:15,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 20:41:15,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 20:41:15,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 20:41:15,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 20:41:15,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 20:41:15,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 20:41:15,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 20:41:15,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 20:41:15,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 20:41:15,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 20:41:15,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 20:41:15,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 20:41:15,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 20:41:15,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 20:41:15,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 20:41:15,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 20:41:15,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 20:41:15,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 20:41:15,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 20:41:15,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 20:41:15,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 20:41:15,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 20:41:15,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 20:41:15,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 20:41:15,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 20:41:15,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 20:41:15,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 20:41:15,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 20:41:15,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 20:41:15,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 20:41:15,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 20:41:15,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 20:41:15,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 20:41:15,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 20:41:15,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 20:41:15,627 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-07-06 20:41:15,657 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 20:41:15,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 20:41:15,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 20:41:15,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 20:41:15,659 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 20:41:15,659 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 20:41:15,659 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 20:41:15,659 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 20:41:15,659 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 20:41:15,660 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 20:41:15,660 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 20:41:15,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 20:41:15,660 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 20:41:15,660 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 20:41:15,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 20:41:15,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 20:41:15,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 20:41:15,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 20:41:15,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 20:41:15,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 20:41:15,661 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 20:41:15,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 20:41:15,661 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 20:41:15,661 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 20:41:15,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 20:41:15,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 20:41:15,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 20:41:15,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 20:41:15,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 20:41:15,662 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 20:41:15,662 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 20:41:15,662 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 -> a436e4bf9da4ee1e6356d8c8c6b3cd5e98b60423 [2021-07-06 20:41:15,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 20:41:15,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 20:41:15,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 20:41:15,922 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 20:41:15,923 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 20:41:15,923 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-07-06 20:41:15,975 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4055607e9/061f29ab9f47432884fe52e3ffe3ab39/FLAGd34bf0dec [2021-07-06 20:41:16,307 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 20:41:16,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-07-06 20:41:16,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4055607e9/061f29ab9f47432884fe52e3ffe3ab39/FLAGd34bf0dec [2021-07-06 20:41:16,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4055607e9/061f29ab9f47432884fe52e3ffe3ab39 [2021-07-06 20:41:16,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 20:41:16,747 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 20:41:16,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 20:41:16,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 20:41:16,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 20:41:16,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:41:16" (1/1) ... [2021-07-06 20:41:16,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4247c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:41:16, skipping insertion in model container [2021-07-06 20:41:16,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:41:16" (1/1) ... [2021-07-06 20:41:16,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 20:41:16,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 20:41:16,872 WARN L224 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[337,350] [2021-07-06 20:41:16,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:41:16,897 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 20:41:16,905 WARN L224 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[337,350] [2021-07-06 20:41:16,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:41:16,962 INFO L208 MainTranslator]: Completed translation [2021-07-06 20:41:16,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:41:16 WrapperNode [2021-07-06 20:41:16,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 20:41:16,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 20:41:16,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 20:41:16,970 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 20:41:16,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:41:16" (1/1) ... [2021-07-06 20:41:16,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:41:16" (1/1) ... [2021-07-06 20:41:16,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 20:41:16,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 20:41:16,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 20:41:16,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 20:41:17,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:41:16" (1/1) ... [2021-07-06 20:41:17,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:41:16" (1/1) ... [2021-07-06 20:41:17,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:41:16" (1/1) ... [2021-07-06 20:41:17,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:41:16" (1/1) ... [2021-07-06 20:41:17,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:41:16" (1/1) ... [2021-07-06 20:41:17,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:41:16" (1/1) ... [2021-07-06 20:41:17,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:41:16" (1/1) ... [2021-07-06 20:41:17,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 20:41:17,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 20:41:17,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 20:41:17,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 20:41:17,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:41:16" (1/1) ... [2021-07-06 20:41:17,036 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 20:41:17,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 20:41:17,053 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-07-06 20:41:17,072 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-07-06 20:41:17,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 20:41:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 20:41:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 20:41:17,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 20:41:17,442 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 20:41:17,442 INFO L299 CfgBuilder]: Removed 42 assume(true) statements. [2021-07-06 20:41:17,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:41:17 BoogieIcfgContainer [2021-07-06 20:41:17,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 20:41:17,444 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 20:41:17,444 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 20:41:17,446 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 20:41:17,446 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:41:17,446 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 08:41:16" (1/3) ... [2021-07-06 20:41:17,447 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@399ef4a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:41:17, skipping insertion in model container [2021-07-06 20:41:17,447 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:41:17,447 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:41:16" (2/3) ... [2021-07-06 20:41:17,448 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@399ef4a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:41:17, skipping insertion in model container [2021-07-06 20:41:17,448 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:41:17,448 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:41:17" (3/3) ... [2021-07-06 20:41:17,449 INFO L389 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2021-07-06 20:41:17,475 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 20:41:17,475 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 20:41:17,475 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 20:41:17,476 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 20:41:17,476 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 20:41:17,476 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 20:41:17,476 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 20:41:17,476 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 20:41:17,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 74 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 73 states have internal predecessors, (114), 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-07-06 20:41:17,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2021-07-06 20:41:17,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:41:17,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:41:17,504 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-07-06 20:41:17,504 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:41:17,504 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 20:41:17,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 74 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 73 states have internal predecessors, (114), 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-07-06 20:41:17,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2021-07-06 20:41:17,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:41:17,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:41:17,517 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-07-06 20:41:17,517 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:41:17,522 INFO L791 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 8#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 30#L348true havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 21#L198true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 37#L198-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 34#L315-1true [2021-07-06 20:41:17,522 INFO L793 eck$LassoCheckResult]: Loop: 34#L315-1true assume !false; 50#L316true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 26#L264true assume false; 71#L280true havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 31#L216-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 54#L228-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 76#L229-1true stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 41#L294true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 52#L301true stop_simulation_#res := stop_simulation_~__retres2~0; 73#L302true start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 22#L322true assume !(0 != start_simulation_~tmp~3); 34#L315-1true [2021-07-06 20:41:17,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:41:17,527 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2021-07-06 20:41:17,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:41:17,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594106280] [2021-07-06 20:41:17,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:41:17,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:41:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:41:17,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:41:17,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:41:17,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:41:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:41:17,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:41:17,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594106280] [2021-07-06 20:41:17,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594106280] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:41:17,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:41:17,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:41:17,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971107593] [2021-07-06 20:41:17,673 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-07-06 20:41:17,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:41:17,674 INFO L82 PathProgramCache]: Analyzing trace with hash -168076210, now seen corresponding path program 1 times [2021-07-06 20:41:17,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:41:17,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537234868] [2021-07-06 20:41:17,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:41:17,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:41:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:41:17,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:41:17,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:41:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:41:17,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:41:17,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537234868] [2021-07-06 20:41:17,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537234868] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:41:17,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:41:17,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-06 20:41:17,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726378997] [2021-07-06 20:41:17,702 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:41:17,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:41:17,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:41:17,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:41:17,714 INFO L87 Difference]: Start difference. First operand has 74 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 73 states have internal predecessors, (114), 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 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:41:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:41:17,726 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2021-07-06 20:41:17,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:41:17,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2021-07-06 20:41:17,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-07-06 20:41:17,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 68 states and 97 transitions. [2021-07-06 20:41:17,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-07-06 20:41:17,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-07-06 20:41:17,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 97 transitions. [2021-07-06 20:41:17,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:41:17,733 INFO L681 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2021-07-06 20:41:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 97 transitions. [2021-07-06 20:41:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-07-06 20:41:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 67 states have internal predecessors, (97), 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-07-06 20:41:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2021-07-06 20:41:17,751 INFO L704 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2021-07-06 20:41:17,751 INFO L587 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2021-07-06 20:41:17,751 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 20:41:17,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 97 transitions. [2021-07-06 20:41:17,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-07-06 20:41:17,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:41:17,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:41:17,753 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-07-06 20:41:17,753 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:41:17,753 INFO L791 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 165#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 166#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 186#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 187#L198-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 189#L315-1 [2021-07-06 20:41:17,753 INFO L793 eck$LassoCheckResult]: Loop: 189#L315-1 assume !false; 201#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 182#L264 assume !false; 196#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 199#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 191#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 219#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 220#L244 assume !(0 != eval_~tmp___1~0); 224#L280 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 198#L216-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 185#L228-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 218#L229-1 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 207#L294 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 208#L301 stop_simulation_#res := stop_simulation_~__retres2~0; 216#L302 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 188#L322 assume !(0 != start_simulation_~tmp~3); 189#L315-1 [2021-07-06 20:41:17,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:41:17,754 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2021-07-06 20:41:17,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:41:17,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161801330] [2021-07-06 20:41:17,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:41:17,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:41:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:41:17,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:41:17,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:41:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:41:17,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:41:17,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161801330] [2021-07-06 20:41:17,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161801330] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:41:17,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:41:17,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-06 20:41:17,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614005319] [2021-07-06 20:41:17,785 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-07-06 20:41:17,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:41:17,787 INFO L82 PathProgramCache]: Analyzing trace with hash -241927711, now seen corresponding path program 1 times [2021-07-06 20:41:17,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:41:17,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132296065] [2021-07-06 20:41:17,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:41:17,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:41:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:41:17,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:41:17,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:41:17,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:41:17,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:41:17,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:41:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:41:17,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:41:17,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132296065] [2021-07-06 20:41:17,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132296065] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:41:17,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:41:17,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-06 20:41:17,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016711618] [2021-07-06 20:41:17,848 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:41:17,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:41:17,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:41:17,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:41:17,849 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. cyclomatic complexity: 30 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:41:17,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:41:17,856 INFO L93 Difference]: Finished difference Result 68 states and 96 transitions. [2021-07-06 20:41:17,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:41:17,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 96 transitions. [2021-07-06 20:41:17,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-07-06 20:41:17,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 96 transitions. [2021-07-06 20:41:17,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-07-06 20:41:17,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-07-06 20:41:17,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2021-07-06 20:41:17,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:41:17,859 INFO L681 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-07-06 20:41:17,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2021-07-06 20:41:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-07-06 20:41:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.411764705882353) internal successors, (96), 67 states have internal predecessors, (96), 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-07-06 20:41:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2021-07-06 20:41:17,863 INFO L704 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-07-06 20:41:17,863 INFO L587 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-07-06 20:41:17,863 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 20:41:17,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2021-07-06 20:41:17,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-07-06 20:41:17,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:41:17,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:41:17,864 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-07-06 20:41:17,864 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:41:17,865 INFO L791 eck$LassoCheckResult]: Stem: 342#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 310#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 311#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 331#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 332#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 334#L315-1 [2021-07-06 20:41:17,865 INFO L793 eck$LassoCheckResult]: Loop: 334#L315-1 assume !false; 347#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 327#L264 assume !false; 341#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 344#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 336#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 364#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 365#L244 assume !(0 != eval_~tmp___1~0); 369#L280 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 343#L216-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 330#L228-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 363#L229-1 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 352#L294 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 353#L301 stop_simulation_#res := stop_simulation_~__retres2~0; 361#L302 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 333#L322 assume !(0 != start_simulation_~tmp~3); 334#L315-1 [2021-07-06 20:41:17,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:41:17,865 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2021-07-06 20:41:17,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:41:17,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145148214] [2021-07-06 20:41:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:41:17,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:41:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:41:17,874 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:41:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:41:17,881 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:41:17,893 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:41:17,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:41:17,909 INFO L82 PathProgramCache]: Analyzing trace with hash -241927711, now seen corresponding path program 2 times [2021-07-06 20:41:17,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:41:17,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571020068] [2021-07-06 20:41:17,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:41:17,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:41:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:41:17,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:41:17,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:41:17,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:41:17,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:41:17,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:17,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:41:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:41:17,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:41:17,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571020068] [2021-07-06 20:41:17,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571020068] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:41:17,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:41:17,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-06 20:41:17,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816033094] [2021-07-06 20:41:17,933 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:41:17,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:41:17,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 20:41:17,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-06 20:41:17,933 INFO L87 Difference]: Start difference. First operand 68 states and 96 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-07-06 20:41:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:41:18,011 INFO L93 Difference]: Finished difference Result 134 states and 187 transitions. [2021-07-06 20:41:18,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-06 20:41:18,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 187 transitions. [2021-07-06 20:41:18,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2021-07-06 20:41:18,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 187 transitions. [2021-07-06 20:41:18,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2021-07-06 20:41:18,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2021-07-06 20:41:18,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 187 transitions. [2021-07-06 20:41:18,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:41:18,015 INFO L681 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2021-07-06 20:41:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 187 transitions. [2021-07-06 20:41:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2021-07-06 20:41:18,019 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-07-06 20:41:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2021-07-06 20:41:18,019 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2021-07-06 20:41:18,019 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2021-07-06 20:41:18,019 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 20:41:18,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2021-07-06 20:41:18,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-07-06 20:41:18,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:41:18,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:41:18,021 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-07-06 20:41:18,021 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:41:18,021 INFO L791 eck$LassoCheckResult]: Stem: 561#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 528#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 529#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 549#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 550#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 552#L315-1 [2021-07-06 20:41:18,021 INFO L793 eck$LassoCheckResult]: Loop: 552#L315-1 assume !false; 565#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 545#L264 assume !false; 560#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 563#L216 assume !(0 == ~p_dw_st~0); 553#L220 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 554#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 590#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 589#L244 assume !(0 != eval_~tmp___1~0); 588#L280 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 562#L216-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 548#L228-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 582#L229-1 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 571#L294 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 572#L301 stop_simulation_#res := stop_simulation_~__retres2~0; 580#L302 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 551#L322 assume !(0 != start_simulation_~tmp~3); 552#L315-1 [2021-07-06 20:41:18,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:41:18,022 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2021-07-06 20:41:18,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:41:18,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743540662] [2021-07-06 20:41:18,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:41:18,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:41:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:41:18,030 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:41:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:41:18,040 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:41:18,044 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:41:18,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:41:18,044 INFO L82 PathProgramCache]: Analyzing trace with hash 616414076, now seen corresponding path program 1 times [2021-07-06 20:41:18,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:41:18,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190458394] [2021-07-06 20:41:18,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:41:18,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:41:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:41:18,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:18,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:41:18,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:18,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 20:41:18,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:18,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:41:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:41:18,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:41:18,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190458394] [2021-07-06 20:41:18,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190458394] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:41:18,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:41:18,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:41:18,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319577503] [2021-07-06 20:41:18,059 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:41:18,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:41:18,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:41:18,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:41:18,060 INFO L87 Difference]: Start difference. First operand 71 states and 99 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-07-06 20:41:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:41:18,096 INFO L93 Difference]: Finished difference Result 121 states and 166 transitions. [2021-07-06 20:41:18,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:41:18,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 166 transitions. [2021-07-06 20:41:18,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2021-07-06 20:41:18,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 166 transitions. [2021-07-06 20:41:18,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2021-07-06 20:41:18,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2021-07-06 20:41:18,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 166 transitions. [2021-07-06 20:41:18,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:41:18,102 INFO L681 BuchiCegarLoop]: Abstraction has 121 states and 166 transitions. [2021-07-06 20:41:18,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 166 transitions. [2021-07-06 20:41:18,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2021-07-06 20:41:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 103 states have internal predecessors, (142), 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-07-06 20:41:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions. [2021-07-06 20:41:18,114 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2021-07-06 20:41:18,114 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2021-07-06 20:41:18,114 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-07-06 20:41:18,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 142 transitions. [2021-07-06 20:41:18,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2021-07-06 20:41:18,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:41:18,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:41:18,115 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:41:18,116 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:41:18,117 INFO L791 eck$LassoCheckResult]: Stem: 760#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 726#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 727#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 748#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 749#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 769#L315-1 assume !false; 806#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 802#L264 [2021-07-06 20:41:18,117 INFO L793 eck$LassoCheckResult]: Loop: 802#L264 assume !false; 801#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 800#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 786#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 787#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 788#L244 assume 0 != eval_~tmp___1~0; 793#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 755#L253 assume !(0 != eval_~tmp~1); 756#L249 assume !(0 == ~c_dr_st~0); 802#L264 [2021-07-06 20:41:18,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:41:18,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2021-07-06 20:41:18,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:41:18,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064415086] [2021-07-06 20:41:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:41:18,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:41:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:41:18,131 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:41:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:41:18,141 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:41:18,145 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:41:18,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:41:18,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1028489344, now seen corresponding path program 1 times [2021-07-06 20:41:18,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:41:18,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922628168] [2021-07-06 20:41:18,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:41:18,151 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:41:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:41:18,154 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:41:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:41:18,156 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:41:18,169 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:41:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:41:18,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1783037256, now seen corresponding path program 1 times [2021-07-06 20:41:18,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:41:18,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536147917] [2021-07-06 20:41:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:41:18,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:41:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:41:18,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:18,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:41:18,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:18,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:41:18,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:41:18,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:41:18,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536147917] [2021-07-06 20:41:18,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536147917] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:41:18,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:41:18,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-06 20:41:18,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515263481] [2021-07-06 20:41:18,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:18,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-06 20:41:18,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:41:18,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:41:18,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:41:18,267 INFO L87 Difference]: Start difference. First operand 104 states and 142 transitions. cyclomatic complexity: 39 Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-07-06 20:41:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:41:18,291 INFO L93 Difference]: Finished difference Result 184 states and 249 transitions. [2021-07-06 20:41:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:41:18,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 249 transitions. [2021-07-06 20:41:18,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 177 [2021-07-06 20:41:18,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 184 states and 249 transitions. [2021-07-06 20:41:18,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2021-07-06 20:41:18,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2021-07-06 20:41:18,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 249 transitions. [2021-07-06 20:41:18,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:41:18,295 INFO L681 BuchiCegarLoop]: Abstraction has 184 states and 249 transitions. [2021-07-06 20:41:18,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 249 transitions. [2021-07-06 20:41:18,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 146. [2021-07-06 20:41:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 145 states have internal predecessors, (197), 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-07-06 20:41:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 197 transitions. [2021-07-06 20:41:18,302 INFO L704 BuchiCegarLoop]: Abstraction has 146 states and 197 transitions. [2021-07-06 20:41:18,302 INFO L587 BuchiCegarLoop]: Abstraction has 146 states and 197 transitions. [2021-07-06 20:41:18,302 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-07-06 20:41:18,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 197 transitions. [2021-07-06 20:41:18,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2021-07-06 20:41:18,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:41:18,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:41:18,304 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:41:18,304 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:41:18,304 INFO L791 eck$LassoCheckResult]: Stem: 1057#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 1023#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 1024#L348 havoc start_simulation_#t~ret14, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1045#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1046#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1067#L315-1 assume !false; 1137#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 1135#L264 [2021-07-06 20:41:18,304 INFO L793 eck$LassoCheckResult]: Loop: 1135#L264 assume !false; 1132#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1130#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1128#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1126#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 1124#L244 assume 0 != eval_~tmp___1~0; 1122#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 1116#L253 assume !(0 != eval_~tmp~1); 1118#L249 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet12;havoc eval_#t~nondet12; 1136#L268 assume !(0 != eval_~tmp___0~1); 1135#L264 [2021-07-06 20:41:18,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:41:18,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2021-07-06 20:41:18,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:41:18,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886210299] [2021-07-06 20:41:18,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:41:18,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:41:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:41:18,311 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:41:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:41:18,316 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:41:18,318 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:41:18,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:41:18,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1818395562, now seen corresponding path program 1 times [2021-07-06 20:41:18,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:41:18,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978136196] [2021-07-06 20:41:18,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:41:18,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:41:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:41:18,322 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:41:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:41:18,324 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:41:18,326 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:41:18,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:41:18,326 INFO L82 PathProgramCache]: Analyzing trace with hash 560416882, now seen corresponding path program 1 times [2021-07-06 20:41:18,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:41:18,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423870666] [2021-07-06 20:41:18,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:41:18,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:41:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:41:18,332 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:41:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:41:18,337 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:41:18,340 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:41:18,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:18,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-06 20:41:18,720 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2021-07-06 20:41:18,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:41:18,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 152 [2021-07-06 20:41:18,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 08:41:18 BoogieIcfgContainer [2021-07-06 20:41:18,866 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 20:41:18,866 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 20:41:18,866 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 20:41:18,866 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 20:41:18,867 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:41:17" (3/4) ... [2021-07-06 20:41:18,868 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 20:41:18,890 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 20:41:18,891 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 20:41:18,891 INFO L168 Benchmark]: Toolchain (without parser) took 2144.12 ms. Allocated memory was 62.9 MB in the beginning and 100.7 MB in the end (delta: 37.7 MB). Free memory was 45.0 MB in the beginning and 72.5 MB in the end (delta: -27.5 MB). Peak memory consumption was 10.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:41:18,892 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 62.9 MB. Free memory was 44.7 MB in the beginning and 44.6 MB in the end (delta: 54.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:41:18,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.80 ms. Allocated memory is still 62.9 MB. Free memory was 44.7 MB in the beginning and 45.4 MB in the end (delta: -685.3 kB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. [2021-07-06 20:41:18,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.75 ms. Allocated memory is still 62.9 MB. Free memory was 45.4 MB in the beginning and 43.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:41:18,892 INFO L168 Benchmark]: Boogie Preprocessor took 34.16 ms. Allocated memory is still 62.9 MB. Free memory was 43.5 MB in the beginning and 41.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:41:18,893 INFO L168 Benchmark]: RCFGBuilder took 412.62 ms. Allocated memory was 62.9 MB in the beginning and 77.6 MB in the end (delta: 14.7 MB). Free memory was 41.8 MB in the beginning and 50.5 MB in the end (delta: -8.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:41:18,893 INFO L168 Benchmark]: BuchiAutomizer took 1422.16 ms. Allocated memory was 77.6 MB in the beginning and 100.7 MB in the end (delta: 23.1 MB). Free memory was 50.5 MB in the beginning and 74.6 MB in the end (delta: -24.1 MB). Peak memory consumption was 41.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:41:18,893 INFO L168 Benchmark]: Witness Printer took 24.51 ms. Allocated memory is still 100.7 MB. Free memory was 74.6 MB in the beginning and 72.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:41:18,894 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.10 ms. Allocated memory is still 62.9 MB. Free memory was 44.7 MB in the beginning and 44.6 MB in the end (delta: 54.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 219.80 ms. Allocated memory is still 62.9 MB. Free memory was 44.7 MB in the beginning and 45.4 MB in the end (delta: -685.3 kB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 25.75 ms. Allocated memory is still 62.9 MB. Free memory was 45.4 MB in the beginning and 43.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.16 ms. Allocated memory is still 62.9 MB. Free memory was 43.5 MB in the beginning and 41.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 412.62 ms. Allocated memory was 62.9 MB in the beginning and 77.6 MB in the end (delta: 14.7 MB). Free memory was 41.8 MB in the beginning and 50.5 MB in the end (delta: -8.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 1422.16 ms. Allocated memory was 77.6 MB in the beginning and 100.7 MB in the end (delta: 23.1 MB). Free memory was 50.5 MB in the beginning and 74.6 MB in the end (delta: -24.1 MB). Peak memory consumption was 41.2 MB. Max. memory is 16.1 GB. * Witness Printer took 24.51 ms. Allocated memory is still 100.7 MB. Free memory was 74.6 MB in the beginning and 72.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * 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 146 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. 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 34.2ms AutomataMinimizationTime, 5 MinimizatonAttempts, 118 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 146 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 537 SDtfs, 571 SDslu, 420 SDs, 0 SdLazy, 55 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 73.7ms Time 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: 239]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=26355} State at position 1 is {p_last_write=0, c_dr_i=1, c_dr_pc=0, NULL=26358, a_t=0, NULL=0, \result=0, NULL=26355, c_num_read=0, tmp=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___0=0, tmp___1=1, q_write_ev=2, __retres1=1, NULL=26356, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8f30301=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66db73fd=0, p_dw_pc=0, NULL=0, NULL=0, NULL=0, tmp=0, q_free=1, NULL=26357, p_dw_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75496a7b=0, c_last_read=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13cf264a=0, p_num_write=0, q_buf_0=0, __retres1=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 239]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L16] int q_buf_0 ; [L17] int q_free ; [L18] int q_read_ev ; [L19] int q_write_ev ; [L20] int p_num_write ; [L21] int p_last_write ; [L22] int p_dw_st ; [L23] int p_dw_pc ; [L24] int p_dw_i ; [L25] int c_num_read ; [L26] int c_last_read ; [L27] int c_dr_st ; [L28] int c_dr_pc ; [L29] int c_dr_i ; [L136] static int a_t ; [L352] int __retres1 ; [L338] q_free = 1 [L339] q_write_ev = 2 [L340] q_read_ev = q_write_ev [L341] p_num_write = 0 [L342] p_dw_pc = 0 [L343] p_dw_i = 1 [L344] c_num_read = 0 [L345] c_dr_pc = 0 [L346] c_dr_i = 1 [L306] int kernel_st ; [L307] int tmp ; [L311] kernel_st = 0 [L198] COND TRUE (int )p_dw_i == 1 [L199] p_dw_st = 0 [L203] COND TRUE (int )c_dr_i == 1 [L204] c_dr_st = 0 [L315] COND TRUE 1 [L318] kernel_st = 1 [L233] int tmp ; [L234] int tmp___0 ; [L235] int tmp___1 ; Loop: [L239] COND TRUE 1 [L213] int __retres1 ; [L216] COND TRUE (int )p_dw_st == 0 [L217] __retres1 = 1 [L229] return (__retres1); [L242] tmp___1 = exists_runnable_thread() [L244] COND TRUE \read(tmp___1) [L249] COND TRUE (int )p_dw_st == 0 [L251] tmp = __VERIFIER_nondet_int() [L253] COND FALSE !(\read(tmp)) [L264] COND TRUE (int )c_dr_st == 0 [L266] tmp___0 = __VERIFIER_nondet_int() [L268] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 20:41:18,927 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...